III Sem CourseInfo 2011 With Questions

Course Outline
Semester: III
Session: Aug-Nov 2011
P.E.S. Institute of Technology - Dept. of MCA GENERAL GUIDELINES 1. This book is to be brought to the classroom daily. . 2. Students should be in time for the first class and subsequent classes thereafter. 3. Students should keep the classroom and Laboratories clean and tidy. 4. Students are informed to clarify their doubts in the respective subjects with the faculty by taking prior appointments. 5. Students are advised to show due respect to all faculties regardless of the department and maintain affable personality. 6. Students are to maintain absolute discipline and decorum, so as to promote the fair name of their college in all its activities. 7. Students having less than 85% attendance in any subject (both theory and practical) will not be allowed to take up the University Examination. 8. Students who fail to get minimum of 25 marks in internal assessment of any subject will fall in NSSR category and not eligible to take up that particular subject. 9. Parents are to follow the progress of their wards by being in touch with the college authorities at regular intervals. 10. Writing on desks and walls is strictly prohibited, failing which the students will be fined a minimum of Rs.500. If the identity of the individual is not established the entire class will be fined ranging from Rs.100 to Rs.500. 11. Attendance of the students will be displayed on the departmental notice board as well as available in the web site at the end of the 7th, 11th and 16th week of the semester (w.e.f Aug 1, 2011) along with the list of the students having shortage in attendance. 12. Students should bring the observation book as well as the laboratory record book completed in all respect to the laboratory. 13. Take the print outs of the source listing and output of the code after execution and delete your files. 14. Students are not supposed to alter the configuration of the system / any software on the system. 15. Final examination is of 3 hrs. duration. 16. Students are supposed to fill in the columns in the LOG BOOK at the time of entering the labs. 17. Students should wear IDENTITY CARD all the time. Students without the same will not be allowed to enter either the classroom or the lab. 18. Those students who have less than 85% attendance should sign the undertaking given by their class teachers.
________________________________________________________________________ Perseverance Excellence Service
Course Outline
Sl. No 1 2 3 4 5 6 7 8 Sub. Code
Semester: III
SUBJECT

Marks IA UE 50 50 50 50 50 50 50 50 400 100 100 100 100 100 50 50 50 650 Total 150 150 150 150 150 100 100 100 1050 PAGE # 3-7 8-12 13-17 18-28 29-34 35 36-37 38-39
10MCA31 Systems Software 10MCA32 Computer Networks Programming with Java Database 10MCA34 Management Systems 10MCA33 10MCA35 Operating Systems Systems 10MCA36 Programming Laboratory 10MCA37 Java Programming Laboratory
10MCA38 DBMS Laboratory Total
TIME TABLE Day/ Time 8.159.15 9.1510.15 10.1510.45 10.4511.45 11.4512.45 12.451.30 1.30 2.30 2.303.30
Monday Tuesday Wednesday Thursday Friday Class Teachers III A: L.Meena III B: Meera Rajan
Lunch Break Tea Break
Course Outline
Semester: III SYSTEMS SOFTWARE
Subject Code Faculty
: 10MCA31 : L. Meena
Hours / Week: 04 Total Hours: 52
Over view: It is a study about introduction to the design and implementation of software which consist of variety of programs that support operation of the computer. The major topics covered here are assemblers, loaders and linkers, etc. It also describes the real machines that are used as examples throughout the course. These machines have contrasting architectures and were chosen as examples in order to illustrate the variety in software and hardware systems.
Class #
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20.
Chapter #
Chapter #: 1.0
Topic to be covered
Introduction, System Software and Machine Architecture SIC Machine Architecture
% of portions covered Reference Cumulative Chapter
Machine Architecture
SIC/XE Machine Architecture SIC Programming Examples SIC/XE Programming Examples SIC/XE Programming Examples Basic Assembler Function A Simple SIC Assembler Assembler Algorithm and Data Structures Assembler Algorithm and Data Structures Machine Dependent Assembler Features Instruction Formats & Addressing Modes Machine Dependent Assembler Features Instruction Formats & Addressing Modes 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
12%
12%
1.1 to 1.3
Chapter #: 2.0 & 3.0
Assemblers except 2.5.2 &2.5.3
27%
39%
Course Outline
21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. Chapter #:5.0 Editors And Debugging Systems Except 5.5 Chapter #: 4.0 Loaders And Linkers Except 4.4.3
Semester: III
Basic Loader Functions - Design of an Absolute Loader A Simple Bootstrap Loader Relocation, Program Linking Algorithm and Data Structures for a Linking Loader Automatic Library Search, Loader Options, Loader Design Options, Linkage Editor, Dynamic Linkage Bootstrap Loaders Implementation ex: MS-DOS Linker Text Editors Overview of Editing Process, User Interface Editor Structure, Interactive Debugging Systems Debugging Functions and Capabilities Relationship with other parts of the system User-Interface Criteria Basic Macro Processor Functions Macro Definitions and Expansion
13%
52%
10%
62%
33. 34. 35. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. Lex & Yacc 1&2 Chapters 1,2(2-42), 3(51-65) Chapter #: 7.0 Macro Processors Chapter #: 6.0
Macro Processor Algorithm and Data Structures Concatenation of Macro parameters, Generation of Unique Labels Conditional Macro Expansion, Keyword Macro Parameters Macro Processor Design Options Recursive Macro Expansion, GeneralPurpose Macro Processors Macro Processing within Language Translators Implementation examples MASM Macro Processor, ANSI C Macro Processor Basic Compiler Function Grammars, Lexical Analysis, Syntactic Analysis, Code Generation Lex and Yacc The Simplest Lex Program, Recognizing words with LEX Symbol Tables, Grammars Parser-Lexer communication, The parts of speech, Lexer A YACC Parser, The Rules Section A word counting program, Parsing a command line Using YACC Grammars, Recursive rules Shift/Reduce parsing, What YACC Cannot parse A YACC Parser The definition section. The rules section, symbol values and actions
13%
75%
25%
100%
Course Outline
49. 50. 51. 52. Test Syllabus Test 1: Chapters 1, 7 Test 2: Chapters 2, 3, 4 Test 3: Chapters 5, 6, LITERATURE: Book Type Text Book Text Book Referenc e Book Code T1 T2 R1
Semester: III
The LEXER, Compiling and running a simple parser Arithmetic expressions and ambiguity, variables and typed tokens. problems problems
Title and Author System Software By Leland. L. Beck Lex and Yacc By John. R. Levine and Tony Mason Systems Programming and Operating Systems By D. M. Dhamdhere
Publication Information Edition Publisher Year Addison3rd 2004 Wesley OReilly,SPD 2nd TMH 1999 1999
QUESTION BANK
Chapter 1 Machine Architecture

Objective: Gives a description of the Simplified Instructional Computer(SIC) that is used to present fundamental software concepts. 1. (a) Differentiate between system software and application software. (b) Explain all instruction formats of SIC/XE. 2. (a) Write an ALP in SIC/XE: To add two arrays of 200 integers. (b) Describe the following with respect to SIC/XE machine. (i) registers (ii) addressing modes 3. Write a sequence of instructions for SIC/XE to set ALPHA equal to 4*beta-9. Use immediate addressing for the constants. 3. Write a sequence of instructions for SIC to set ALPHA equal to the integer portion of BETA / GAMMA. Assume that ALPHA and BETA are defined. 4. Explain all instruction formats of SIC. 5. Write a sequence of instructions for SIC to set ALPHA equal to the product of BETA and GAMMA.
Course Outline
Semester: III
6. Write SIC instructions to swap the values of ALPHA and BETA. 7. Write a sequence of instructions for SIC to clear a 20 byte string to all blanks. 8. Suppose that APLHA I is an array of 100 words. Write a sequence of instructions for SIC to set all 100 elements of the array to 0. 9. Suppose that record contains a 100-byte record. Write a subroutine for SIC that will write this record on to device 05.
Chapter 2 & 3 Assemblers

Objective: Assemblers chapter Describes the design and implementation of assemblers, machine-dependent extensions to the basic structure. Introduces a number of machine independent assembler features. 10. Generate the object program for the ALP given below: (record format) TEST START 0 BEGIN CLEAR X OPCODE CLEAR A CLEAR B4 +LDS #4096 LDS 6C LOOP ADD TABLE, X ADD 18 TIXR S TIXR B8 JLT LOOP JLT 38 +STA TOTAL STA 0C RSUB RSUB 4C TABLE RESW 4096 TOTAL RESW 1 END BEGIN 11. (a) briefly describe 2 DS required for a simple assembler. (b) Differentiate between literal and immediate operand with an example.
12. Write and explain the algorithm for pass2 of an assembler. 13. Briefly explain how forward references are handled in a 1-pass assembler. 14. (a) explain how relocation is done using modification record. (b) What are assembler directives? Explain the directives BASE, EXTREF? 15. Write short notes on (a) Multipass assemblers (b) Registers and memory in Pentium Pro Architecture
Course Outline
Semester: III
Chapter 4 Loaders and Linkers

Objective: This chapter objective is to discuss basic loader functions, introducing machinedependent and machine independent loader features.
16. Write the complete algorithm for a linking loader. 17. Explain the program of a boot strap loader. 18. (a) Explain the data structure and variables used in the linking loader algorithm. (b) Explain Absolute loader. 19. What is dynamic loading? What are its advantages? Explain with a neat diagram loading and calling of a subroutine using dynamic linking.
Chapter 5 Editors And Debugging Systems

Objective: Discusses about other system software like text editors and debugging systems. Introduces the editing structure of the text editor and debugging functions, capabilities. 20. Explain with figure the editing structure of a text editor. 21. Explain the functions and capabilities of debugging system.
Chapter6
MacroProcessors
Objective: The objective of this chapter is to study basic macro processor functions, Machineindependent macro processor features and macro processor design options. 22. (a) What is the difference between a macro call and a subroutine call? (b) What is conditional macro expansion? Explain with example? 23. Explain the following: (i) Concatenation of macro parameters (ii) Generation of unique labels (iii) Recursive macro expansion 24. Explain the various DSs required for the design of a macro processor with an example? 25. Write an algorithm for one-pass macro processor.
Course Outline
Semester: III Chapter 7 Lex & Yacc
Objective: The objective of this is to study about the two phases of compiler. Discusses about regular expressions, grammars and the structure of lex and yacc program. 26. Explain YACC parser with example. Write a lex program to find the number vowels and consonants in a given sentence. of
27. Explain the structure of a LEX program. Write a LEX program to count number of positive integers, negative integers, positive and negative fractions. 28. Write short notes on: a) YACC
b) Linkage editor
29. Write a YACC program for: (a) Variable starts with letter followed by any number of letters or digits.
30. (a) Write the code generation routine for a READ statement. (b) Give a complete BNF notation for the ASSIGNMENT statement.
31. Describe how finite automata are used in recognizing the tokens of a typical programming language.
Course Outline
Semester: III
COMPUTER NETWORKS
Subject Code Faculty Overview:
: 10MCA32 : Mrs. VEENA.S
This course gives a concrete idea of building computer networks which helps in effective data communication from one part to another that is from source to destination. A computer network is a dynamic and changing area. This course distinguishes between what is important, what may going to be changed in future and what is long lasting. Emphasis is laid upon the building blocks of networks, different network technologies like Ethernet, FDDI, wireless, cell phone technology etc. It also deals with LANs, MANs and WANs. A detailed study of building an internetwork using the above components and the issues related to internet work will be discussed. It also deals with end-to-end protocols and resource allocation issues. Finally we are going to see some of the applications like email, DNS etc. Clas s# 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 CHAPTER 1: Foundation T 1: Page #:1-50 % of portion covered Chapterwi Cumulativ se e
Chapter #
Topics to be covered Overview of the subject, Building a network - : applications Requirements: connectivity Cost-effective resource sharing, support for common services Network architecture: layering and protocol, OSI architecture Internet architecture Implementing network software Performance: bandwidth and latency Delay x bandwidth product, problems Physically connecting hosts: hardware Building blocks: nodes Links Encoding Framing Error detection Two-dimensional parity, Internet checksum algorithm Cyclic Redundancy Check Reliable transmission - Stop and wait Sliding window Concurrent logical channels Ethernet(802.3) Rings(802.5,FDDI,RPR) Wireless (802.15.1, 802.11, 802.16, Cell Phone Technologies) Switching and forwarding: Datagrams Virtual circuit switching Source routing Bridges and LAN switches: Learning bridges Spanning tree algorithms Broadcast and multicast
15%
15%
CHAPTER 2: Direct link networks T 1: Page #:64-147
23%
38%
CHAPTER 3: Packet switching T 1: Page #:166-194
14%
52%
Course Outline
27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 CHAPTER 6: Applications T 1: Page #:640 -693 CHAPTER 5: End-to-end protocols T 1: Page #:380 - 411, 456 - 467 CHAPTER 4: Internetworking T 1: Page #:232-329
Semester: III
Limitations of bridges Simple internetworking: service model Global addresses, Datagram forwarding in IP ARP, DHCP ICMP, Virtual networks and Tunnels Routing: network as a graph Distance vector(RIP) Link state(OSPF) Metrics, routing for mobile hosts, Router implementation Global internet: - sub netting Classless routing(CIDR) Interdomain Routing(BGP), Routing Areas IP version 6 (IPv6) Simple demultiplexer (UDP) Reliable byte stream(TCP) : end-to-end issues, Segment format Connection establishment and Termination, Sliding window revisited Triggering Transmission, Adaptive Retransmission Record boundaries, TCP Extensions, Alternative Design Choices Issues in Resource Allocation: network model Taxonomy, evaluation criteria Application layer overview, client and server model DNS, Name Address mapping, DNS Message format Remote login protocols, Telnet, SSH Electronic Mail (SMTP), File Transfer (FTP), World Wide Web (HTTP) Overview of IP Telephony VOIP signalling protocols(SIP and H.323)
23%
75%
14%
89%
11%
100%
Test Syllabus Test 1: Class # 1 - 17 Test 2: Class # 18 - 35 Test 3: Class # 36 - 52
10
Course Outline
LITERATURE: Book Type Text Book Code T1
Semester: III
Title and Author Edition Computer networks A Systems Approach - Larry L Peterson and Bruce S. David Computer and Communication Networks Nader F. Mir Data and Computer Communications William Stallings Data Communication and Networking - Behrouz A. Forouzan Communication Networks Fundamental Concepts and Key Architectures - Alberto Leon-Garcia IV
Publication Information Publisher Year Morgan kaufmann Pearson education 2007
Text Book
T2
2007
Reference Book Reference Book Reference Book
R1
VIII
Pearson education Tata McGraw-Hill Tata McGraw-Hill
2007
R2
IV
2006
R3
II
2004
QUESTION BANK Chapter 1: Foundation. This chapter gives the general idea of Computer Networks which will be used throughout the course. It deals with the basic building blocks, different type of architectures, need of layering and the implementation issues of computer networks. Finally we discuss how performance of networks can be measured using bandwidth and latency. 1. 2. 3. 4. Discuss the applications of Computer Networks. What is Multiplexing and Demultiplexing? What is the need for layering? What are the functions of layers? Define the following: a) Bandwidth b) Latency c) Throughput d) RTT e) Jitter 5. Explain the OSI reference model with a neat diagram. 6. Why Encapsulation is required in Network architecture? Explain in detail. 7. Explain the TCP/IP reference model. State the functions of each layer. 8. What are the advantages of layered architecture of a computer network? 9. Compare OSI model with TCP/IP model. 10. What is the significance of Bandwidth X Delay product. Chapter 2: Direct Link Networks. This chapter discusses the problems faced while transferring information from source to destination, like Encoding, Framing, Error Detection, Reliable transmission and Media Access Control. It gives an insight into a variety of Networking technologies ranging from Ethernet, Token Rings, Cell Phones and Wireless. 1. What are Direct link Networks? What are the issues in Direct Link Networks? 2. With a neat diagram explain the architecture of a workstation.
11
Course Outline
Semester: III
3. What is Encoding? Describe the different Encoding schemes. 4. Show the 4B/5B Encoding and the resulting signal for the following bit sequence. 1110010100000011 5. Discuss the advantages and disadvantages of each of the encoding schemes. 6. What is Framing? 7. Explain Byte oriented protocols. 8. Explain HDLC with its frame format. 9. Explain Bit stuffing and Byte stuffing. 10. Write the internet checksum algorithm and explain. 11. Explain CRC. 12. Explain how Two-dimensional parity can be used in error detection. 13. What is reliable transmission? Explain stop and wait algorithm. 14. Explain the sliding window algorithm. 15. Discuss 802.3 frame format. 16. Write and explain the clock based Framing. 17. Discuss FDDI. 18. Explain the MAC protocol and how Token ring maintenance is done for token ring networks. 19. Write and explain the collision avoidance and distribution system of wireless networks. 20. Explain the hidden node problem and Exposed node problem in wireless networks. Chapter 3: Packet Switching. This chapter introduces the basic models of switched networks, Datagrams, Virtual Circuits and Source Routing. It also gives the insight into Bridges and LAN switches. 1. 2. 3. 4. 5. 6. Explain packet switching. Explain how forwarding tables can be used in datagram forwarding. Explain virtual circuit switching with an example. What is the need for spanning tree algorithm and explain the algorithm. Explain source routing. Explain the sliding window algorithm.
Chapter 4: Internetworking. This chapter introduces the issues related to the network of networks the global Internet. It Explains the nature of the basic internet protocol IPv4. It deals with the global addressing problem and scalability issues. Finally it introduces the alternative to IPv4, i.e. CIDR and IPv6. 1. With a neat diagram explain the simple internetwork. 2. Explain the IPV4 packet format with the importance of each field. 3. What is Fragmentation and reassembly? Why is it required? 4. Write a note on datagram forwarding in IOP. 5. Write a note on IP address classes. 6. What is address resolution problem? Explain how ARP resolves this problem. 7. What is DHCP? Discuss the dynamic configuration of hosts with the help of DHCP. 8. Discuss the issues related to global internet. 9. Explain IPv6. 10. Give 6 differences between IPv4 and IPv6. 11. Explain Link state routing. 12. Explain OSPF with an example. 13. What is subnetting? Explain subnet addressing for a class B IP address.
12
Course Outline
Semester: III
14. Explain in detail inter domain routing (BGP) protocol. 15. Explain CIDR. 16. What are the network number, subnet number and Host number for the following address 135.104.192.100 mask 255.255.128.0? 17. Describe the IP address formats. Chapter 5: End to End Protocols and Resource allocation Issues. This Chapter deals with the Transport level issues. It deals with the User Datagram Protocol (UDP) and Transmission Control Protocol (TCP) in detail. It also provides an insight into the issues in Resource allocation.
1. 2. 3. 4. 5. 6. 7.
Explain the TCP header format along with the field specifications. Explain Three way Handshake algorithm used in TCP. What is meant by sillt window syndrome? Explain the solution to this problem. Discuss the issues in Resource allocation. Explain how resource allocation mechanisms can be classified. Explain the process of connection establishment in the Transport layer? Explain in brief about TCP congestion control.
Chapter 6: Applications. This chapter describes a representative sample of network applications and the protocols they use, including the traditional applications like email and the web. It also gives an insight into the protocols like FTP, HTTP VoIP etc. 1. 2. 3. 4. 5. What is DNS? Explain how name resolution takes place in practice. What is SNMP? Explain. Write short notes on Electronic mail. Write a note on World Wide Web. Explain the operation of FTP. Discuss its merits and demerits.
13
Course Outline
Semester: III
PROGRAMMING WITH JAVA

Subject Code: 10MCA33 Faculty: MEERA RAJAN Hours / Week: 4 Total Hours: 52
Overview: Java is first and foremost programming language used for internet. This course describes basic fundamentals of java programming. It includes topic like exception handling, Applet, Strings, Multi Threading, Inheritance, Enumeration, and Autoboxing. It also describes to create application using various concepts in Java. % of portion covered Chapter wise Cumulative
Class no.
Chapter #
Topics to be covered Object-Oriented Programming, A First Simple Program, A Second Short Program, Using Blocks of Code Lexical Issues, The Java Class Libraries. Data Types, Variables , and Arrays Java Is a Strongly Typed Language, The Primitive Types, A Closer Look at Literals, Variables, Type Conversion and casting, Automatic Type promotion in Expression, Arrays, A few words about Strings. Operators: Arithmetic Operators, The Bitwise Operators, Relational Operators Boolean Logical Operators, The Assignment Operator, The ? Operator, Operator Precedence, Using Parentheses. Control Statements: Javas Selection, Iteration Statements, Jump Statements. Class Fundamentals, Declaring Objects, Assigning Object Reference Variables Introducing Methods, Constructors, The this Keyword, Garbage, The finalize( ) Method A Stack Class. A Closer Look at Methods and Classes: Overloading Methods, Overloading Constructors, Using Objects as Parameters, A Closer Look at Argument Passing, Returning Objects, Recursion,
2 3 4
5 Unit 1 An overview Of JAVA And Unit 2 Introducing Classes
19.23
19.23
10
14
Course Outline
11
Semester: III
12
13
14
15 Unit 3 Inheritance:
16
17 18
19
20 21 22 23 24 Unit 4 Multithreaded Programming
25
26
27
28 29
Unit 5 Enumeration, Autoboxing
Introducing Access Control, Understanding static, Introducing final, Arrays Revisited, Introducing Nested and Inner Classes, Exploring the String Class, Using Command-Line Arguments, Varargs Inheritance Basics, Using super, Using super Creating a Multilevel Hierarchy, When Constructors Are Called, Method Overriding, Dynamic Method Dispatch Using Abstract Classes, Using final with Inheritance, The Object Class. Packages and Interfaces: Packages, Access Protection, An Access Example Importing Packages, Interfaces. Exception Handling: Exception-Handling Fundamentals, Exception Types, Uncaught Exceptions Using try and catch, Multiple catch Clauses, Nested try Statements, throw, throws, finally, Javas Built-in Exceptions, Creating Your Own Exception Subclasses, Chained Exceptions, Using Exceptions. The Java Thread Model, The Main Thread, Creating a Thread, Creating Multiple Threads Using isAlive( ) and join( ), Thread Priorities, Synchronization, Interthread Communication, Suspending, Resuming, and Stopping Threads, Using Multithreading. Input/Output: Exploring java.io: The Java I/O Classes and Interfaces, The Closable and Flushable Interfaces, The Stream Classes, The Byte Streams, The Character Streams, The Console Class, Using Stream I/O, Serialization, Stream Benefits. Enumeration, Type Wrappers, Autoboxing. Generics: What are Generics?, A Simple Generics Example A Generics Class with two Type Parameters, The General Form of a Generic Class. String Handling:
15.38
34.61
15.38
49.99
13.46
63.45
15
Course Outline
30
Semester: III
31
32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 Unit 7 Networking Unit 6 Exploring Java.lang :
The String Constructors, String Length, Special String Operations, Character Extraction, String Comparison, Searching Strings, Modifying a String, Data Conversion Using valueOf( ), Changing the Case of Characters Within a String, Additional String Methods, StringBuffer, String Builder. Primitive Type Wrappers, System, Object, Class, Class Loader, Math, Thread, ThreadGroup, Runnable, Throwable. The Collections Framework: Collections Overview, The Collection Interfaces, The List Interface, The Queue Interface, The Collection Classes, The ArrayList Class The LinkedList Class, The HashSet, The TreeSet Class. Networking Basics, The Networking Classes Interfaces InetAddress TCP/IP Client Sockets URL, URLConnection, HTTP URL Connection, TCP/IP Server Sockets, Cookies Inet4Address and Inet6Address, The URI Class Remote Method Invocation (RMI) The Applet Class, Event Handling Two Event Handling Mechanisms The Delegation Event Model Event Classes, Sources of Events Event Listener Interfaces, Using the Delegation Event Model Adapter Classes, Inner Classes. Introducing Swing, Exploring Swing.
23.06
86.51
8.46
92.97
Unit 8 The Applet Class
6.56
100
16
Course Outline
Literature: Book Type Book Code
Semester: III
Title and Author Herbert Schildt: The complete reference JAVA, 7th Edition, Tata MoGrawHill, 2006.
Publication Specification Edition Publication Year
Text Book
T1
R1
R2 Reference Book
R3
R4
R5
(Chapters: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 20, 21, 22, 27, 29, 30) Raghavan P, Suresh Kumar T V: Programming with Java, SanguinePearson, 2010. James P Cohoon, Jack W Davidson: Programming in JAVA 5.0, Tata McGraw Hill, 2007. Cay S Horstmann, Gary Cornell: Core Java 2 - Volume 1, 7th Edition, Pearson Education, 2005. Cay S Horstmann, Gary Cornell: Core Java 2 - Volume 2, 8th Edition, Pearson Education, 2008. Y. Daniel Liang: Introduction to JAVA Programming, 7th Edition, Pearson Education, 2007.
Pearson education
2007
Test Syllabus:Test1: Chapter 1, 2 & 3. Test2: Chapter 4, 5 & 6. Test3: Chapter 7 & 8.
Question Bank CHAPTER 1: An overview of JAVA
Overview: This chapter discusses about the basics of java and its types, variables,
array, strings, operators 1. Describe the general structure of a simple JAVA program. 2. Discuss various data types used in JAVA. 3. How java is better than C++? Discuss. 4. What are the advantages of JAVA? Explain. 5. How JAVA is strongly associated with internet? 6. Why is java known as platform-neutral language? 7. Explain the features of JAVA 8. What is a variable? Explain the declaration and rules for variable. 9. Discuss the loop control structures with example. 10. What is array? How are arrays declared and handled in java. 11. How do you define a class in java?
17
Course Outline
Semester: III
12. Mention different approaches of returning more than nor value from a method? 13. Explain JVM an example? 14. Why should main method be static, public and void in java? 15. How are static members different from normal members? what are the restrictions for static members ? 16. What are methods? How they are invoked in java? How does java passes parameters tothem? CHAPTER 2:Introducing Classes Overview: This chapter discusses about how the class and objects are created, various types of Access Control, Understanding Nested and Inner Classes. 17. What is an object? Describe the characteristics of object. 18. How a object variable is created? Describe the characteristics of object. 19. What is a class? What are the three parts of a simple, empty class? 20. What is a constructor? What are its special properties? 21. What is polymorphism? 22. Explain the String class in detail with example. 23. What is inheritance? Describe different forms of inheritance with example. 24. Explain method overloading with an example. 25. Describe how an interface is defined and implemented. Give example 26. What is applet? Discuss the steps involved in loading and running a applet 27. Describe the different stages in the life cycle of an applet. Distinguish between init () and start () methods. 28. What is an exception? Explain the exception hierarchy in java. 29. Explain how exception handling mechanism can be used for debugging a program. 30. Explain method overloading in java CHAPTER 3: INHERITANCE Overview: This chapter discusses about Inheritance concepts, using super keyword, 31. What is need for Inheritance? Define Inheritance. 32. Explain SUPER keyword. 33. What are the uses of the keyword super in java? 34. Explain multiple inheritances? Can it be implemented in java? 35. Explain Exception-handling Mechanisms?, 36. Explain TRY, THROW, CATCH, FINAlly? CHAPTER 4: MultiThreaded Programming Overview: This chapter discusses about multithreading, Thread Priorities . 37. What are Threads in Java? 38 How Threads are implemented? What is Multi-Threading? 39. Explain Synchronization? 40. What is InterThread Communication? 41. What is meant by Suspending,Resuming& Stopping Threads? CHAPTER 5 : Enumeration,Autoboxing Overview: This chapter discusses about the Generics features and also how to handle String Functionalities. 42. What is a string ? what are the different String handling methods? 43. Explain Data conversion in Using ValueOf()? 44. Explain changing the case of Characters within a String ?
18
Course Outline
Semester: III
CHAPTER 6 : Exploring java.lang 45. What are packages ? 46. What are collections Framework ? 47. Explain Linked List Class ,Hash Set, Tree-set class. CHAPTER 7 : Networking 48. What is Networking? 49. Explain Networking Classes and Interfaces Inet Address? 50. Explain TCP/IP Client Sockets. 51. Explain TCP/IP Server Sockets. 52. what is RMI ?
CHAPTER 8 : THE Applet Class 53. What are swings? What are the reasons to choose swing in JAVA? 54. Explain the following with an example. a. JText Field class b. JText Area class c. JLabel class d. Jlist class 55. What are components? Which are the subclasses of components of abstract window toolkit? Briefly discuss. 56. How do you use java system package? 46. What are the different ways of accessing packages? 47. How do you extend one interface by the other?
19
Course Outline
Semester: III
Data Base Concepts & Applications

Subject: Code: 10MCA34 No of hours: 52 Faculty: NEELAM BAWANE No of hours/week: 04 Overview Database management systems are now indispensable tool for managing information, and a course on the principles and practice of database systems is now an integral part of computer science. This course covers the fundamentals of modern database management systems, in particular relational database systems. Chapter % of portions to be covered Class Title/Reference Topics to be covered Literature # Reference Cumulative Chapter 1 Introduction; An example 2 Characteristics of Database approach; Actors on the screen; Workers behind 3 the scene; Advantages of using DBMS approach; A 4 brief history of database applications; Chapter1: when not to use a DBMS. Introduction Data models, schemas and instances; 13 13 T1: Page 3-52 5 Three-schema architecture and data independence; Database languages and interfaces; 6 The database system environment; Centralized and client-server 7 architectures; Classification of Database Management systems. Using High-Level Conceptual Data 8 Chapter 2: Models for Database Design, An Entity Example Of database Application Relationship Entity types, Entity sets, Attributes and 9 Model Keys T1:Page 57-90 Relationships types, Relationship sets, 10 Roles and Structural Constraints 13 26 Weak Entity Types, Refining the ER 11 Design for the COMPANY Database 12 ER Diagrams 13 ER Diagrams Naming Conventions and Design Issues; 14 Relationship types of degree higher than two Chapter 3: 15 Relational Model Concepts Relational Relational Model Constraints and 16 Model and Relational Database Schemas; Relational Update Operations, Transactions and 17 Algebra 15 41 dealing with constraint violations; T1: Page 145Unary Relational Operations: SELECT 18 200, 225-233 and PROJECT; Relational Algebra Operations from Set 19 Theory
20
Course Outline
20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 Chapter 6: Overview of Transaction Management T2: Page 519554, 579-596 Chapter 5: Database Design T1: Page 337409 Chapter 4: SQL T1: Page 243330
Semester: III
Binary Relational Operations: JOIN and DIVISION; Additional Relational Operations; Examples of Queries in Relational Algebra; Relational database Design Using ER-toRelational Mapping SQL Data Definition and Data Types; Specifying basic constraints in SQL; Schema change statements in SQL; Basic queries in SQL; Basic queries in SQL; Basic queries in SQL; More complex SQL Queries More complex SQL Queries More complex SQL Queries Insert, Delete and Update statements in SQL; Specifying constraints as Assertion and Trigger; Views (virtual tables) in SQL Additional features of SQL; Database programming issues and techniques; Embedded SQL, Dynamic SQL; Database stored procedures and SQL/PSM. Informal Design Guidelines for Relation Schemas Functional Dependencies Functional Dependencies Normal Forms Based on Primary Keys Normal Forms Based on Primary Keys General Definition of 2nd & 3rd Normal forms General Definition of 2nd & 3rd Normal forms Boyce-Codd Normal Form The ACID Properties; Transactions and Schedules; Concurrent Execution of Transactions; Lock- Based Concurrency Control; Performance of locking; Transaction support in SQL; Introduction to crash recovery; 2PL, Serializability and Recoverability; Introduction to Lock Management; Introduction to ARIES; The log; Other recovery-related structures; The writeahead log protocol;
33
74
15
89
48
12
100
49
50
21
Course Outline
51 52
Semester: III
Checkpointing; Recovering from System Crash; Media Recovery; Other approaches and interaction with concurrency control. a
Literature: Book Type Text Book Text Book Book Code T1 T2 Title & Author Fundamentals of Database Systems- Elmasri and Navathe Database Management SystemsRaghu Ramakrishna & Johannes Gehrke Database System Concepts-Henry F Korth, Silberscatz & Sudharshan A Introduction to Database systems C.J.Date, A Kannan, S. Swamynatham Publication Info Edition Publisher Year 5th Pearson 2007 Education 3rd Tata 2003 McGraw-Hill 6th 8th Tata McGraw-Hill Pearson Education 2010 2006
Reference Book Reference Book
R1 R2
Test 1: Chapter 1 & 2 Test 2: Chapter 3 & 4 Test 3: Chapter 5 & 6
Question Bank
Chapter 1: Introduction Objective: This chapter introduces databases, their typical users, and DBMS concepts, terminology and architecture. 1. Define the following terms: 2. a) Database b) DBMS c) Program-Data independent d) DBA e) End User f) Data Base Schema g) Data Abstraction h) DDL i) external Schema j) conceptual Schema k) DML 3. What is DBMS? Explain database system with a schematic diagram. 4. What is DBMS? Compare DBMS with file processing system. 5. Explain the basic concepts of DBMS and in what way it is advantageous over conventional file processing. 6. Describe the approach used for handling data in early based system. Discuss the disadvantages of this approach. 7. What is data independence? Explain the different levels of data independence. 8. What is a Data model? Explain different data models. 9. Explain the 3 levels of data abstraction. 10. Discuss the main characteristics of database approach. 11. With a neat figure of a data base system, explain the different important parts. 12. What are the responsibilities of DBA and the database designer? 13. What are the different types of data base end users? 14. Discuss some type of database utilities and their functions. 15. What is the difference between logical data independence and physical data independence? Which is easier to accomplish? Why? 16. Explain client-server architecture for DBMS. 17. Describe the classification of database management system. 18. Explain centralized architecture for DBMS. 19. Describe database system utilities.
22
Course Outline
Semester: III
Chapter 2: Entity-Relational Model Objective: In this chapter, the concepts of the Entity-Relationship (ER) model and ER diagram are presented and used to illustrate conceptual database design. Discuss the high level database design process. 20. Define the following term: a) Entity b) Attribute c) Key Attribute d) Attribute Value e) Stored attributes f) Derived attribute g) Super Key h) Candidate Key i) Partial Key j) Foreign key k) Primary key l) Weak entity m) Cardinality ratio n) Participation constraint o) Generalization p) Composite key q) Recursive relationship 21. Explain the difference between attribute and value set. 22. What is entity type, entity set? Explain the difference between entity, entity type and entity set. 23. Explain the mapping cardinalities and Existence dependencies in the EntityRelationship design. 24. Construct an E-R diagram for a car insurance company with a set of customers, where each customer owns number of cars. Associated with each car there are number of recorded accidents. For the above E-R diagram develop a relational model. 25. Write the E-R diagram for the automation of various activities of MCA department of your college. The requirement is to maintain the Teachers, Student information, attendance and class marks etc. Design database tasks. 26. Construct an E-R diagram for part of a BANK database. Each bank can have multiple branches and each branch can have multiple accounts. 27. Draw an E-R diagram to model the following description: A company operates many departments. Each department has one or more employees and each employee works for one department. A manager controls each department. Many projects are carried out in a department with a team of employees assigned to it. It is required to maintain information about the departments of every employee. 28. Explain strong and weak entity sets with an example. 29. Explain the different types of attributes which occur in ER model. 30. An instructor teaches number of courses. The course uses many text books. Draw an ER diagram to represent this. Reduce the ER diagrams into set of relations. 31. What is relationship type? Explain the difference between a relationship instance and a relationship type? 32. What is a participation role? When is it necessary to use role names in description or relationship type? 33. Explain different cardinalities applied in ER model with an example each. 34. Notown records has decided to store information about musicians who perform on its albums in a database. Design an E-R diagram on considering the following specifications. Specify properly cardinality constraints and keys. i) Each musician that records at Notown has an SSN, name, an address and phone number. Phone number can be more than one. ii) Each instrument used in songs recorded at Notown has a name and a musical key. iii) Each album recorded on the Notown has a title, a copyright date, a format and an album identifier iv) Each song recorded at Notown has a title and an author. v) Each musician may play several instruments, and a given instrument may be played by several musicians. vi) Each album has number of songs on it, but no song may appear on more than one album.
23
Course Outline
vii) viii)
Semester: III
Each song is performed by one or more musicians and a musician may perform a number of songs. Each album has an excellent musician who acts as its producer. A musician can produce several albums.
Chapter 3: Relational Model and Relational Algebra Objective: This chapter describes the basic relational model, its integrity constraints and update operations, and the operations of the Relational Algebra. 35. Discuss various update operations on relations and the type integrity constraints that must be checked for each update operation. 36. Define the basic relational algebra operators. Show how natural join, intersection and division can be implemented using basic operators. 37. What are integrity constraints? List different types of integrity constraints and explain any two of them. 38. Describe how the database system will ensure that the modifications to the database will not violate referential integrity constraints. 39. Explain the following terms with suitable examples: a) select b) project c) join d) union e) Cartesian product f) set difference g) natural join h) rename 40. Explain the following extended relational algebra operations: a. Inner joins b. Outer join c. Aggregate functions 41. For each of the following queries, give an expression in the relational algebra. Employee (Fname, Lname,SSN, Bdate, Addr, Salary, Superssn, Dno) Department (Dname, Dno, Mgrssn, Mgrstart) Dependent (ESSn, Dependent name, Bdate, Relationship) Retrieve the names and address of all employees who work for research department. List the names of managers who have at least one dependent. 42. Consider the following relational database. For each of the following queries, give an expression in the relational algebra. Employee (employee_name, street, salary, city) Works (employee_name, company name, salary) Company (company name, city) Manager (employee_name, manager name) Find the names, street address and cities of residence of all employees who workfor First Bank Corporation and earn more than Rs. 10,000 per month. Find the names of all employees in this database who live in the same city as the company for which they work. 43. Consider the scheme Employee(Id#, name, designation, salary) perform the following functions using relational algebra: a. sum of salary b. count distinction designations c. maximum salary d. delete records of employee having salary less than 1000 e. insert a record Chapter 4: SQL-The Relational Database Standard Objective: It gives a detailed overview of the SQL language, covering the SQL2 standard. 44. Explain the following: a) Nested Query b) Correlated nested Query 45. Write short notes on: a) Embedded SQL b) Dynamic SQL c) Database stored procedure d) SQL/PSM 46. Data is stored in the XYZ database which has the following tables: Employees: (Emp-no, name, street, city, zip, telephone-no, date-hired, type, basic-pay)
24
Course Outline
Semester: III
Customer: (Cust-no, name, street, city, zip, telephone-no, type) Orders: (Order-no, cust-no, emp-no, received, shipped) Order-specs: (Order-no, item-no, quantity) Inventory: (Item-no, item-name, quantity on hand, price, re-order-level) Based on these tables, write the queries for the following: i) Obtain the details about all the customers. ii) Obtain max, min, average and sum of basic pay of employees. iii) List all the item names and quantity on hand. iv) Delete an item in inventory for which quantity on hand = 0. 47. Assuming the following entities and attributes, write SQL statements Employee (Name, SSN, Salary, DNO) Dept (Dname, Dnum) Project (Pname, Pnumber, Dnumber) i) Retrieve all the attributes of employees working for Research department ii) Using nested query, retrieve the name of each employee who works on all the projects controlled by dept. number 3. iii) For each project on which more than two employees work, retrieve the project number, project name and the number of employees who works on the project. 48. Write short notes on the following: i) Data retrieval in SQL ii) SQL iii) Views in SQL 49. Define view with an example. How is it defined in SQL? What are the constraints on update operations of views? 50. Consider the following scheme for the COMPANY database. The primary keys are underlined. Employee (SSN, Fname, Lname, Bdate, Address, Salary, Dno) Department (Dnumber, Dname, Dlocation) Perform the following functions: i) Insert a record. ii) Delete an employee with SSN equal to 10. iii) Update the deptno. Of the employee tuple having salary greater than 10,000. iv) Retrieve the name and the address of all employees who work with XYZ department. v) Find all the employees whose birth date is less than AA-BB-CC 51. Consider the following relations for a database that keeps track of business trips of sales persons in a sales office: SALES PERSON (SalespersonID, Name, Start-Year, Dept-No) TRIP(SalespersonID, From,To, Departure-date, Return-date, TripID) EXPENSE (TripID, Account No, Amount) i) Specify the foreign keys for the above schema. Then specify the following queries in relational algebra. ii) Give the details (all attributes of TRIP relation) for trip that exceeded Rs. 8,000/- in expenses. iii) Print the salespersonID and Name of the salesman who took trips to Delhi iv) Print the total trip expenses incurred by the salesman with salespersonID = 502 52. Assume there is a relation EMP whose attributes are Emp-No, Name, Degree, places and another relation ALLOCATION whose attributes are Emp-No and Quarter-No. Write SQL statement for the following: i) Obtain the list of the names of employees whose place is Chennai and who have been allotted quarters.
25
Course Outline
Semester: III
53. Consider the following database schema: Hotel (Hotelno, name city) Room (Roomno, Hotelno, type, price) Booking (Hotelno, Guestno, datafrom, dateto, Roomno) Guest (Guestno, Guestname, address) Represent the following using SQL i) List the details of all the guests staying at Grosvenor hotel whose name begins with the letter C ii) Increase the price of all double rooms by 5% iii) Insert a new guest into the database assuming the values for required fields suitably. iv) Delete the details of all the guests who have booked single room at Grosvenor hotel. v) Create a view containing hotel name and names of the guests staying at the hotel. 54. Consider the following database: Sailors (sid, name rating, age) Boats (bid, bname, colour) Reserves (sid, bid, date) Answer the following using SQL i) Find the names of the sailors reserved for the boat number 500 ii) Find the names of the sailors reserved green boat iii) Find the sailor having highest rating iv) Delete all the sailors with rating less than 10 v) Update the rating of sailor with sid = 500 to 900 55. Consider the following database: PERSON (driver-id, name, address) CAR (Regno, model, year) ACCIDENT (report number, date, location) OWNS (driver-id, Regno) PARTICIPATED (driver-id, Regno, report number, damageamt) Answer the following using SQL queries i) Update the damage amount for the car with a specific Regno in the accident with report number 12 to 25000 ii) Find the total number of people who owned cars that were involved in accident in 2002 iii) Find the number of accidents in which cars belonging to a specific model were involved. 56. Consider the following database: Master(Product-number, name, quantity-in-stock, price, re-order level) Customer (Customer-number, name, address, product-number, quantity-bought) Answer the following using SQL i) Get the names and the quantities in stock of all the products ii) whose quantity bought is more than 100 units iii) List all the products with quantities and prices purchased by iv) particular customer v) List all the customers who have purchased a particular part vi) List of parts whose stock is less than or equal to the reorder level 57. Explain with example, the following SQL commands: i) CREATE both view and table ii) ALTER both add and modify iii) SELECT Group-by, having apart from FROM and WHERE. 58. What are views? Illustrate the problems encountered in modifying the database through views.
26
Course Outline
Semester: III
59. Consider the following schema Suppliers (Sid, Sname, Saddress, Sphone, Sphone) Parts (Pid, Pname, Pcolor, Price, ) Supplies (Sid, Pid, Qty) The key fields are underlined. Write the following queries in relational algebra i) Find the names of suppliers who supply part 214. ii) Find the names and addresses of suppliers who supply part NUTS. iii) Find the names and phone numbers of suppliers who supply some blue part. iv) Find the names of suppliers who supply every red part. v) Find the names of suppliers who supply every part. Chapter 5: Database Design Objective: This chapter encompasses different types of dependencies and normal forms for relations. 60. What is normalization? Discuss the various normal forms with example. 61. What are the objectives of normalization? 62. Why nulls are considered bad in a relation? 63. Define functional dependency. Briefly explain the six rules for functional dependency. 64. Explain normalization in Relational database design. Define I, II, III and B-C normal forms. 65. Write short notes on: a) First Normal Form b) Second Normal Form c) Third Normal Form Chapter 8: Overview of Transaction Management Objective: Here, the concepts of transactions, concurrency, problems associated with the concurrent execution of the transactions and the various schemes used to resolved them are presented 66. Describe the shadow-paging recovery technique with an example. 67. Describe two phase locking protocol 68. Explain the database recovery technique based on deferred update. 69. Define the terms: a) Serializable schedule b) Recoverable schedule 70. What is a transaction? In what ways is it different from an ordinary program? 71. Describe concurrency control. 72. Describe the anomalies due to interleaved executions in terms of two transactions T1 and T2. 73. What are the ACID properties? Define each term with example. 74. How is the log used in transaction rollback and crash recovery? 75. What is the phantom problem? What impact does it have on performance? 76. What is thrashing? What should a DBA do if the system thrashes? 77. Explain various types of integrity and security constraints with examples. 78. Discuss: Data protection, Database Security, Integrity in database
27
Course Outline
Semester: III
OPERATING SYSTEMS
Subject Code : 10MCA35 Faculty : Ms. UMA Overview
Operating system is the most important type of system software in a computer system. Without an operating system, a user cannot run an application program on their computer. Operating systems are found on almost any device that contains a computer from cellular phones and video game consoles to supercomputers and web servers. A course on operating system provides an overview which includes Introduction to Operating System, Process Management, CPU Scheduling, Process Synchronization, Deadlocks, Storage Management, Memory Management, Virtual Memory, File system, Mass Storage Structure, Protection and Security and a case study about Linux Operating System. % of portion covered Referenc Sl. Cumulativ Chapter # Topics to be covered e No e Chapter What operating systems do, Computer 1 System organization, computer system CHAPTER 1: architecture Operating System structure; Operating 2 Introductio System operations, Process management Memory management; Storage management, n to 3 Protection and security, Distributed system; operating Special-purpose systems system, 11.54 11.54 System Computing environments, Operating System Structures Services, User - Operating System interface; 4 System calls, Types of system calls; System Page #: programs T1: 3 - 68 Operating System design and 5 implementation; Operating System structure, Virtual machines; Operating System 6 generation; System boot Process concept, Process Scheduling 7 CHAPTER 2: 8 Operation on Processes 9 10 11 12 13 14 15 16 17 18 19 Process Management Page #: T1: 79 99 T1: 123 139 T1: 149 -170 CHAPTER 3: Process Synchroniza tion Page #: Inter-process Communication Multi-Threaded Programming: Overview, Multithreading models, Thread Libraries, Threading issues Process Scheduling: Basic concepts, Scheduling Criteria Scheduling Algorithms Scheduling Algorithms Multiple Processor Scheduling ,Thread Scheduling Synchronization: The Critical Section Problem, Petersons solutions, Synchronization Hardware, Semaphores Classical Problems of Synchronization
17.31
28.85
13.46
42.31
28
Course Outline
20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 T1: 189 -213
Semester: III
Classical Problems of Synchronization Classical Problems of Synchronization Monitors
CHAPTER 4: Deadlocks Page #: T1:237-259 CHAPTER 5: Memory Managemen t Page #: T1: 265-295 T1: 303-335 CHAPTER 6: File System, Implementa tion of File System Page #: T1: 359-391 T1:395-415 CHAPTER 7: Secondary Storage Structures, Protection Page #: T1: 435451 T1: 595-613 CHAPTER 8: Case Study: The Linux Operating System Page #: T1: 713-750
Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks; Deadlock Prevention Deadlock Avoidance Deadlock Avoidance Deadlock detection, Recovery from Deadlock Memory Management strategies: Background, Swapping, Contiguous Memory Allocation Paging Structure of the page table, Segmentation Virtual Memory Management: Background, Demand Paging Copy on write, Page Replacement Page Replacement (continued) Allocation of Frames, Thrashing File System: File Concept, Access Methods, Directory Structure File system mounting, File sharing, Protection File system structure, File system implementation Directory Implementation, Allocation Methods Free space management Mass Storage Structures: Disk Structure, Disk Attachment Disk Scheduling Disk management, Swap space management Protection: Goals of protection, Principles of Protection, Domain of protection Access matrix, Implementation of access matrix Access Control, Revocation of access rights, Capability-Based systems Linux History, Design principles, Kernel modules Process management, Scheduling Memory management File systems Input and Output, Inter-process communication
9.62
51.93
15.37
67.30
11.54
78.84
11.54
90.38
9.62
100
29
Course Outline
LITERATURE Book Type Text Book Reference Book Reference Book Reference Book Code
Semester: III

Publication Information Publishe Edition Year r Eighth Edition WileyIndia Tata McGrawHill PHI Pearson Education 2009
Title and Author Operating System Principles: A. Silberschatz, P. Galvin, G. Gagne Operating Systems-A Concept based Approach: D.M. Dhamdhere Introduction to Operating systems- Concepts and Practice: P.C.P Bhatt Operating Systems: Harvey M Deital
T1
R1
Second Edition
2002
R2 R3
Second Edition Third Edition
2008 1990
Test Syllabus Test 1: Chapters 1, 2, 3 Test 2: Chapters, 3, 4, 5 Test 3: Chapters 6, 7, 8 QUESTION BANK Chapter 1: Introduction to operating system, System Structures Objective: This chapter gives an introduction about the operating system, how they are designed and constructed. The common features of an operating system are discussed. 1. 2. 3. 4. What is an operating system? What are the functionalities of an OS? Explain various components of an OS. What are the services provided by an OS? Explain the following types of OS: (i) Batch (ii) RealTime (iii) TimeSharing (iv) Distributed systems (v) Multimedia systems 5. Briefly explain the layered approach to the structuring of an OS. 6. Discuss the need for an operating system. 7. What is Multiprogramming? What are the main advantages of multiprogramming? 8. Differentiate between multiprogramming and time sharing. 9. List the operating system components. 10. What is a thread? Mention the benefits of multithreaded programming. 11. Discuss the microkernel briefly. 12. Explain the following: i) Tightly coupled system ii) Loosely coupled system 13. Explain the following: i) Multiprocessor Systems ii) Clustered Systems 14. What are system calls? Explain. 15. What is virtual machine? Explain VMware architecture? Chapter 2: Process Management Objective: This chapter describes the process concept and concurrency of modern operating systems. Topics under this chapter also cover methods for process scheduling and interprocess communication. 16. What is a process? With the help of a diagram, explain the different states of a process.
30
Course Outline
Semester: III
17. Explain the process control block , in detail. 18. What is CPU Scheduling? What is the difference between preemptive and nonpreemptive scheduling? 19. What are the various reasons for allowing concurrent execution of processes? 20. What is thread? Explain the concept of multithreading and their various models. 21. Discuss the benefits of multithreaded programming. 22. What is CPU Scheduling? 23. What is a scheduler? Explain different types of schedulers. 24. Explain the different criteria to select a scheduling algorithm. 25. Explain First Come First Serve Scheduling Algorithm. 26. Explain Shortest Job First Scheduling Algorithm. 27. Explain Round Robin Scheduling Algorithm. 28. Explain Priority Scheduling Algorithm. 29. Explain multilevel queue scheduling and multilevel feedback queue scheduling with illustration. 30. Differentiate between direct communication and indirect communication. 31. Describe the use of mailboxes in inter process communication 32. Explain the concept of messages with reference to inter process communication. 33. 5 batch jobs A, B, C, D, E arrive at a computer center at almost the same time. They have estimated running times of 10,6,2,4 and 8 seconds. Their priorities are 3,5,2,1 and 4 respectively. For each of the following draw Gantt Chart and compute turnaround time. (i) RR (Quantum time 1 sec) (ii) FCFS (iii) Priority (iv) SJF 34. What is context switching? Explain process context switching with process state diagram. Also discuss short term and long term scheduler. 35. Describe some of the CPU scheduling algorithm evaluation methods. 36. Consider the following set of processes, which have arrived at the ready queue with the burst time and the arrival time given in milliseconds as shown below: Burst Time Arrival Time in in milliseconds milliseconds P1 8 0 P2 4 1 P3 9 2 P4 5 3 Draw the Gantt chart and calculate the average waiting time using the following algorithms (I) First Come First Serve (FCFS) (II) Shortest Job First (SJF - pre-emptive). 37. Consider the following set of processes: Processes Burst Time Priority P1 8 3 P2 5 1 P3 12 2 P4 4 4 The processes are assumed to have arrived in the order P1, P2, P3, P4 all at time 0. Obtain the Gantt chart, average waiting time using (I) First Come First Serve (II) Non Pre-emptive Shortest Job First (III) Non Pre-emptive priority-scheduling schemes. 38. Consider the following processes which have arrived the ready queue with the burst time and the arrival time given in milliseconds as shown Process Burst time Arrival time in in milliseconds milliseconds Processes
31
Course Outline
Semester: III
P1 8 0 P2 4 1 P3 9 2 P4 5 3 Construct the Gantt chart and calculate the average waiting time using the FCFS and SJF (preemptive). 39. Consider the following set of processes, with the length of the CPU burst given in milliseconds. Process Burst Priority Arrival time time P1 10 4 0 P2 12 3 2 P3 14 5 3 P4 16 1 6 PS 5 1 30 i) Draw a Gantt chart that illustrates the execution of these processes using the preemptive priority scheduling algorithm (a smaller priority number implies a higher priority). ii) Calculate the average waiting time. 40. Suppose the following jobs arrive for processing at the times indicated, each job will run the listed amount of time. Job Arrival time Burst time 1 0 10 2 1 15 3 2 17 4 3 20 i) Give a Gantt chart illustrating the execution of these jobs using the pre-emptive and non-preemptive SJF scheduling algorithms. ii) What is avg. waiting time of jobs for the above algorithms? What is your conclusion? 41. Consider the following set of processes : Processes Burst Time Priority P1 6 3 P2 4 1 P3 10 2 P4 3 4 The processes have arrived in the order P1, P3, P2 and P4. Obtain the Gantt chart, waiting time using (i) SJF (ii) Pre-emptive priority-scheduling schemes. Chapter 3: Process Synchronization Objective: This chapter discusses the various mechanisms to ensure the orderly execution of processes that share a logical address space, so that data consistency is maintained. Various methods of process synchronization are discussed. 42. What do you mean by semaphore? How do you access a semaphore? 43. What is a semaphore? Explain the role of semaphores in solving mutual exclusion problem. 44. Define critical section problem and explain the requirements to be met by a solution to the critical section problem. 45. Discuss any two classic problems of synchronization. 46. Explain the following terms: i) Mutex ii) Race condition 47. Explain the Readers-Writers problem in detail. 48. Explain Dining-Philosophers problem and its solution.
32
Course Outline
Semester: III
49. Define the bounded buffer problem and its solution. 50. List out the properties and characteristics of semaphores. 51. Give a solution to n-process critical section problem using Test-and-set and show its correctness. Chapter 4: Deadlocks Objective: This chapter discusses about the deadlocks, various conditions necessary for deadlock and different methods that an operating system can use to prevent or deal with deadlocks. 52. What is deadlock? Explain four necessary conditions for a deadlock. 53. List different methods for handling deadlock. Explain deadlock prevention in detail. 54. What is a safe state in a system? 55. Explain in detail with neat diagrams the resource allocation graph technique to detect deadlock in a system. 56. What is a deadlock? Describe the necessary conditions for a dead lock. Explain how deadlock can be prevented. 57. What is racing and deadlock? Why do they occur? 58. Consider the following snapshot of a system: Allocation Request Available A B C A P0 0 1 0 1 P1 1 2 1 2 P2 2 3 0 1 P3 0 1 1 1 a. What is the content of need matrix? B 0 2 2 4 C 1 1 3 3 A 1 B 0 C 2
b. Is the system in SAFE state? If so, give the safe sequence. 59. Consider the following snapshot of a system: Allocation Max Available A B C A B C A B C P0 0 1 0 7 5 3 3 3 2 P1 2 0 0 3 2 2 P2 3 0 2 9 0 2 P3 2 1 1 2 2 2 P4 0 0 2 4 3 3 Answer the following questions using Bankers algorithms a. Construct a need matrix. b. Is the system in SAFE state? If so, give the safe sequence. 60. With an example, illustrate Bankers Algorithm for Dead lock avoidance. Explain briefly about the deadlock avoidance.
Chapter 5: Memory Management Objective: This chapter deals with main memory management during the execution of a process. The different memory management schemes such as paging and segmentation are discussed. 61. Explain the following with respect to memory management: i) First Fit ii) Best Fit iii) Worst Fit
33
Course Outline
Semester: III
62. Bring out the difference between internal and external fragmentation. 63. What is page fault? What action does the operating system take when a page fault occurs? 64. Explain paging with illustration. 65. Explain paging with demand scheme in handling virtual memory and how it handles memory requests. 66. Define the structure of a page table. 67. Explain the following: i) Hierarchical paging ii) Inverted page table 68. Explain segmentation illustrating segmentation hardware. 69. Explain the concept of virtual memory. 70. Explain an implementation of LRU replacement policy. 71. When do page faults occur? 72. Discuss the steps in handling a page fault with the help of a neat diagram. 73. Explain the following page replacement algorithms. (i) FIFO page replacement (ii) Optimal page replacement 74. Show how Translation Look aside Buffer (TLB) improves the performance of paged system. 75. Discuss demand paging. Explain copy-on-write. 76. For the following reference string 1, 6, 2, 4, 3, 1, 2, 5, 6, 5, 1, 2, 3, 7, 3, 2, 1, 6, 4 How many page faults would occur for the page replacement algorithms: LRU, FIFO and Optimal. Trace these algorithms for 3 frames. What is your comment on these algorithms? 77. Consider following reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 How many page faults would occur for the page replacement algorithms LRU, FIFO and Optimal. Trace these algorithms for 3 frames. Note that initially all the frames are empty. 78. What is fragmentation? List the schemes for minimizing fragmentation. 79. Write short notes on Thrashing. Chapter 6: File System, Implementation of File System Objective: This chapter describe how the file system, mass storage and I/O are handled in a modern computer system. 80. What is acyclic graph directory structure? Explain with example. Explain the following: i) File Operations ii) Files Types iii) File attributes 81. Explain different file access method. 82. What is access matrix? How is access matrix implemented? 83. Write a note on: (i) Sequential Access (ii) Direct Access 84. Write a note on: (i) Single-level directory (ii) Two-level directory iii) Tree-structured directories iv) Acyclic-Graph directories 85. What is a mount point? How a file is mounted and unmounted? 86. Discuss disk free space management. 87. Discuss directory implementation using: (i) Linear list (ii) Hash table 88. Describe the variable partition scheme with the allocation policiesfirst fit, best fit and worst fit. Mention a disadvantage of best fit. 89. Explain the different disk space allocation methods and compare them.
34
Course Outline
Semester: III
90. Name the different file allocation methods. Explain the linked allocation method giving merits and demerits. Chapter 7: Secondary Storage Structures, Protection Objective: This chapter discusses access to data and programs residing on the disks. It also discusses how the processes in an operating system are protected from one anothers activities. It also discusses the mechanism for controlling the access of programs, processes or users to the resources defined by a computer system. 91. What is disk scheduling? Explain FCFS disk scheduling algorithm. 92. Briefly explain the following disk scheduling policies and compare them : (i) FCFS (II) SSTF (III) SCAN 93. Show that SCAN scheduling is not starvation free. 94. Compare SCAN and C-SCAN disk scheduling policies. 95. Compare LOOK and C-LOOK disk scheduling policies. 96. Write short note on: i) Rotational Latency ii) Swap Space Management 97. Suppose that a disk drive has 200 cylinders numbered 0 to 199. the disk is currently serving a request at cylinder 53, and previous request was at cylinder 65. The queue of pending requests in FIFO order is 98, 183, 37, 122, 14, 124, 65, 67. What is the total distance (in cylinders) that the disk arm move to satisfy all the pending requests for each of the below disk scheduling algorithms? Explain each with neat diagram. i) FCFS ii) SSTF iii) SCAN 98. Explain the following. i) Boot Block ii) Bad Block 99. Differentiate between protection and security in the file system, Explain access matrix implementation. 100. What is meant by denial of service? 101. What is authentication? Explain any two approaches for authentication. 102. What are the goals of protection? 103. Explain capability-based system with an example. 104. What is protection concept in OS, explain its Domain & Domain Structure? 105. What is access matrix? Explain with neat figure. Explain any one of the implementation method of access matrix. 106. Write short notes on the following: i) Fragmentation ii) Swap space management. iii) Global table implementation of access matrix. Chapter 8: Case Study: The Linux Operating System Objective: This chapter presents an in-depth examination of the linux operating system. It discuss the internal methods by which Linux implements the interfaces. 107. 108. 109. 110. 111. 112. With a diagram explain the components of the Linux system. Discuss various kernel modules in Linux. Explain process management and process scheduling in Linux operating system. Explain memory management and File systems in Linux operating system. Explain Interprocess communication in Linux operating system. Explain Input-Output in Linux operating system.
35
Course Outline
Semester: III
SYSTEM SOFTWARE LAB
Sub. Code: 10MCA36 PART A
Hours/Week: 03
1. Program to count the number of vowels & consonants in a given string 2. Program to count the number of characters, words, spaces & lines in a given input file 3. Program to count number of a) positive & negative integers b) positive & negative fractions 4. Program to count the numbers of comment lines in a given C program. Also eliminate them & copy that program into separate file. 5. Program to count the number of scanf and printf statements in a C program. Replace them with readf & writef statements respectively. 6. Program to recognize a valid arithmetic expression & identify the identifiers & operators present. print them separately. 7. Program to recognize & count the number of identifiers in a given input file.
PART-B
1. Program to test the validity of a simple expression involving operators +,-,* and /. 2. Program to recognize nested IF control statements & display the number of levels of nesting. 3. Program to recognize a valid arithmetic expression that uses operators +,-,* and /. 4. Program to recognize a valid variable, which starts with a letter, followed by any number of letters or digits. 5. Program to evaluate an arithmetic expression involving operators +,-,* and /. 6. Program to recognize strings aaab,abbb,ab and a using the grammar. (a^nb^n, n>=0) 7. Program to recognize the grammar (a^n b, n>=10).
36
Course Outline
Semester: III
Java Programming Laboratory

Subject Code: 10MCA37 Hours/Week: 3
1. a. Write a JAVA Program to demonstrate Constructor Overloading and Method overloading. b. Write a JAVA Program to implement Inner class and demonstrate its Access Protections. 2. a. Write a JAVA Program to demonstrate Inheritance. b. Write a JAVA Program to demonstrate Exception Handling (Using Nested try catch and finally). 3. Write a JAVA program which has i. A Class called Account that creates account with 500Rs minimum balance, a deposit() method to deposit amount, 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. ii. A Class called LessBalanceException which returns the statement that says withdraw amount (___Rs) is not valid. iii. A Class which creates 2 accounts, both account deposit money and one account tries to withdraw more money which generates a LessBalanceException take appropriate action for the same. 4. Write a JAVA program using Synchronized Threads, which demonstrates Producer Consumer concept. 5. Write a JAVA program which has i. A Interface class for Stack Operations ii. A Class that implements the Stack Interface and creates a fixed length Stack. iii. A Class that implements the Stack Interface and creates a Dynamic length Stack. iv. A Class that uses both the above Stacks through Interface reference and does the Stack operations that demonstrates the runtime binding. 6. Write a JAVA program which has i. 2 classes which initializes a String in its constructor ii. A Generic class with 2 type Parameters iii. Create a Generic Class reference for t he above 2 Class and try to print the message inside the constructor (Use to string method). 7. Write JAVA programs which demonstrates utilities of LinkedList Class 8. Write a JAVA Program which uses FileInputStream / FileOutPutStream Classes. 9. Write a JAVA Program which writes a object to a file (use transient variable also). 10. Write a JAVA program which uses Datagram Socket for Client Server Communication. 11. Write JAVA Applet programs which handles MouseEvent 12. Write JAVA Applet programs which handles KeyBoardEvent 13. Write a JAVA program which implements RMI. 14. Write a Swing Application which uses i. JTabbed Pane ii. Each Tab should use JPanel, which includes any one component given below in each Panel iii. ComboBox / List / Tree / Radiobutton Note: All the above Components should Listen to any one of their respective events and print appropriate message.
37
Course Outline
Semester: III DBMS LABORATORY
Subject Code: 07MCA38
Hours/Week: 03
I. Consider the following relations: Student (snum: integer, sname: string, major: string, level: string, age: integer) Class (name: string, meets at: string, room: string, d: integer) Enrolled (snum: integer, cname: string) Faculty (fid: integer, fname: string, deptid: integer) The meaning of these relations is straightforward; for example, Enrolled has one record per student-class pair such that the student is enrolled in the class. Level is a two character code with 4 different values (example: Junior: JR etc) Write the following queries in SQL. No duplicates should be printed in any of the answers. i. Find the names of all Juniors (level = JR) who are enrolled in a class taught by Prof. Harshith ii. Find the names of all classes that either meet in room R128 or have five or more Students enrolled. iii. Find the names of all students who are enrolled in two classes that meet at the same time. iv. Find the names of faculty members who teach in every room in which some class is taught. v. Find the names of faculty members for whom the combined enrollment of the courses that they teach is less than five. II. The following relations keep track of airline flight information: Flights (no: integer, from: string, to: string, distance: integer, Departs: time, arrives: time, price: real) Aircraft (aid: integer, aname: string, cruisingrange: integer) Certified (eid: integer, aid: integer) Employees (eid: integer, ename: string, salary: integer) Note that the Employees relation describes pilots and other kinds of employees as well; Every pilot is certified for some aircraft, and only pilots are certified to fly. Write each of the following queries in SQL. i. Find the names of aircraft such that all pilots certified to operate them have salaries more than Rs.80,000. ii. For each pilot who is certified for more than three aircrafts, find the eid and the maximum cruisingrange of the aircraft for which she or he is certified. iii. Find the names of pilots whose salary is less than the price of the cheapest route from Bengaluru to Frankfurt. iv. For all aircraft with cruisingrange over 1000 Kms, Find the name of the aircraft and the average salary of all pilots certified for this aircraft. v. Find the names of pilots certified for some Boeing aircraft. vi. Find the aids of all aircraft that can be used on routes from Bengaluru to New Delhi III. Consider the following database of student enrollment in courses & books adopted for each course. STUDENT (regno: string, name: string, major: string, bdate: date) COURSE (course#: int, cname: string, dept: string) ENROLL (regno: string, course#: int, sem: int, marks: int)
38
Course Outline
Semester: III
BOOK_ADOPTION (course#: int, sem: int, book-ISBN: int) TEXT (book-ISBN: int, book-title: string, publisher: string, author: string) i. Create the above tables by properly specifying the primary keys and the foreign keys. ii. Enter at least five tuples for each relation. iii. Demonstrate how you add a new text book to the database and make this book be adopted by some department. iv. Produce a list of text books (include course#, book-ISBN, book-title) in the alphabetical order for courses offered by the CS department that use more than two books. v. List any department that has all its adopted books published by a specific publisher. vi. Generate suitable reports vii. Create suitable front ends for querying and displaying the results. IV. The following tables are maintained by a book dealer. AUTHOR (author-id: int, name: string, city: string, country: string) PUBLISHER (publisher-id: int, name: string, city: string, country: string) CATALOG (book-id: int, title: string, author-id: int, publisher-id: int, category-id: int, year: int, price: int) CATEGORY (category-id: int, description: string) ORDER-DETAILS (order-no: int, book-id: int, quantity: int) i. Create the above tables by properly specifying the primary keys and the foreign keys. ii. Enter at least five tuples for each relation. iii. Give the details of the authors who have two 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. iv. Find the author of the book which has maximum sales. v. Demonstrate how you increase the price of books published by a specific publisher by 10%. vi. Generate suitable reports vii. Create suitable front ends for querying and displaying the results. V. Consider the following database for a banking enterprise. BRANCH (branch-name: string, branch-city: string, assets: real) ACCOUNT (accno: int, branch-name: string, balance: real) DEPOSITOR (customer-name: string, accno: int) CUSTOMER (customer-name: string, customer-street: string, customer-city: string) LOAN (loan-number: int, branch-name: string, amount: real) BORROWER (customer-name: string, loan-number: int) (i) Create the above tables by properly specifying the primary keys and the foreign keys. (ii) Enter at least five tuples for each relation. (iii) Find all the customers who have at least two accounts at the main branch. (iv) Find all the customers who have an account at all the branches located in a specific city. (v) Demonstrate how you delete all account tuples at every branch located in a specific city. (vi) Generate suitable reports (vii) Create suitable front ends for querying and displaying the results. Instructions: 1. The exercises are to be solved in an RDBMS environment like Oracle or DB2. 2. Suitable tuples have to be entered so that queries are executed correctly. 3. Front end may be created using either VB or VJ or any other similar tool.
39
Course Outline
Semester: III
4. The student need not create the front end in the examination. The results of the queries may be displayed directly. 5. Relevant queries other than the ones listed along with the exercises may be asked in the examination. 6. Questions must be asked based on lots.
40

III Sem CourseInfo 2011 With Questions

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

III Sem CourseInfo 2011 With Questions

Uploaded by

Copyright:

Available Formats

Course Outline

Session: Aug-Nov 2011

________________________________________________________________________ Perseverance Excellence Service

Session: Aug-Nov 2011

10MCA38 DBMS Laboratory Total

________________________________________________________________________ Perseverance Excellence Service

Semester: III SYSTEMS SOFTWARE

Session: Aug-Nov 2011

Subject Code Faculty

Hours / Week: 04 Total Hours: 52

% of portions covered Reference Cumulative Chapter

Chapter #: 2.0 & 3.0

Assemblers except 2.5.2 &2.5.3

________________________________________________________________________ Perseverance Excellence Service

Session: Aug-Nov 2011

________________________________________________________________________ Perseverance Excellence Service

Session: Aug-Nov 2011

Chapter 1 Machine Architecture

________________________________________________________________________ Perseverance Excellence Service

Session: Aug-Nov 2011

Chapter 2 & 3 Assemblers

________________________________________________________________________ Perseverance Excellence Service

Session: Aug-Nov 2011

Chapter 4 Loaders and Linkers

Chapter 5 Editors And Debugging Systems

________________________________________________________________________ Perseverance Excellence Service

Semester: III Chapter 7 Lex & Yacc

Session: Aug-Nov 2011

________________________________________________________________________ Perseverance Excellence Service

Session: Aug-Nov 2011

Subject Code Faculty Overview:

: 10MCA32 : Mrs. VEENA.S

Hours / Week: 04 Total Hours: 52

CHAPTER 2: Direct link networks T 1: Page #:64-147

CHAPTER 3: Packet switching T 1: Page #:166-194

________________________________________________________________________ Perseverance Excellence Service

Session: Aug-Nov 2011

Test Syllabus Test 1: Class # 1 - 17 Test 2: Class # 18 - 35 Test 3: Class # 36 - 52

________________________________________________________________________ Perseverance Excellence Service

Session: Aug-Nov 2011

Publication Information Publisher Year Morgan kaufmann Pearson education 2007

Reference Book Reference Book Reference Book

Pearson education Tata McGraw-Hill Tata McGraw-Hill

________________________________________________________________________ Perseverance Excellence Service

Session: Aug-Nov 2011

________________________________________________________________________ Perseverance Excellence Service

Session: Aug-Nov 2011

________________________________________________________________________ Perseverance Excellence Service

Session: Aug-Nov 2011

PROGRAMMING WITH JAVA

5 Unit 1 An overview Of JAVA And Unit 2 Introducing Classes

________________________________________________________________________ Perseverance Excellence Service

Session: Aug-Nov 2011

20 21 22 23 24 Unit 4 Multithreaded Programming

Unit 5 Enumeration, Autoboxing

________________________________________________________________________ Perseverance Excellence Service

Session: Aug-Nov 2011

32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 Unit 7 Networking Unit 6 Exploring Java.lang :

Unit 8 The Applet Class

________________________________________________________________________ Perseverance Excellence Service

Session: Aug-Nov 2011

Publication Specification Edition Publication Year

Question Bank CHAPTER 1: An overview of JAVA