DAYANANDA SAGAR COLLEGE OF ENGINEERING
VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELGAUM
SCHEME OF TEACHING AND EXAMINATION III SEMESTER - Master of Computer Applications S . N o . 1 2 3 4 5 6 Subject Code Title Teaching Hrs / Week Theory Practical Examination Duration IA 10MCA31 10MCA32 10MCA33 10MCA34 10MCA35 10MCA36 System Software Computer Networks Programming with Java Database Management Systems Operating Systems Systems Programming Laboratory Java Programming Laboratory DBMS Laboratory Total 04 04 04 04 04 20 03 03 03 09 03 03 03 03 03 03 03 03 50 50 50 50 50 50 50 50 400 Marks Exam 100 100 100 100 100 50 50 50 650 Total 150 150 150 150 150 100 100 100 1050
7 10MCA37 8 10MCA38
VARUN 1DS10MCA47 MCA-VTU DSCE,BANGALORE
Instruction Formats & Addressing Modes. Bootstrap Loaders. Interactive Debugging Systems . 2 (Page 2-42). Shift/Reduce Parsing. Marks : 50 Exam Marks: 100
Subject Code: 10MCA31 Total Hours : 52 Exam Hours: 03
Machine Architecture 6 Hours Introduction.Design of an Absolute Loader.MASM Assembler. Machine-Independent Macro Processor Features . The Rules Section. The LEXER.A Simple SIC Assembler.Levine.3. Expression.MASM Macro Processor. A Simple Bootstrap Loader. 3 (Page 51-65)) Reference Books: 1. Running LEX and YACC. Symbol Tables. A Word Counting Program. Program Blocks. 2nd Edition. Control Sections and Programming Linking. Algorithm and Data Structures for a Linking Loader.3).2 and 2.5. Program Relocation. Macro Processor Algorithm and Data Structures. Machine-Dependent Loader Features – Relocation. (Chapters 1. Parsing a Command Line. User-Interface Criteria Macro Processor 8 Hours Basic Macro Processor Functions .The Definition Section.5. SIC Programming Examples.4. Loader Options. Assemblers 12 Hours Basic Assembler Function . Editors And Debugging Systems 6 Hours Text Editors . Loader Design Options – Linkage Editor. 1997. A YACC Parser . SPD.A. Recognizing Words With LEX. System Software and Machine Architecture. ANSI C Macro Processor.SIC Machine Architecture. General-Purpose Macro Processors. A YACC Parser.Dhamdhere: System Programming and Operating Systems.Regular Expression. Multi-Pass Assembler.3). 3 (except 3. Tata McGraw Hill. Using LEX . User Interface.M. O'Reilly.5. 1999. Arithmetic Expressions and Ambiguity.Overview of Editing Process. Using YACC – Grammars. Recursive Rules.1 to 1.III SEMESTER
Systems Software Hours/Week : 04 I.R. 4 (except 4.5. Simplified Instructional Computer (SIC) . Machine Dependent Assembler Features .Concatenation of Macro Parameters. Machine Independent Assembler Features – Literals. 2 (except 2. The Rules Section. D. Implementation Examples . Assembler Algorithm and Data Structures.Debugging Functions and Capabilities. Addison-Wesley.3)) 2. John. Implementation Examples . Program Linking. Loaders and Linkers 8 Hours Basic Loader Functions . LEX and Hand. Compiling and Running a Simple Parser. Tony Mason and Doug Brown: Lex and Yacc. Lex and Yacc 12 Hours Lex and Yacc . Keyword Macro Parameters.
Text Books: 1. SIC/XE Machine Architecture. 3rd Edition.Recursive Macro Expansion. Machine-Independent Loader Features .Automatic Library Search. Symbol-Definition Statements. Macro Processor Design Options . Parser-Lexer Communication. Implementation Examples .L. Symbol Values and Actions. Relationship With Other Parts Of The System.Macro Definitions and Expansion. The Parts of Speech Lexer. Grammars. Generation of Unique Labels.Beck: System Software. Editor Structure. Variables and Typed Tokens.
24x7varun@gmail. Dynamic Linkage.The Simplest Lex Program.MS-DOS Linker.One-Pass Assembler.2 and 3.com
. Examples of Regular Expressions. Assembler Design Operations . 1998. Leland. (Chapters 1.Written Lexers. What YACC Cannot Parse. Conditional Macro Expansion. Macro Processing Within Language Translators.
Electronic mail. Nader F.
email@example.com to 9.Computer Networks Hours/Week : 04 I. (Chapters 1.2. 5. Network Architecture. Domain Name System.
Text Books: 1.3. 2004. Wireless (802. Behrouz A.17). Packet Switching Switching and forwarding. 2007. 802. (802.1.A. 3. Hardware building blocks. Cell Phone Technologies). Reliable transmission. 18.6. Global Internet End –to-End Protocols. Alberto Leon-Garcia and Indra Widjaja: Communication Networks -Fundamental Concepts and Key architectures. Encoding. Reliable byte stream (TCP). Pearson Education. 2007. 3. Routing.16. 6. Peterson and Bruce S. 4.11. Performance Direct Link Networks 12 Hours Physically connecting hosts. Forouzan: Data Communications and Networking. 2nd Edition Tata McGraw-Hill. 2006. 4th Edition. David: Computer Networks – A Systems Approach. Resource Allocation Issues Simple demultiplexer (UDP). 3. Marks : 50 Exam Marks: 100
Subject Code: 10MCA32 Total Hours : 52 Exam Hours: 03
Foundation 8 Hours Building a Network. 802. VoIP signaling protocols. 18. Implementing Network software. 4. 5. Overview of VoIP telephony. Elsevier. Pearson Education. Bridges and LAN Switches Internetworking Simple internetworking (IP). 4. Ring.1.3). 8th Edition. FDDI. 2.15.2. Framing.1.2) References: 188.8.131.52.1) 2. Larry L. William Stallings: Data and Computer Communication. Requirements. Remote Login protocols. 802. File transfer and FTP. World Wide Web and HTTP. Applications.2.com
. 2. Mir: Computer and Communication Networks. Error detection. (Chapters 9. Tata McGraw-Hill. Ethernet (802. 4th Edition. 2010. Issues in resource allocation 7 Hours
Applications 6 Hours Application-Layer overview.
and Arrays: Java Is a Strongly Typed Language. A Closer Look at Literals. System. Input/Output: Exploring java. The LinkedList Class. URL. Exception Handling: Exception-Handling Fundamentals. Dynamic Method Dispatch. When Constructors Are Called. The List Interface. TCP/IP Client Sockets. Object. Autoboxing: 6 Hours Enumeration. URLConnection. Multiple catch Clauses. The Primitive Types. Type Conversion and casting. ThreadGroup. The TreeSet Class. The General Form of a Generic Class. finally. Using Blocks of Code Lexical Issues. Arrays. Automatic Type promotion in Expression. The Java Class Libraries. Using Parentheses. Overloading Constructors. Using Command-Line Arguments. Introducing Classes: 7 Hours Class Fundamentals. A Second Short Program. Runnable. The ArrayList Class. Using Multithreading. The ? Operator. Arrays Revisited. Suspending. Declaring Objects. The Collection Classes. Synchronization. Searching Strings. Varargs Inheritance: 7 Hours Inheritance Basics. String Length. Stream Benefits.lang: 7 Hours Primitive Type Wrappers. The Bitwise Operators. Uncaught Exceptions Using try and catch. Variables. Introducing Access Control. Operator Precedence. Nested try Statements.
. RMI. Understanding static. The Networking Classes and Interfaces InetAddress. The Assignment Operator. The Object Class. The HashSet. Type Wrappers. Exploring the String Class. Using Objects as Parameters. File. Creating Your Own Exception Subclasses. Using isAlive( ) and join( ). Returning Objects. Special String Operations. throw. Class. throws. Changing the Case of Characters Within a String. The Collection Interfaces. Garbage. Using super. Using Exceptions. A few words about Strings. The Console Class. The Queue Interface. A Simple Generics Example. The Character Streams. Using final with Inheritance. Using super Creating a Multilevel Hierarchy. Resuming. TCP/IP Server Sockets.Programming with Java Hours/Week: 4 IA Marks: 50 Exam Marks: 100
Subject Code: 10MCA33 Total Hours: 52 Exam Hours: 03
An Overview of Java 4 Hours Object-Oriented Programming. Jump Statements. The Stream Classes. Autoboxing. and Stopping Threads. Thread. Multithreaded Programming: 6 Hours The Java Thread Model. A Closer Look at Argument Passing. Data Conversion Using valueOf( ). Interthread Communication. Creating Multiple Threads. The Main Thread. Data Types. Exploring java. The this Keyword. Relational Operators Boolean Logical Operators. Thread Priorities. Cookies. Chained Exceptions. Assigning Object Reference Variables Introducing Methods. A Closer Look at Methods and Classes: Overloading Methods. Generics: What are Generics?. Creating a Thread. Class Loader. Method Overriding. Operators: Arithmetic Operators. Serialization. The finalize( ) Method A Stack Class. The Collections Framework: Collections Overview. Enumeration. Interfaces. Exception Types. Access Protection. String Builder. The Closable and Flushable Interfaces. Control Statements: Java’s Selection. Character Extraction. Using Stream I/O.io: The Java I/O Classes and Interfaces. The Byte Streams. Iteration Statements. Additional String Methods. Constructors. Networking: 5 Hours Networking Basics. Packages and Interfaces: Packages. HTTP URL Connection. Using Abstract Classes. Variables. String Comparison. A First Simple Program. Introducing final. Recursion. String Handling: The String Constructors. An Access Example Importing Packages. Math. Throwable. Inet4Address and Inet6Address. A Generics Class with two Type Parameters. StringBuffer. Introducing Nested and Inner Classes. Modifying a String. Java’s Built-in Exceptions. The URI Class.
24x7varun@gmail. 10.Y. Adapter Classes. Event Listener Interfaces. 6th Edition. Gary Cornell: Core Java 2 . 21. 19. Tata McGraw Hill. 12. 20. 3. 2008. 2. 30) Reference Books: 1. 14. 17. Swing: Introducing Swing. 8th Edition. James P Cohoon. Exploring Swing. 7th Edition. 5. 27. Sources of Events. 13. 4.The Applet Class: 7 Hours The Applet Class. The Delegation Event Model. Gary Cornell: Core Java 2 . 7. Pearson Education. 15. 8. Cay S Horstmann. Daniel Liang: Introduction to JAVA Programming. Event Handling: Two Event Handling Mechanisms.Volume 1. Using the Delegation Event Model. Pearson Education. 2007.0. 9. 22. 11. 2005. 2006. Inner Classes.com
. Pearson Education. 29.Volume 2. Tata McGraw Hill. 3. Event Classes. Text Books: 1. Jack W Davidson : Programming in JAVA 5. 4. 2007. Herbert Schildt: The Complete Reference JAVA. 6. 7th Edition. Cay S Horstmann. (Chapters: 2.
Specifying basic constraints in SQL. SQL 16 Hours SQL Data Definition and Data Types. 18) Reference Books: 1. Database programming issues and techniques. Additional Relational Operations. Marks : 50 Exam Marks: 100
Subject Code: 10MCA34 Total Hours : 52 Exam Hours: 03
Introduction 7 Hours Introduction. Boyce-Codd Normal Form Transaction Management 6 Hours The ACID Properties.2. A. More complex SQL Queries. Transaction support in SQL. 2. Refining the ER Design. 2. General Definitions of Second and Third Normal Forms. 8 th Edition.2 except SQLJ. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems. 7. 17. Weak Entity Types. (Chapters 16. 2007. Binary Relational Operations : JOIN and DIVISION. 6. Concurrent Execution of Transactions. Examples of Queries in Relational Algebra. Attributes and Keys.
Text Books: 1. Functional Dependencies.1. Centralized and client-server architectures. Insert. Performance of locking. Mc-GrawHill.com
. Normal Forms Based on Primary Keys. 10) 2. Transactions and Schedules. Classification of Database Management systems. Update Operations. 5. Relational Model and Relational Algebra 8 Hours Relational Model Concepts.A. Swamynatham: A Introduction to Database Systems. 9. 3 except 3. Kannan. Relationship Sets. 5th Edition. 2003. Date. S. Workers behind the scene.J.
firstname.lastname@example.org. 8. Pearson education. Schema change statements in SQL. Characteristics of Database approach.1 to 6. Entity Types. Unary Relational Operations: SELECT and PROJECT. Relational Model Constraints and Relational Database Schemas. Elmasri and Navathe: Fundamentals of Database Systems. Introduction to crash recovery. Three-schema architecture and data independence. Relationship types. Database stored procedures and SQL / PSM.1. Relational Database Design Using ER. An Example Database Application. schemas and instances. 3rd Edition. 9. Data models. ER Diagrams. Relationship types of degree higher than two. Relational Algebra Operations from Set Theory. Silberschatz. 17. Delete and Update statements in SQL. C. Additional features of SQL. 5th Edition. Transactions and dealing with constraint violations. McGraw-Hill. Dynamic SQL. 2006. The database system environment. A brief history of database applications. when not to use a DBMS.Based Concurrency Control. Basic queries in SQL. Lock. Entity-Relationship Model 7 Hours Using High-Level Conceptual Data Models for Database Design. An example. 2006.5.1. Database Design 8 Hours Informal Design Guidelines for Relation Schemas.Database Management Systems Hours/Week : 04 I. Advantages of using DBMS approach. Views (Virtual Tables) in SQL.4.to-Relational Mapping. Roles and Structural Constraints. (Chapters 1. Specifying constraints as Assertion and Trigger. Naming Conventions and Design Issues. Actors on the screen. Pearson Education. 9. Database languages and interfaces. Korth and Sudharshan: Data base System Concepts. Entity Sets. Embedded SQL.
2nd Edition. User . Methods for handling deadlocks. File sharing. Operating System operations. Scheduling criteria. MultiThreaded Programming: Overview.com
. Disk structure. Multithreading models. Operating System generation. Virtual Memory Management: Background. Bhatt: Operating Systems.6. Disk attachment. File system implementation. Disk scheduling. Structure of page table.5. Computing environments. 6 Hours
Memory Management 7 Hours Memory Management Strategies: Background.Protection: Goals of protection.7. 2. Allocation methods. 1990.6. Synchronization hardware. Computer System architecture.6. 4.1 to 3.1 to 21.4. Process management. Pearson Education. Operating System structure. Disk management. System calls. Harvey M Deital: Operating systems. PHI. Process Management 7 Hours Process concept. Revocation of access rights.M Dhamdhere: Operating systems . (Chapters: 1. 17. Tata McGraw.1 to 8. System programs. Deadlock prevention.P.1 to 12. Semaphores. Directory structure. Inter-process communication. Deadlock detection and recovery from deadlock. Text Books: 1. Deadlock avoidance. Operations on processes. File systems.A concept based Approach.8. 11. Page replacement. 2006. Protection. Distributed system. Implementing File System: File system structure. 3. 8. 7. Design principles. Virtual machines.Operating System interface.1 to 17. Thrashing. Free space management Secondary Storage Structures. Types of system calls. Implementation of access matrix. Peterson’s solution. Process Synchronization 7 Hours Synchronization: The Critical section problem. Peter Baer Galvin. Implementation of File System 7 Hours File System: File concept.Hill. Thread Libraries.4 . Deadlocks Deadlocks: System model.
24x7varun@gmail. 2006. 3.5. Protection and security. P. Access methods. Capability-Based systems.1 to 11.Operating Systems Hours/Week : 04 I. Demand paging. Operating System design and implementation.1 to 4. 2nd Edition. 10. Wiley India. Threading issues. Memory management. Case Study: The Linux Operating System 6 Hours Linux history. Kernel modules. Protection 6 Hours Mass storage structures. Marks : 50 Exam Marks: 100
Subject Code: 10MCA35 Total Hours : 52 Exam Hours: 03
Introduction to Operating Systems. System boot. Contiguous memory allocation. System structures 6 Hours What operating systems do. 12.1 to 9. Scheduling algorithms. Principles of protection. Thread scheduling. 21. Swapping. D. Memory management. 3rd Edition. Paging. Greg Gagne: Operating System Principles. 7th edition. Abraham Silberschatz. Access control.Operating System Services. Segmentation. File System. Inter-process communication. Process scheduling. Operating System structure.1 to 6. 2. Storage management. Allocation of frames. Access matrix.1 to 5. Special-purpose systems. Process Scheduling: Basic concepts. Deadlock characterization. Computer System organization. Classical problems of synchronization. 2002.9) Reference Books: 1. 2. 5.A. Input and output. Swap space management. Multiple-Processor scheduling. 9. File system mounting. 6.C. Process management. Monitors. Domain of protection. Copy-on-write. Directory implementation. Scheduling.
5. Program to recognize a valid arithmetic expression that uses operators +. Program to count the number of characters. Positive and negative fractions 4. Marks: 50 Exam Marks : 50
PART. * and /.A. Program to recognize nested IF control statements and display the number of levels of nesting. words. Positive and negative integers b.Program to count the numbers of comment lines in a given C program.B Execute of the following programs using YACC: 1. Also eliminate them and copy that program into separate file. 5. Program to count the number of ‘scanf’ and ‘printf’ statements in a C program. -. -. Print them separately. 2. Program to count the number of vowels and consonants in a given string. n>=10).
24x7varun@gmail. which starts with a letter.Systems Programming Laboratory Subject Code: 10MCA36 Total Hours : 42 Exam Hours : 03 Hours/Week : 03 I. a combination of one LEX and one YACC problem has to be asked based on lots. 2. Replace them with readf’ and ‘writef’ statements respectively. 3. 4.Program to recognize and count the number of identifiers in a given input file. ‘ab’ and ‘a’ using the grammar: (an bn . n>=0) 7.com
. Program to recognize a valid arithmetic expression and identify the identifiers and operators present. PART. followed by any number of letters or digits. ‘abbb’. Program to recognize the grammar (an b. spaces and lines in a given input file. 3. 7. Program to count number of a. Program to test the validity of a simple expression involving operators +. 6. * and /. 6. Program to recognize strings ‘aaab’.A Execute of the following programs using LEX: 1.
Instructions: In the examination. Program to recognize a valid variable. Both will have equal weightages. Program to evaluate an arithmetic expression involving operators +. * and /. -.
a. A Class that uses both the above Stacks through Interface reference and does the Stack operations that demonstrates the runtime binding. Write a JAVA program which has i. A Class called LessBalanceException which returns the statement that says withdraw amount (___Rs) is not valid. b. Write a JAVA Program to demonstrate Constructor Overloading and Method overloading. iii. 7. a withdraw() method to withdraw amount and also throws LessBalanceException if an account holder tries to withdraw money which makes the balance become less than 500Rs. A Class that implements the Stack Interface and creates a Dynamic length Stack. 11. ii.com
. Write JAVA Applet programs which handles MouseEvent 12. 2 classes which initializes a String in its constructor ii. both account deposit money and one account tries to withdraw more money which generates a LessBalanceException take appropriate action for the same. A Class which creates 2 accounts. Write a JAVA Program which writes a object to a file (use transient variable also). Write a JAVA program using Synchronized Threads. 4. Write a JAVA Program to implement Inner class and demonstrate its Access Protections. which demonstrates Producer Consumer concept. Write JAVA Applet programs which handles KeyBoardEvent 13.
24x7varun@gmail. 10. Write a Swing Application which uses i. iii. Write a JAVA Program which uses FileInputStream / FileOutPutStream Classes. Write a JAVA Program to demonstrate Exception Handling (Using Nested try catch and finally). b. a. Write a JAVA program which has i. A Class that implements the Stack Interface and creates a fixed length Stack. 6.A Marks: 50 Exam Hours: 3
1. 2. A Generic class with 2 type Parameters iii. Write a JAVA Program to demonstrate Inheritance. Write a JAVA program which has i. 9. Each Tab should use JPanel. which includes any one component given below in each Panel iii. A Interface class for Stack Operations ii. Write JAVA programs which demonstrates utilities of LinkedList Class 8. iv. JTabbed Pane ii. ComboBox / List / Tree / Radiobutton Note: All the above Components should Listen to any one of their respective events and print appropriate message. Write a JAVA program which uses Datagram Socket for Client Server Communication.Java Programming Laboratory Subject Code: 10MCA37 Total Hours: 42 Exam Marks: 50 Hours/Week: 3 I. a deposit() method to deposit amount. 3. 5. A Class called Account that creates account with 500Rs minimum balance. Write a JAVA program which implements RMI. 14. Create a Generic Class reference for t he above 2 Class and try to print the message inside the constructor (Use to string method).
level: string. fname: string. name: string.
24x7varun@gmail.DBMS Laboratory Subject Code: 10MCA38 Total Hours : 42 Exam Hours: 03 Hours/Week : 03 I. Find the names of faculty members for whom the combined enrollment of the courses that they teach is less than five.Find the names of aircraft such that all pilots certified to operate them have salaries more than Rs. Generate suitable reports. STUDENT (regno: string. Enrolled has one record per student-class pair such that the student is enrolled in the class. i. bdate:date) COURSE (course #:int. sem:int. Find the names of all students who are enrolled in two classes that meet at the same time. book-ISBN:int) TEXT (book-ISBN:int. arrives: time. and only pilots are certified to fly. v. aid: integer) Employees (eid: integer. meets at: string. vi.A.find the name of the aircraft and the average salary of all pilots certified for this aircraft. ii. Every pilot is certified for some aircraft. cname:string. iv. price: real) Aircraft (aid: integer. find the eid and the maximum cruisingrange of the aircraft for which she or he is certified.For all aircraft with cruisingrange over 1000 Kms.For each pilot who is certified for more than three aircrafts. Find the names of faculty members who teach in every room in which some class is taught. The following relations keep track of airline flight information: Flights (no: integer. cruisingrange: integer) Certified (eid: integer. publisher:string. for example. v. . ii. room: string. to: string. Level is a two character code with 4 different values (example: Junior: JR etc) Write the following queries in SQL. i. 3.Find the names of pilots whose salary is less than the price of the cheapest route from Bengaluru to Frankfurt.80. major: string. age: integer) Class (name: string. sname: string. iii. No duplicates should be printed in any of the answers. major: string. ename: string. author:string) i. v. 000. Book-ISBN. Demonstrate how you add a new text book to the database and make this book be adopted by some department. distance: integer. Harshith ii. sem:int.com
. Enter at least five tuples for each relation.Find the aids of all aircraft that can be used on routes from Bengaluru to New Delhi. cname: string) Faculty (fid: integer. List any department that has all its adopted books published by a specific publisher. d: integer) Enrolled (snum: integer. marks:int) BOOK _ ADOPTION (course# :int. Find the names of all Juniors (level = JR) who are enrolled in a class taught by Prof. iii. vi. Create the above tables by properly specifying the primary keys and the foreign keys. Write each of the following queries in SQL. deptid: integer) The meaning of these relations is straightforward. dept:string) ENROLL ( regno:string. iv. aname: string. salary: integer) Note that the Employees relation describes pilots and other kinds of employees as well.Find the names of pilots certified for some Boeing aircraft. from: string. course#:int. vii. Consider the following relations: Student (snum: integer. 2. Book-title) in the alphabetical order for courses offered by the ‘CS’ department that use more than two books. iii. Departs: time. book-title:string. Marks : 50 Exam Marks: 50
1. Consider the following database of student enrollment in courses & books adopted for each course. Produce a list of text books (include Course #. Create suitable front end for querying and displaying the results. Find the names of all classes that either meet in room R128 or have five or more Students enrolled. iv.
quantity:int) i. city:string. Find all the customers who have an account at all the branches located in a specific city. book-id:int. AUTHOR (author-id:int. Demonstrate how you delete all account tuples at every branch located in a specific city. Consider the following database for a banking enterprise BRANCH(branch-name:string. Demonstrate how you increase the price of books published by a specific publisher by 10%. vii. price:int) CATEGORY (category-id:int. country:string) PUBLISHER (publisher-id:int. Relevant queries other than the ones listed along with the exercises may also be asked in the examination. iii. 4. city:string. Enter at least five tuples for each relation.com
. year:int. Create the above tables by properly specifying the primary keys and the foreign keys. 2. description:string) ORDER-DETAILS (order-no:int. country:string) CATALOG (book-id:int. Generate suitable reports. balance:real) DEPOSITOR(customer-name:string. publisher-id:int. iv. Enter at least five tuples for each relation iii. 5. Instructions: 1. Find all the customers who have at least two accounts at the Main branch. 6. assets:real) ACCOUNT(accno:int. branch-city:string. Front end may be created using either VB or VAJ or any other similar tool. ii. name:string. Find the author of the book which has maximum sales. 3. vi. branch-name:string.
24x7varun@gmail. Create the above tables by properly specifying the primary keys and the foreign keys ii. Create suitable front end for querying and displaying the results. amount:real) BORROWER(customer-name:string. accno:int) CUSTOMER(customer-name:string. customer-street:string. 5. name:string. Create suitable front end for querying and displaying the results. Generate suitable reports. The following tables are maintained by a book dealer. category-id:int. Suitable tuples have to be entered so that queries are executed correctly. branch-name:string. v. author-id:int. The student need not create the front end in the examination. vii.Questions must be asked based on lots.4. The exercises are to be solved in an RDBMS environment like Oracle or DB2. iv. Give the details of the authors who have 2 or more books in the catalog and the price of the books is greater than the average price of the books in the catalog and the year of publication is after 2000. vi. customer-city:string) LOAN(loan-number:int. v. The results of the queries may be displayed directly. loan-number:int) i. title:string.