III SEMESTER Systems Software Subject Code: 10MCA31 I.A.

Marks : 50 Hours/Week : 04 03 Total Hours : 52 Marks: 100




Machine Architecture 6 Hours Introduction, System Software and Machine Architecture, Simplified Instructional Computer (SIC) - SIC Machine Architecture, SIC/XE Machine Architecture, SIC Programming Examples. Assemblers 12 Hours Basic Assembler Function - A Simple SIC Assembler, Assembler Algorithm and Data Structures, Machine Dependent Assembler Features - Instruction Formats & Addressing Modes, Program Relocation. Machine Independent Assembler Features – Literals, Symbol-Definition Statements, Expression, Program Blocks, Control Sections and Programming Linking, Assembler Design Operations - One-Pass Assembler, Multi-Pass Assembler, Implementation Examples - MASM Assembler. Loaders and Linkers 8 Hours Basic Loader Functions - Design of an Absolute Loader, A Simple Bootstrap Loader, Machine-Dependent Loader Features – Relocation, Program Linking, Algorithm and Data Structures for a Linking Loader; Machine-Independent Loader Features - Automatic Library Search, Loader Options, Loader Design Options - Linkage Editor, Dynamic Linkage, Bootstrap Loaders, Implementation Examples - MS-DOS Linker.

5.Levine. Compiling and Running a Simple Parser. Recursive Rules.Recursive Macro Expansion.Overview of Editing Process. Examples of Regular Expressions. Grammars. Shift/Reduce Parsing. Leland. Macro Processor Algorithm and Data Structures. Using YACC – Grammars. Addison-Wesley. The LEXER.Editors And Debugging Systems 6 Hours Text Editors .Regular Expression. Variables and Typed Tokens. Symbol Tables. Machine-Independent Macro Processor Features . Text Books: rd 1. 3 Edition.2 and 3. 2 (except 2. LEX and Hand.MASM Macro Processor. 1997.Concatenation of Macro Parameters. Editor Structure. General-Purpose Macro Processors. 3 (except 3.4. User Interface. Interactive Debugging Systems .3). Macro Processing Within Language Translators.5. Macro Processor Design Options . The Rules Section. Lex and Yacc 12 Hours Lex and Yacc . Using LEX .Debugging Functions and Capabilities. A Word Counting Program. . SPD.3.5. Parser-Lexer Communication. 4 (except 4.Macro Definitions and Expansion. Keyword Macro Parameters. ANSI C Macro Processor. (Chapters 1. Implementation Examples . Tony Mason and Doug Brown: Lex and Yacc. Generation of Unique Labels. Arithmetic Expressions and Ambiguity. 1998. What YACC Cannot Parse. Running LEX and YACC.L. Parsing a Command Line. The Parts of Speech Lexer. Conditional Macro Expansion.R. A YACC Parser .3).The Simplest Lex Program.5. Symbol Values and Actions. The Rules Section. UserInterface Criteria Macro Processor 8 Hours Basic Macro Processor Functions . O'Reilly.Written Lexers. Recognizing Words With LEX. John.Beck: System Software.2 and 2.1 to 1. Relationship With Other Parts Of The System.The Definition Section.3)) 2. A YACC Parser.

Performance Direct Link Networks 12 Hours Physically connecting hosts. Reliable transmission. 2 Edition. Hardware building blocks. 2 (Page 2-42). Bridges and LAN Switches Internetworking 12 Hours Simple internetworking (IP).Dhamdhere: System Programming and nd Systems. Encoding.11. FDDI. 802. Global Internet Switching . Tata McGraw . Network Architecture. Packet 7 Hours Switching and forwarding. (802.M. Wireless (802.5. Applications.3). Ring. Error detection. 1999. Operating Computer Networks Subject Code: 10MCA32 Marks : 50 Hours/Week : 04 Total Hours : 52 100 I.Hill. 3 (Page 51-65)) Reference Books: 1. Cell Phone Technologies). Requirements.A. 802.17).(Chapters 1. Ethernet (802. Routing. Framing. Implementing Network software.1. D. Exam Hours: 03 Exam Marks: Foundation 8 Hours Building a Network.16. 802.15.

2006. Elsevier. Programming with Java Subject Code: 10MCA33 50 03 Hours/Week: 4 IA Marks: Exam Hours: Exam Total Hours: 52 Marks: 100 An Overview of Java 4 Hours Object-Oriented Programming.1 to 9. 3. Overview of VoIP telephony. 4. World Wide Web and HTTP. . (Chapters 9. David: Computer Networks – A Systems Approach. Remote Login protocols. Text Books: 1. th 2. Forouzan: Data Communications and Networking. 6. 4. 5. 4.6. Nader F.2. Larry L.1.1. VoIP signaling protocols.1.2. Resource Allocation Issues 7 Hours Simple demultiplexer (UDP). 18. Behrouz A. 5. Alberto Leon-Garcia and Indra Widjaja: Communication Networks -Fundamental Concepts and Key architectures. Issues in resource allocation Applications 6 Hours Application-Layer overview.2) References: th 1. Mir: Computer and Communication Networks. Domain Name System. A Second Short Program. Peterson and Bruce S. Electronic mail.1.2. Pearson Education. 2. 2007. File transfer and FTP.3. William Stallings: Data and Computer Communication. Tata McGraw-Hill. The Java Class Libraries. 3.1) 2. A First Simple Program.End –to-End Protocols. 2007. 8 Edition. 3. Using Blocks of Code Lexical Issues. Reliable byte stream (TCP). 4 Edition. (Chapters 1. Pearson Education. 2010. 2004. 4th Edition. 18. 2nd Edition Tata McGraw-Hill.

Resuming. Interthread Communication. Introducing Nested and Inner Classes. The Main Thread. . Assigning Object Reference Variables Introducing Methods. Recursion. The Primitive Types. Using Multithreading. Creating a Thread. Using final with Inheritance. A few words about Strings. The Object Class. A Closer Look at Argument Passing. Exploring the String Class. Exception Types. Using Exceptions. Relational Operators Boolean Logical Operators. Overloading Constructors. Garbage. Jump Statements. Returning Objects. Declaring Objects. A Closer Look at Literals. Using isAlive( ) and join( ). Variables. Java’s Built-in Exceptions. finally. Access Protection. Arrays Revisited. Using Command-Line Arguments. Multithreaded Programming: 6 Hours The Java Thread Model. Varargs Inheritance: 7 Hours Inheritance Basics. A Closer Look at Methods and Classes: Overloading Methods. Interfaces. and Arrays: Java Is a Strongly Typed Language. Type Conversion and casting. Using Abstract Classes. Using Objects as Parameters. Packages and Interfaces: Packages. Introducing Access Control. and Stopping Threads. Nested try Statements. Constructors. Introducing final. Exception Handling: Exception-Handling Fundamentals. The ? Operator. The Assignment Operator. throws. When Constructors Are Called. Using super Creating a Multilevel Hierarchy. Automatic Type promotion in Expression. The Bitwise Operators. Introducing Classes: 7 Hours Class Fundamentals.Data Types. Control Statements: Java’s Selection. Using Parentheses. Chained Exceptions. Using super. Variables. Uncaught Exceptions Using try and catch. Synchronization. Suspending. Thread Priorities. Dynamic Method Dispatch. Creating Your Own Exception Subclasses. The finalize( ) Method A Stack Class. throw. Creating Multiple Threads. Operator Precedence. Understanding static. Iteration Statements. An Access Example Importing Packages. Arrays. Multiple catch Clauses. Operators: Arithmetic Operators. Method Overriding. The this Keyword.

HTTP URL Connection. The Console Class. Autoboxing. StringBuffer. The General Form of a Generic Class.Input/Output: Exploring java. Data Conversion Using valueOf( ). String Comparison. TCP/IP Server Sockets. The Delegation Event Model. A Simple Generics Example. Serialization. Object. Runnable. The HashSet. Text Books: . Stream Benefits. Event Handling: Two Event Handling Mechanisms. Class Loader. The Byte Streams. Using the Delegation Event Model. Throwable. The List Interface. Additional String Methods. Changing the Case of Characters Within a String. Event Listener Interfaces. Type Wrappers. String Length. Enumeration. String Handling: The String Constructors. Swing: Introducing Swing. Exploring java. Searching Strings. The Applet Class: 7 Hours The Applet Class. Inet4Address and Inet6Address. Thread. Event Classes. The Collections Framework: Collections Overview. The Character Streams. The ArrayList Class. Special String Operations. The Collection Interfaces. Adapter Classes. Inner Classes. Class. URLConnection. The URI Class. Modifying a String.lang: 7 Hours Primitive Type Wrappers. The Queue Interface. String Builder. Networking: 5 Hours Networking Basics. A Generics Class with two Type Parameters. Math. Using Stream I/O. File. Generics: What are Generics?. URL. System. Autoboxing: 6 Hours Enumeration. Exploring Swing. TCP/IP Client Sockets. The LinkedList Class. The TreeSet Class. The Collection Classes. RMI. Sources of Events. ThreadGroup. The Networking Classes and Interfaces InetAddress. Cookies.io: The Java I/O Classes and Interfaces. The Stream Classes. Character Extraction. The Closable and Flushable Interfaces.

19. 2005. Exam Hours: Exam Marks: Introduction 7 Hours Introduction. schemas and instances. 13. 14.1. An Example Database Application. Relationship Sets. Jack W Davidson : Programming in JAVA 5. A brief history of database applications.Volume 1. Entity-Relationship Model 7 Hours Using High-Level Conceptual Data Models for Database Design. 2007. Entity Types. Actors on the screen. Refining the ER Design. Y. 12. Roles and Structural Constraints. Three-schema architecture and data independence. 2006. 4. 30) Reference Books: 1. Classification of Database Management systems. 15.Volume 2. 11. Characteristics of Database approach. Herbert Schildt: The Complete Reference JAVA. The database system environment. 2008. 7th Edition. Daniel Liang: Introduction to JAVA Programming. 29. Advantages of using DBMS approach. Pearson Education. . 7. 2. ER Diagrams. 8 Edition. Centralized and clientserver architectures. Database languages and interfaces. Pearson Education. 17. 6th Edition. 7th Edition. James P Cohoon. Workers behind the scene.0. 21. Cay S Horstmann. Entity Sets. Data models. 3. Tata McGraw Hill. 9. Database Management Systems Subject Code: 10MCA34 Marks : 50 Hours/Week : 04 03 Total Hours : 52 100 I. Tata McGraw Hill. 6. when not to use a DBMS. 2007. Gary Cornell: Core Java 2 . Pearson Education. An example. Attributes and Keys. (Chapters: 2. 27. Cay S Horstmann. 5. Relationship types. th 3.A. 22. Weak Entity Types. 10. 8. Gary Cornell: Core Java 2 . 20. 4.

Normal Forms Based on Primary Keys. Update Operations. General Definitions of Second and Third Normal Forms. 5th Edition. Schema change statements in SQL.5. Additional Relational Operations.4. Transactions and dealing with constraint violations. Introduction to crash recovery. More complex SQL Queries.1 to 6. 3 except 3.1. Additional features of SQL. Lock.8. Relationship types of degree higher than two. Performance of locking. (Chapters 1. 9. Views (Virtual Tables) in SQL. Relational Algebra Operations from Set Theory. Binary Relational Operations : JOIN and DIVISION. Unary Relational Operations: SELECT and PROJECT. Specifying constraints as Assertion and Trigger. Embedded SQL. Concurrent Execution of Transactions. 7. Basic queries in SQL. Database programming issues and techniques. 8. Relational Model Constraints and Relational Database Schemas. Functional Dependencies.Based Concurrency Control. Transaction support in SQL. Boyce-Codd Normal Form Transaction Management 6 Hours The ACID Properties. Dynamic SQL.Naming Conventions and Design Issues. Text Books: 1. 10) . 2007. 5. 2. Relational Database Design Using ER. Examples of Queries in Relational Algebra. Relational Model and Relational Algebra 8 Hours Relational Model Concepts. Transactions and Schedules. Pearson Education. 9. SQL 16 Hours SQL Data Definition and Data Types. Insert. Delete and Update statements in SQL.to-Relational Mapping. Elmasri and Navathe: Fundamentals of Database Systems. Database stored procedures and SQL / PSM. 9. Specifying basic constraints in SQL. Database Design 8 Hours Informal Design Guidelines for Relation Schemas.2 except SQLJ. 6.1.

18) 2.Operating System Services. Multi-Threaded Programming: Overview. A. Interprocess communication.Raghu Ramakrishnan and Johannes Gehrke: Management Systems. Scheduling criteria. Computer System architecture.Operating System interface. Process Management 7 Hours Process concept. (Chapters 16. Operations on processes. Distributed system. Process Synchronization 7 Hours . User . 5 Edition. System calls.A. McGraw-Hill.J. Storage management. 8th Edition. Mc-GrawHill. Exam Exam Introduction to Operating Systems. System structures 6 Hours What operating systems do.1. Korth and Sudharshan: Data base System th Concepts. Process scheduling. Memory management. Scheduling algorithms. 3rd Edition. Thread scheduling. Computer System organization. Silberschatz. Operating System structure. Operating Systems Subject Code: 10MCA35 Marks : 50 Hours/Week : 04 Hours: 03 Total Hours : 52 Marks: 100 I. Operating System design and implementation. Swamynatham: A Introduction to Database Systems. Pearson education. Thread Libraries. Multithreading models. System programs. 2006. Specialpurpose systems. Virtual machines. Database Reference Books: 1. 2006. Threading issues. Operating System operations. 17. C. Protection and security. Kannan. Operating System structure. System boot. Process management. S. Computing environments.2. Types of system calls. 17. 2. Process Scheduling: Basic concepts. 2003. Date. Operating System generation. Multiple-Processor scheduling.

Access methods. Principles of protection. Memory Management 7 Hours Memory Management Strategies: Background. Access control. Process management. File System.Protection: Goals of protection. Copy-onwrite. Contiguous memory allocation. Semaphores. Protection. Revocation of access rights. Directory implementation. Text Books: . Domain of protection. Inter-process communication. Memory management.Synchronization: The Critical section problem. Case Study: The Linux Operating System 6 Hours Linux history. Disk scheduling. Deadlocks 6 Hours Deadlocks: System model. Swap space management. File systems. Access matrix. Directory structure. Design principles. Implementation of access matrix. Free space management Secondary Storage Structures. Deadlock avoidance. Allocation methods. Page replacement. Peterson’s solution. Deadlock prevention. Disk management. Paging. Thrashing. Deadlock characterization. Protection 6 Hours Mass storage structures. Synchronization hardware. Input and output. File system mounting. Scheduling. Demand paging. Allocation of frames. Segmentation. Classical problems of synchronization. Implementing File System: File system structure. Monitors. Virtual Memory Management: Background. Swapping. Implementation of File System 7 Hours File System: File concept. Disk structure. Deadlock detection and recovery from deadlock. Methods for handling deadlocks. Capability-Based systems. File sharing. File system implementation. Disk attachment. Kernel modules. Structure of page table.

5. 2.A. Bhatt: Operating Systems. D. 2006. 2.1 to 17. Program to count the number of characters. Peter Baer Galvin. Marks: Exam Hours : Exam Marks : Program to count the number of vowels and consonants in a given string.1 to 11. Program to count number of a. 11. Greg Gagne: Operating System Principles. 5.A concept based Approach. 4.7.Abraham Silberschatz. Reference Books: 1. 17. 2002.1 to 6. 6. PHI. Positive and negative fractions Program to count the numbers of comment lines in a given C program.4.5.8. (Chapters: 1.M Dhamdhere: Operating systems . Positive and negative integers b.6. 7th edition. 4. rd 3. 2 Edition. words. 9.9) 1.6.1 to 9. 7.1 to 5. Tata McGraw.A Execute of the following programs using LEX: 1. 2nd Edition.1 to 3. Pearson Education. spaces and lines in a given input file.1 to 8. 2006. 3.6. 3 Edition.C. 2. 21. 10. nd 2.P. 1990.1 to 21. 8. 3. Systems Programming Laboratory Subject Code: 10MCA36 50 Hours/Week : 03 03 Total Hours : 42 50 PART. Harvey M Deital: Operating systems. .1 to 12. 12.Hill.4 .1 to 4. Wiley India. Also eliminate them and copy that program into separate file. P. I.

PART. Program to evaluate an arithmetic expression involving operators +. 4. 6.B Execute of the following programs using YACC: Program to test the validity of a simple expression involving operators +. 2. Program to recognize strings ‘aaab’. ‘abbb’. Program to recognize and count the number of identifiers in a given input file. * and /. 5. 3. Replace them with ‘readf’ and ‘writef’ statements respectively. Program to recognize a valid arithmetic expression and identify the identifiers and operators present. Program to recognize a valid arithmetic expression that uses operators +. -. * and /.5. 7. -. 1. Program to recognize the grammar (an b. * and /. ‘ab’ and ‘a’ using the grammar: (an bn . which starts with a letter. n>=10). Program to recognize nested IF control statements and display the number of levels of nesting. -. Print them separately. Instructions: . n>=0) 6. Program to count the number of ‘scanf’ and ‘printf’ statements in a C program. followed by any number of letters or digits. Program to recognize a valid variable. 7.

A Class which creates 2 accounts.A Marks: 50 Exam Marks: 50 Exam Hours: 3 1. Write a JAVA Program to demonstrate Constructor Overloading and Method overloading. Write a JAVA Program to demonstrate Exception Handling (Using Nested try catch and finally). . a deposit() method to deposit amount. a. Write a JAVA program which has i. both account deposit money and one account tries to withdraw more money which generates a LessBalanceException take appropriate action for the same. 3. b. 2. Both will have equal weightages. Write a JAVA Program to implement Inner class and demonstrate its Access Protections. ii. iii. a. A Class called Account that creates account with 500Rs minimum balance. Java Programming Laboratory Subject Code: 10MCA37 Hours/Week: 3 Total Hours: 42 I. b. 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 combination of one LEX and one YACC problem has to be asked based on lots. Write a JAVA Program to demonstrate Inheritance. A Class called LessBalanceException which returns the statement that says withdraw amount (___Rs) is not valid.In the examination.

A Interface class for Stack Operations ii. 11. iii. 5. 6. 10. Write a JAVA program which uses Datagram Socket for Client Server Communication. 2 classes which initializes a String in its constructor ii. 9. i. iv. 12. Write a JAVA program using Synchronized Threads. Write a JAVA program which has i. Write a JAVA Program which uses FileInputStream / FileOutPutStream Classes. Write a Swing Application which uses JTabbed Pane . Write a JAVA program which has i.4. A Class that uses both the above Stacks through Interface reference and does the Stack operations that demonstrates the runtime binding. A Class that implements the Stack Interface and creates a fixed length Stack. 13. Write JAVA Applet programs which handles MouseEvent Write JAVA Applet programs which handles KeyBoardEvent Write a JAVA program which implements RMI. which demonstrates Producer Consumer concept. Write a JAVA Program which writes a object to a file (use transient variable also). A Class that implements the Stack Interface and creates a Dynamic length Stack. 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). A Generic class with 2 type Parameters iii. Write JAVA programs which demonstrates utilities of LinkedList Class 8. 7.

i. DBMS Laboratory Subject Code: 10MCA38 I. deptid: integer) The meaning of these relations is straightforward. No duplicates should be printed in any of the answers. Consider the following relations: Student (snum: integer. d: integer) Enrolled (snum: integer. Find the names of all Juniors (level = JR) who are enrolled in a class taught by Prof. sname: string. major: string. cname: string) Faculty (fid: integer. Harshith . for example. ComboBox / List / Tree / Radiobutton Note: All the above Components should Listen to any one of their respective events and print appropriate message. Level is a two character code with 4 different values (example: Junior: JR etc) Write the following queries in SQL. age: integer) Class (name: string. which includes any one component given below in each Panel iii.ii. fname: string. Each Tab should use JPanel. meets at: string. level: string. room: string. Marks : 50 Hours/Week : 03 Hours: 03 Total Hours : 42 Marks: 50 Exam Exam 1. Enrolled has one record per student-class pair such that the student is enrolled in the class.A.

For all aircraft with cruisingrange over 1000 Kms. Find the names of faculty members for whom the combined enrollment of the courses that they teach is less than five. name: string. Write each of the following queries in SQL. bdate:date) COURSE (course #:int. Find the names of pilots certified for some Boeing aircraft. course#:int. ii.find the name of the aircraft and the average salary of all pilots certified for this aircraft. i. STUDENT (regno: string. iii. v. The following relations keep track of airline flight information: Flights (no: integer. marks:int) BOOK _ ADOPTION (course# :int. aname: string. Find the names of all classes that either meet in room R128 or have five or more Students enrolled. Find the names of aircraft such that all pilots certified to operate them have salaries more than Rs. For each pilot who is certified for more than three aircrafts. iv. from: string. and only pilots are certified to fly. sem:int. book-ISBN:int) TEXT (book-ISBN:int. iv. Find the names of all students who are enrolled in two classes that meet at the same time. cruisingrange: integer) Certified (eid: integer. to: string. Every pilot is certified for some aircraft. 000. ename: string. cname:string. Consider the following database of student enrollment in courses & books adopted for each course. aid: integer) Employees (eid: integer. major: string.ii. distance: integer. Find the names of pilots whose salary is less than the price of the cheapest route from Bengaluru to Frankfurt. iii. v. Find the names of faculty members who teach in every room in which some class is taught. sem:int. 3. Find the aids of all aircraft that can be used on routes from Bengaluru to New Delhi. find the eid and the maximum cruisingrange of the aircraft for which she or he is certified. author:string) . vi. arrives: time. 2. publisher:string. price: real) Aircraft (aid: integer. salary: integer) Note that the Employees relation describes pilots and other kinds of employees as well. . dept:string) ENROLL ( regno:string. book-title:string. Departs: time.80.

iv. ii. v. assets:real) ACCOUNT(accno:int. description:string) ORDER-DETAILS (order-no:int. iii. Enter at least five tuples for each relation. Demonstrate how you increase the price of books published by a specific publisher by 10%. balance:real) DEPOSITOR(customer-name:string. 5. The following tables are maintained by a book dealer. title:string. iii. name:string. price:int) CATEGORY (category-id:int. Find the author of the book which has maximum sales. Enter at least five tuples for each relation. Consider the following database for a banking enterprise BRANCH(branch-name:string. vi. vi. iv. AUTHOR (author-id:int. Create the above tables by properly specifying the primary keys and the foreign keys. city:string. publisher-id:int. category-id:int. ii. Book-title) in the alphabetical order for courses offered by the ‘CS’ department that use more than two books. Create suitable front end for querying and displaying the results. book-id:int. country:string) PUBLISHER (publisher-id:int. country:string) CATALOG (book-id:int. 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. Book-ISBN. Demonstrate how you add a new text book to the database and make this book be adopted by some department. customer-street:string. Create suitable front end for querying and displaying the results. city:string. Produce a list of text books (include Course #. vii. name:string. List any department that has all its adopted books published by a specific publisher. customer-city:string) . branch-name:string. 4. year:int. Generate suitable reports. author-id:int. Create the above tables by properly specifying the primary keys and the foreign keys. Generate suitable reports. accno:int) CUSTOMER(customer-name:string.i. quantity:int) i. vii. v. branch-city:string.

4. Create suitable front end for querying and displaying the results. Generate suitable reports. Suitable tuples have to be entered so that queries are executed correctly. Questions must be asked based on lots. amount:real) BORROWER(customer-name:string. vi. Front end may be created using either VB or VAJ or any other similar tool. Relevant queries other than the ones listed along with the exercises may also be asked in the examination. branch-name:string. iv. . The exercises are to be solved in an RDBMS environment like Oracle or DB2. Find all the customers who have at least two accounts at the Main branch. Demonstrate how you delete all account tuples at every branch located in a specific city. The results of the queries may be displayed directly. The student need not create the front end in the examination. Enter at least five tuples for each relation iii.LOAN(loan-number:int. v. 3. vii. 6. 2. Create the above tables by properly specifying the primary keys and the foreign keys ii. Instructions: 1. Find all the customers who have an account at all the branches located in a specific city. 5. loan-number:int) i.

Sign up to vote on this title
UsefulNot useful