III Sem CourseInfo 2011 With Questions

7/28/2019 III Sem CourseInfo 2011 With Questions

1/40

Course Outline Semester: III Session: Aug-Nov 2011

________________________________________________________________________Perseverance Excellence Service

1

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 thedepartment and maintain affable personality.

6. Students are to maintain absolute discipline and decorum, so as to promote the fairname of their college in all its activities.

7. Students having less than 85% attendance in any subject (both theory andpractical) 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 collegeauthorities at regular intervals.

10.Writing on desks and walls is strictly prohibited, failing which the students will befined a minimum of Rs.500. If the identity of the individual is not established theentire class will be fined ranging from Rs.100 to Rs.500.

11.Attendance of the students will be displayed on the departmental notice board aswell as available in the web site at the end of the 7th, 11th and 16th week of thesemester (w.e.f Aug 1, 2011) along with the list of the students having shortage inattendance.

12.Students should bring the observation book as well as the laboratory record bookcompleted in all respect to the laboratory.

13.Take the print outs of the source listing and output of the code after executionand delete your files.

14.Students are not supposed to alter the configuration of the system / any softwareon 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.


2/40



2

Sl. No Sub. Code SUBJECT Marks Total PAGE#IA UE

1 10MCA31 Systems Software 50 100 150 3 - 7

2 10MCA32 Computer Networks 50 100 150 8-12

3 10MCA33 Programming withJava

50 100 150 13-17

4 10MCA34DatabaseManagement Systems

50 100 150 18-28

5 10MCA35 Operating Systems 50 100 150 29-34

6 10MCA36

SystemsProgrammingLaboratory

50 50 100 35

7 10MCA37Java ProgrammingLaboratory

50 50 100 36-37

8 10MCA38 DBMS Laboratory 50 50 100 38-39

Total 400 650 1050

TIME TABLE

Day/ Time8.15-9.15

9.15-10.15

10.15-10.45

10.45-11.45

11.45-12.45

12.45-1.30

1.30-

2.30

2.30-3.30

Monday

Tea

Break

LunchB

reak

Tuesday

Wednesday

Thursday

Friday

Class Teachers

III A: L.Meena

III B: Meera Rajan


3/40



3

SYSTEMS SOFTWARE

Subject Code : 10MCA31 Hours / Week: 04Faculty : L. Meena 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 majortopics covered here are assemblers, loaders and linkers, etc.

It also describes the real machines that are used as examples throughout thecourse. These machines have contrasting architectures and were chosen as examples inorder to illustrate the variety in software and hardware systems.

Class#

Chapter #Topic to be covered

% of portions covered

ReferenceChapter

Cumulative

1. Chapter #:1.0

MachineArchitecture

1.1 to 1.3

Introduction, System Software andMachine Architecture

12% 12%

2. SIC Machine Architecture3. SIC/XE Machine Architecture4. SIC Programming Examples5. SIC/XE Programming Examples6. SIC/XE Programming Examples7.

Chapter #:2.0 & 3.0

Assemblers

except 2.5.2&2.5.3

Basic Assembler Function A Simple SICAssembler

27% 39%

8. Assembler Algorithm and Data Structures9. Assembler Algorithm and Data Structures10. Machine Dependent Assembler Features

Instruction Formats & Addressing Modes

11. Machine Dependent Assembler Features Instruction Formats & Addressing Modes

12. Machine Dependent Assembler Features Instruction Formats & Addressing Modes

13. Program Relocation14. Machine Independent Assembler Features

Literals

15. Symbol Definition Statements,Expression

16. Program Blocks17. Control Sections and ProgrammingLinking18. Assembler Design Operations One Pass

Assembler

19. Multi-Pass Assembler20. Implementation Examples MASM

Assembler


4/40



4

21.Chapter #:4.0

Loaders AndLinkers

Except 4.4.3

Chapter#:5.0Editors AndDebuggingSystems

Except 5.5

Basic Loader Functions - Design of anAbsolute Loader

13%52%

22. A Simple Bootstrap Loader23. Relocation, Program Linking24. Algorithm and Data Structures for a

Linking Loader

25.Automatic Library Search, Loader

Options, Loader Design Options, LinkageEditor, Dynamic Linkage

26. Bootstrap Loaders27. Implementation ex: MS-DOS Linker

10% 62%

28. Text Editors Overview of EditingProcess, User Interface

29. Editor Structure, Interactive DebuggingSystems

30. Debugging Functions and Capabilities31. Relationship with other parts of the

system

32. User-Interface Criteria

33.Chapter #:

6.0

MacroProcessors

Basic Macro Processor Functions MacroDefinitions and Expansion

13% 75%

34. Macro Processor Algorithm and DataStructures

35. Concatenation of Macro parameters,Generation of Unique Labels

36. Conditional Macro Expansion, KeywordMacro Parameters

37. Macro Processor Design Options Recursive Macro Expansion, General-Purpose Macro Processors

38. Macro Processing within LanguageTranslators

39. Implementation examples MASM MacroProcessor, ANSI C Macro Processor

40.

Chapter #:7.0

Lex & Yacc -1 & 2

Chapters1,2(2-42),3(51-65)

Basic Compiler Function Grammars,Lexical Analysis, Syntactic Analysis, CodeGeneration

25% 100%

41. Lex and Yacc The Simplest LexProgram, Recognizing words with LEX

42. Symbol Tables, Grammars43. Parser-Lexer communication, The parts

of speech, Lexer

44. A YACC Parser, The Rules Section45. A word counting program, Parsing a

command line

46. Using YACC Grammars, Recursive rules47. Shift/Reduce parsing, What YACC Cannot

parse

48. A YACC Parser The definition section.The rules section, symbol values andactions


5/40



5

Test Syllabus

Test 1: Chapters 1, 7Test 2: Chapters 2, 3, 4Test 3: Chapters 5, 6,

LITERATURE:

BookType

Code Title and AuthorPublication Information

Edition Publisher Year

TextBook

T1System SoftwareBy Leland. L. Beck

3rdAddison-Wesley

2004

Text

BookT2

Lex and Yacc

By John. R. Levine and Tony MasonOReilly,SPD 1999

Reference Book

R1Systems Programming and

Operating SystemsBy D. M. Dhamdhere

2nd TMH 1999

QUESTION BANK

Chapter 1Machine Architecture

Objective:

Gives a description of the Simplified Instructional Computer(SIC) that is used topresent 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 portionof 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 BETAand GAMMA.

49. The LEXER, Compiling and running asimple parser

50. Arithmetic expressions and ambiguity,variables and typed tokens.

51. problems52. problems


6/40



6

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 thatwill 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 0BEGIN CLEAR X OPCODE

CLEAR A CLEAR B4+LDS #4096 LDS 6C

LOOP ADD TABLE, X ADD 18TIXR S TIXR B8JLT LOOP JLT 38+STA TOTAL STA 0CRSUB RSUB 4C

TABLE RESW 4096TOTAL RESW 1END 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


7/40



7

Chapter 4

Loaders and LinkersObjective:

This chapter objective is to discuss basic loader functions, introducing machine-

dependent 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 diagramloading and calling of a subroutine using dynamic linking.

Chapter 5

Editors And Debugging SystemsObjective:

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, Machine-independent 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 anexample?

25. Write an algorithm for one-pass macro processor.


8/40



8

Chapter 7

Lex & YaccObjective:

The objective of this is to study about the two phases of compiler. Discusses about regularexpressions, grammars and the structure of lex and yacc program.

26. Explain YACC parser with example. Write a lex program to find the number ofvowels and consonants in a given sentence.

27. Explain the structure of a LEX program. Write a LEX program to count number ofpositive 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 typicalprogramming language.


9/40



9

COMPUTER NETWORKS

Subject Code : 10MCA32 Hours / Week: 04Faculty : Mrs. VEENA.S Total Hours: 52

Overview: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 todestination. A computer network is a dynamic and changing area. This coursedistinguishes between what is important, what may going to be changed in future andwhat is long lasting. Emphasis is laid upon the building blocks of networks, differentnetwork technologies like Ethernet, FDDI, wireless, cell phone technology etc. It alsodeals with LANs, MANs and WANs. A detailed study of building an internetwork using theabove components and the issues related to internet work will be discussed. It also dealswith end-to-end protocols and resource allocation issues. Finally we are going to seesome of the applications like email, DNS etc.

Class # Chapter #

Topics to be covered

% of portion covered

Chapterwi

se

Cumulativ

e1

CHAPTER 1:

Foundation

T 1:Page #:1-50

Overview of the subject, Building anetwork - : applications

15% 15%

2 Requirements: connectivity

3 Cost-effective resource sharing, supportfor common services

4 Network architecture: layering andprotocol, OSI architecture

5 Internet architecture

6 Implementing network software

7 Performance: bandwidth and latency

8 Delay x bandwidth product, problems

9

CHAPTER 2:

Direct linknetworks

T 1:Page #:64-147

Physically connecting hosts: hardwareBuilding blocks: nodes

23% 38%

10 Links

11 Encoding

12 Framing

13 Error detection Two-dimensional parity,Internet checksum algorithm

14 Cyclic Redundancy Check

15 Reliable transmission - Stop and wait

16 Sliding window

17 Concurrent logical channels

18 Ethernet(802.3)

19 Rings(802.5,FDDI,RPR)

20 Wireless (802.15.1, 802.11, 802.16,Cell Phone Technologies)

21 CHAPTER 3:

Packet switchingT 1:

Page #:166-194

Switching and forwarding: Datagrams

14%52%

22 Virtual circuit switching

23 Source routing

24 Bridges and LAN switches: Learningbridges

25 Spanning tree algorithms

26 Broadcast and multicast


10/40



10

27 Limitations of bridges

28

CHAPTER 4:Internetworking

T 1:Page #:232-329

Simple internetworking: service model

23% 75%

29 Global addresses, Datagram forwarding inIP

30 ARP, DHCP

31 ICMP, Virtual networks and Tunnels

32 Routing: network as a graph

33 Distance vector(RIP)

34 Link state(OSPF)35 Metrics, routing for mobile hosts, Router

implementation

36 Global internet: - sub netting

37 Classless routing(CIDR)

38 Interdomain Routing(BGP), Routing Areas

39 IP version 6 (IPv6)

40

CHAPTER 5:

End-to-endprotocols

T 1:Page #:380 - 411,

456 - 467

Simple demultiplexer (UDP)

14% 89%

41 Reliable byte stream(TCP) : end-to-endissues, Segment format

42 Connection establishment andTermination, Sliding window revisited

43 Triggering Transmission, AdaptiveRetransmission

44 Record boundaries, TCP Extensions,Alternative Design Choices

45 Issues in Resource Allocation: networkmodel

46 Taxonomy, evaluation criteria

47

CHAPTER 6:

ApplicationsT 1:

Page #:640 -693

Application layer overview, client andserver model

11% 100%

48 DNS, Name Address mapping, DNSMessage format

49 Remote login protocols, Telnet, SSH

50 Electronic Mail (SMTP), File Transfer(FTP), World Wide Web (HTTP)

51 Overview of IP Telephony

52 VOIP signalling protocols(SIP and H.323)

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


11/40



11

LITERATURE:

Book Type Code Title and Author Publication Information


Text Book T1 Computer networks ASystems Approach - Larry LPeterson and Bruce S.

David

IVMorgan

kaufmann2007

Text Book T2 Computer andCommunication Networks Nader F. Mir

Pearsoneducation

2007

ReferenceBook

R1 Data and ComputerCommunications WilliamStallings

VIIIPearson

education2007

ReferenceBook

R2 Data Communication andNetworking - Behrouz A.Forouzan

IVTata

McGraw-Hill2006

ReferenceBook

R3 Communication Networks Fundamental Concepts and

Key Architectures - AlbertoLeon-Garcia

IITata

McGraw-Hill

2004

QUESTION BANK

Chapter 1: Foundation.

This chapter gives the general idea of Computer Networks which will be usedthroughout the course. It deals with the basic building blocks, different type ofarchitectures, need of layering and the implementation issues of computer networks.Finally we discuss how performance of networks can be measured using bandwidth andlatency.

1. Discuss the applications of Computer Networks.2. What is Multiplexing and Demultiplexing?3. What is the need for layering? What are the functions of layers?4. Define the following:

a) Bandwidth b) Latency c) Throughput d) RTT e) Jitter5. 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 sourceto destination, like Encoding, Framing, Error Detection, Reliable transmission and MediaAccess Control. It gives an insight into a variety of Networking technologies ranging fromEthernet, 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.


12/40



12

3. What is Encoding? Describe the different Encoding schemes.4. Show the 4B/5B Encoding and the resulting signal for the following bit sequence.

11100101000000115. 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 ringnetworks.19. Write and explain the collision avoidance and distribution system of wirelessnetworks.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, VirtualCircuits and Source Routing. It also gives the insight into Bridges and LAN switches.

1. Explain packet switching.2. Explain how forwarding tables can be used in datagram forwarding.3. Explain virtual circuit switching with an example.4. What is the need for spanning tree algorithm and explain the algorithm.5. Explain source routing.

6. Explain the sliding window algorithm.

Chapter 4: Internetworking.

This chapter introduces the issues related to the network of networks the globalInternet. It Explains the nature of the basic internet protocol IPv4. It deals with theglobal addressing problem and scalability issues. Finally it introduces the alternative toIPv4, 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.


13/40



13

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 followingaddress 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 DatagramProtocol (UDP) and Transmission Control Protocol (TCP) in detail. It also provides aninsight into the issues in Resource allocation.

1. Explain the TCP header format along with the field specifications.2. Explain Three way Handshake algorithm used in TCP.3. What is meant by sillt window syndrome? Explain the solution to this problem.4. Discuss the issues in Resource allocation.5. Explain how resource allocation mechanisms can be classified.6. Explain the process of connection establishment in the Transport layer?7. Explain in brief about TCP congestion control.

Chapter 6: Applications.

This chapter describes a representative sample of network applications and theprotocols they use, including the traditional applications like email and the web. It alsogives an insight into the protocols like FTP, HTTP VoIP etc.

1. What is DNS? Explain how name resolution takes place in practice.2. What is SNMP? Explain.3. Write short notes on Electronic mail.4. Write a note on World Wide Web.5. Explain the operation of FTP. Discuss its merits and demerits.


14/40



14

PROGRAMMING WITH JAVA

Subject Code: 10MCA33 Hours / Week: 4Faculty: MEERA RAJAN Total Hours: 52

Overview: Java is first and foremost programming language used for internet. Thiscourse describes basic fundamentals of java programming. It includes topic like exceptionhandling, Applet, Strings, Multi Threading, Inheritance, Enumeration, and Autoboxing. Italso describes to create application using various concepts in Java.

Classno.

Chapter # Topics to be covered

% of portioncovered

Chapterwise

Cumula-tive

1

Unit 1

An overview OfJAVAAnd

Unit 2Introducing

Classes

Object-Oriented Programming, A FirstSimple Program, A Second ShortProgram, Using Blocks of Code

Lexical Issues,

19.2319.23

2The Java Class Libraries. Data Types,Variables , and Arrays

3Java Is a Strongly Typed Language,The Primitive Types,

4A Closer Look at Literals, Variables,Type Conversion and casting,

5

Automatic Type promotion inExpression, Arrays, A few wordsabout Strings. Operators: ArithmeticOperators,

6

The Bitwise Operators, RelationalOperators Boolean Logical Operators,The Assignment Operator, The ?Operator, Operator Precedence,

7

Using Parentheses. ControlStatements: Javas Selection,Iteration Statements, JumpStatements.

8

Class Fundamentals, DeclaringObjects, Assigning Object ReferenceVariables Introducing Methods,Constructors, The this Keyword,

Garbage, The finalize( ) Method AStack Class.

9A Closer Look at Methods andClasses: Overloading Methods,Overloading Constructors,

10Using Objects as Parameters, ACloser Look at Argument Passing,Returning Objects, Recursion,


15/40



15

11Introducing Access Control,Understanding static, Introducingfinal, Arrays Revisited,

12

Introducing Nested and InnerClasses, Exploring the String Class,Using Command-Line Arguments,Varargs

13

Unit 3Inheritance:

Inheritance Basics, Using super,

Using super Creating a MultilevelHierarchy, When Constructors AreCalled,

15.38 34.61

14Method Overriding, Dynamic MethodDispatch Using Abstract Classes,

15

Using final with Inheritance, TheObject Class. Packages andInterfaces: Packages, AccessProtection,

16

An Access Example ImportingPackages, Interfaces. ExceptionHandling: Exception-Handling

Fundamentals,17

Exception Types, UncaughtExceptions Using try and catch,

18Multiple catch Clauses, Nested tryStatements, throw, throws, finally,Javas Built-in Exceptions,

19Creating Your Own ExceptionSubclasses, Chained Exceptions,Using Exceptions.

20

Unit 4MultithreadedProgramming

The Java Thread Model, The MainThread, Creating a Thread, CreatingMultiple Threads

15.38 49.99

21Using isAlive( ) and join( ), ThreadPriorities,

22Synchronization, InterthreadCommunication, Suspending,

23Resuming, and Stopping Threads,Using Multithreading.

24Input/Output: Exploring java.io: TheJava I/O Classes and Interfaces,

25

The Closable and FlushableInterfaces, The Stream Classes, TheByte Streams, The CharacterStreams,

26

The Console Class, Using Stream I/O,

Serialization, Stream Benefits.

27Unit 5

Enumeration,Autoboxing

Enumeration, Type Wrappers,Autoboxing. Generics: What areGenerics?, A Simple GenericsExample 13.46

63.4528

A Generics Class with two TypeParameters,

29The General Form of a Generic Class.String Handling:


16/40



16

30The String Constructors, StringLength, Special String Operations,

31

Character Extraction, StringComparison, Searching Strings,Modifying a String, Data ConversionUsing valueOf( ),

32Changing the Case of CharactersWithin a String, Additional String

Methods, StringBuffer, String Builder.

33

Unit 6Exploring

Java.lang :

Primitive Type Wrappers, System,Object, Class,

23.0686.51

34Class Loader, Math, Thread,ThreadGroup, Runnable, Throwable.

35The Collections Framework:Collections Overview, The CollectionInterfaces,

36The List Interface, The QueueInterface,

37The Collection Classes, The ArrayListClass

38 The LinkedList Class, The HashSet,39 The TreeSet Class.

40

Unit 7Networking

Networking Basics, The NetworkingClasses

8.46 92.97

41Interfaces InetAddress TCP/IP ClientSockets

42URL, URLConnection, HTTP URLConnection,

43 TCP/IP Server Sockets, Cookies

44Inet4Address and Inet6Address, TheURI Class

45 Remote Method Invocation (RMI)46

Unit 8The Applet Class

The Applet Class, Event Handling

6.56 100

47 Two Event Handling Mechanisms

48 The Delegation Event Model

49 Event Classes, Sources of Events

50Event Listener Interfaces, Using theDelegation Event Model

51 Adapter Classes, Inner Classes.

52 Introducing Swing, Exploring Swing.


17/40



17

Literature:

BookType

BookCode

Title and Author Publication Specification

Edition Publication Year

Text Book T1

Herbert Schildt: The completereference JAVA, 7th Edition, TataMoGrawHill, 2006.

(Chapters: 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 17, 19, 20,21, 22, 27, 29, 30)

Pearsoneducation

2007

Reference

Book

R1

Raghavan P, Suresh Kumar T V:Programming with Java, Sanguine-Pearson, 2010.

R2James P Cohoon, Jack WDavidson: Programming in JAVA5.0, Tata McGraw Hill, 2007.

R3

Cay S Horstmann, Gary Cornell:Core Java 2 - Volume 1, 7th

Edition, Pearson Education, 2005.

R4Cay S Horstmann, Gary Cornell:Core Java 2 - Volume 2, 8thEdition, Pearson Education, 2008.

R5Y. Daniel Liang: Introduction toJAVA Programming, 7th Edition,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, operators1. 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 JAVA8. 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?


18/40



18

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 restrictionsfor static members ?16. What are methods? How they are invoked in java? How does java passes parameterstothem?

CHAPTER 2:Introducing Classes

Overview: This chapter discusses about how the class and objects are created, varioustypes 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 example26. What is applet? Discuss the steps involved in loading and running a applet27. 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 ProgrammingOverview: 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,AutoboxingOverview: This chapter discusses about the Generics features and also how to handleString 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 ?


19/40



19

CHAPTER 6 : Exploring java.lang45. What are packages ?46. What are collections Framework ?47. Explain Linked List Class ,Hash Set, Tree-set class.

CHAPTER 7 : Networking48. 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 Class53. 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 class55. What are components? Which are the subclasses of components of abstract windowtoolkit? 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?


20/40



20

Data Base Concepts & Applications

Subject: Code: 10MCA34 No of hours: 52Faculty: NEELAM BAWANE No of hours/week: 04OverviewDatabase management systems are now indispensable tool for managing information, anda course on the principles and practice of database systems is now an integral part ofcomputer science. This course covers the fundamentals of modern database managementsystems, in particular relational database systems.

Class#

ChapterTitle/Reference

LiteratureTopics to be covered

% of portions to becovered

ReferenceChapter

Cumulative

1

Chapter1:IntroductionT1: Page 3-52

Introduction; An example

13 13

2 Characteristics of Database approach;

3Actors on the screen; Workers behindthe scene;

4Advantages of using DBMS approach; Abrief history of database applications;

when not to use a DBMS.

5Data models, schemas and instances;Three-schema architecture and dataindependence;

6Database languages and interfaces;The database system environment;

7Centralized and client-serverarchitectures; Classification ofDatabase Management systems.

8 Chapter 2:Entity

RelationshipModelT1:Page 57-90

Using High-Level Conceptual DataModels for Database Design, AnExample Of database Application

13 26

9 Entity types, Entity sets, Attributes andKeys

10Relationships types, Relationship sets,Roles and Structural Constraints

11Weak Entity Types, Refining the ERDesign for the COMPANY Database

12 ER Diagrams13 ER Diagrams

14Naming Conventions and Design Issues;Relationship types of degree higherthan two

15 Chapter 3:

RelationalModel andRelationalAlgebraT1: Page 145-200, 225-233

Relational Model Concepts

15 41

16 Relational Model Constraints andRelational Database Schemas;

17Update Operations, Transactions anddealing with constraint violations;

18Unary Relational Operations: SELECTand PROJECT;

19Relational Algebra Operations from SetTheory


21/40



21

20Binary Relational Operations: JOIN andDIVISION; Additional RelationalOperations;

21Examples of Queries in RelationalAlgebra;

22Relational database Design Using ER-to-Relational Mapping

23Chapter 4:SQL

T1: Page 243-330

SQL Data Definition and Data Types;

33 74

24 Specifying basic constraints in SQL;

25 Schema change statements in SQL;

26 Basic queries in SQL;



29 More complex SQL Queries



32Insert, Delete and Update statementsin SQL;

33Specifying constraints as Assertion and

Trigger;34 Views (virtual tables) in SQL

35 Additional features of SQL;

36Database programming issues andtechniques;

37 Embedded SQL, Dynamic SQL;

38Database stored procedures andSQL/PSM.

39Chapter 5 :

DatabaseDesign

T1: Page 337-409

Informal Design Guidelines for RelationSchemas

15 89

40 Functional Dependencies

41 Functional Dependencies

42 Normal Forms Based on Primary Keys

43 Normal Forms Based on Primary Keys

44General Definition of 2nd & 3rd Normalforms

45General Definition of 2nd & 3rd Normalforms

46 Boyce-Codd Normal Form

47Chapter 6 :

Overview ofTransactionManagement

T2: Page 519-554, 579-596

The ACID Properties; Transactions andSchedules; Concurrent Execution ofTransactions;

12 10048

Lock- Based Concurrency Control;Performance of locking; Transactionsupport in SQL;

49Introduction to crash recovery;2PL, Serializability and Recoverability;Introduction to Lock Management;

50Introduction to ARIES; The log; Otherrecovery-related structures; The write-ahead log protocol;


22/40



22

51Checkpointing; Recovering from aSystem Crash; Media Recovery;

52 Other approaches and interaction withconcurrency control.

Literature:

Test 1: Chapter 1 & 2Test 2: Chapter 3 & 4Test 3: Chapter 5 & 6

Question Bank

Chapter 1: IntroductionObjective: 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) EndUser f) Data Base Schema g) Data Abstraction h) DDL i) external Schemaj) 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.

BookType

BookCode

Title & Author Publication Info


Text Book T1 Fundamentals of DatabaseSystems- Elmasri and Navathe

5th PearsonEducation

2007

Text Book T2 Database Management Systems-Raghu Ramakrishna & JohannesGehrke

3rd TataMcGraw-Hill

2003

ReferenceBook

R1 Database System Concepts-Henry FKorth, Silberscatz & Sudharshan

6th TataMcGraw-Hill

2010

ReferenceBook

R2 A Introduction to Database systems C.J.Date, A Kannan, S.

Swamynatham

8th PearsonEducation

2006


23/40



23

Chapter 2: Entity-Relational ModelObjective: In this chapter, the concepts of the Entity-Relationship (ER) modeland 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) Storedattributes f) Derived attribute g) Super Key h) Candidate Key i) Partial Key

j) Foreign key k) Primary key l) Weak entity m) Cardinality ration) Participation constraint o) Generalization p) Composite keyq) 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 Entity-

Relationship 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 arenumber of recorded accidents. For the above E-R diagram develop a relationalmodel.

25.Write the E-R diagram for the automation of various activities of MCA departmentof 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 havemultiple 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 moreemployees and each employee works for one department. A manager controls eachdepartment. Many projects are carried out in a department with a team ofemployees assigned to it. It is required to maintain information about thedepartments 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. Drawan 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 followingspecifications. Specify properly cardinality constraints and keys.

i) Each musician that records at Notown has an SSN, name, an addressand phone number. Phone number can be more than one.

ii) Each instrument used in songs recorded at Notown has a name and amusical key.

iii) Each album recorded on the Notown has a title, a copyright date, aformat 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.


24/40



24

vii) Each song is performed by one or more musicians and a musicianmay perform a number of songs.

viii) Each album has an excellent musician who acts as its producer. Amusician can produce several albums.

Chapter 3: Relational Model and Relational AlgebraObjective: This chapter describes the basic relational model, its integrityconstraints and update operations, and the operations of the Relational Algebra.

35.Discuss various update operations on relations and the type integrity constraintsthat must be checked for each update operation.

36.Define the basic relational algebra operators. Show how natural join, intersectionand division can be implemented using basic operators.

37.What are integrity constraints? List different types of integrity constraints andexplain any two of them.

38.Describe how the database system will ensure that the modifications to thedatabase will not violate referential integrity constraints.

39.Explain the following terms with suitable examples:a) select b) project c) join d) union e) Cartesian productf) 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 researchdepartment.List the names of managers who have at least one dependent.

42.Consider the following relational database. For each of the following queries, givean 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 whoworkfor 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 thecompany for which they work.

43.Consider the scheme Employee(Id#, name, designation, salary) perform thefollowing functions using relational algebra:

a. sum of salary b. count distinction designations c. maximum salaryd. delete records of employee having salary less than 1000 e. insert a record

Chapter 4: SQL-The Relational Database StandardObjective: It gives a detailed overview of the SQL language, covering the SQL2standard.

44.Explain the following:a) Nested Query b) Correlated nested Query

45.Write short notes on:a) Embedded SQL b) Dynamic SQLc) 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)


25/40



25

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 statementsEmployee (Name, SSN, Salary, DNO)Dept (Dname, Dnum)Project (Pname, Pnumber, Dnumber)

i) Retrieve all the attributes of employees working for Researchdepartment

ii) Using nested query, retrieve the name of each employee who works onall the projects controlled by dept. number 3.

iii) For each project on which more than two employees work, retrieve theproject number, project name and the number of employees who workson 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 onupdate operations of views?

50.Consider the following scheme for the COMPANY database. The primary keys areunderlined.

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 XYZdepartment.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 ofsales 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 thefollowing 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 toDelhi

iv) Print the total trip expenses incurred by the salesman withsalespersonID = 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 andQuarter-No. Write SQL statement for the following:

i) Obtain the list of the names of employees whose place is Chennai andwho have been allotted quarters.


26/40



26

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 SQLi) List the details of all the guests staying at Grosvenor hotel whose name

begins with the letter Cii) 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 SQLi) Find the names of the sailors reserved for the boat number 500ii) Find the names of the sailors reserved green boatiii) Find the sailor having highest ratingiv) Delete all the sailors with rating less than 10v) 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 theaccident with report number 12 to 25000ii) Find the total number of people who owned cars that were involved in

accident in 2002iii) 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 productsii) whose quantity bought is more than 100 unitsiii) List all the products with quantities and prices purchased byiv) particular customerv) List all the customers who have purchased a particular partvi) 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 tableii) ALTER both add and modifyiii) SELECT Group-by, having apart from FROM and WHERE.

58.What are views? Illustrate the problems encountered in modifying the databasethrough views.


27/40



27

59.Consider the following schemaSuppliers (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 algebrai) 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 DesignObjective: This chapter encompasses different types of dependencies andnormal 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 ManagementObjective: Here, the concepts of transactions, concurrency, problems associated with theconcurrent execution of the transactions and the various schemes used to resolved themare presented

66.Describe the shadow-paging recovery technique with an example.67.Describe two phase locking protocol68.Explain the database recovery technique based on deferred update.69.Define the terms:

a) Serializable schedule b) Recoverable schedule70.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


28/40



28

OPERATING SYSTEMS

Subject Code : 10MCA35 Hours / Week: 04Faculty : Ms. UMA Total Hours: 52

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 theircomputer. Operating systems are found on almost any device that contains a computer from cellular phones and video game consoles to supercomputers and web servers. Acourse on operating system provides an overview which includes Introduction to OperatingSystem, Process Management, CPU Scheduling, Process Synchronization, Deadlocks,Storage Management, Memory Management, Virtual Memory, File system, Mass StorageStructure, Protection and Security and a case study about Linux Operating System.

Sl.No

Chapter # Topics to be covered

% of portion covered

Reference

Chapter

Cumulative

1

CHAPTER 1:

Introduction to

operatingsystem,System

Structures

Page #:T1: 3 - 68

What operating systems do, ComputerSystem organization, computer systemarchitecture

11.54 11.54

2Operating System structure; OperatingSystem operations, Process management

3Memory management; Storage management,Protection and security, Distributed system;Special-purpose systems

4

Computing environments, Operating SystemServices, User - Operating System interface;System calls, Types of system calls; Systemprograms

5

Operating System design and

implementation; Operating System structure,

6Virtual machines; Operating Systemgeneration; System boot

7CHAPTER 2:

ProcessManage-

ment

Page #:T1: 79 99

T1: 123 -139T1: 149 -170

Process concept, Process Scheduling

17.31 28.85

8 Operation on Processes

9 Inter-process Communication

10Multi-Threaded Programming: Overview,Multithreading models,

11 Thread Libraries, Threading issues

12Process Scheduling: Basic concepts,Scheduling Criteria

13 Scheduling Algorithms

14 Scheduling Algorithms

15Multiple Processor Scheduling ,ThreadScheduling

16 CHAPTER 3:Process

Synchronization

Page #:

Synchronization: The Critical SectionProblem, Petersons solutions,

13.46 42.3117 Synchronization Hardware,

18 Semaphores

19 Classical Problems of Synchronization


29/40



29

20 T1: 189 -213 Classical Problems of Synchronization

21 Classical Problems of Synchronization

22 Monitors

23CHAPTER 4:Deadlocks

Page #:T1:237-259

Deadlocks: System model; Deadlockcharacterization;

9.62 51.9324

Methods for handling deadlocks; DeadlockPrevention

25 Deadlock Avoidance26 Deadlock Avoidance

27 Deadlock detection, Recovery from Deadlock

28 CHAPTER 5:

MemoryManagemen

t

Page #:T1: 265-295T1: 303-335

Memory Management strategies:Background,

15.37 67.30

29 Swapping, Contiguous Memory Allocation

30 Paging

31 Structure of the page table, Segmentation

32Virtual Memory Management: Background,Demand Paging

33 Copy on write, Page Replacement

34 Page Replacement (continued)

35 Allocation of Frames, Thrashing36 CHAPTER 6:

File System,Implementation of File

SystemPage #:

T1: 359-391T1:395-415

File System: File Concept,

11.54 78.84

37 Access Methods, Directory Structure

38 File system mounting, File sharing, Protection

39File system structure, File systemimplementation

40 Directory Implementation, Allocation Methods

41 Free space management

42CHAPTER 7:

Secondary

StorageStructures,Protection

Page #:T1: 435-

451T1: 595-613

Mass Storage Structures: Disk Structure,Disk Attachment

11.54 90.38

43 Disk Scheduling

44 Disk management, Swap space management45

Protection: Goals of protection, Principles ofProtection, Domain of protection

46Access matrix, Implementation of accessmatrix

47Access Control, Revocation of access rights,Capability-Based systems

48 CHAPTER 8:Case Study:The LinuxOperating

SystemPage #:

T1: 713-750

Linux History, Design principles, Kernelmodules

9.62 100

49 Process management, Scheduling

50 Memory management

51 File systems

52Input and Output, Inter-processcommunication


30/40



30

LITERATURE

BookType

Code Title and Author

Publication Information

EditionPublishe

rYear

Text Book T1Operating System Principles: A.

Silberschatz, P. Galvin, G.Gagne

Eighth EditionWiley-India

2009

ReferenceBook R1

Operating Systems-A Concept

based Approach: D.M.Dhamdhere

Second Edition

Tata

McGraw-Hill

2002

ReferenceBook

R2Introduction to Operatingsystems- Concepts andPractice: P.C.P Bhatt

Second Edition PHI 2008

ReferenceBook

R3Operating Systems: Harvey M

DeitalThird Edition

PearsonEducation

1990

Test SyllabusTest 1: Chapters 1, 2, 3Test 2: Chapters, 3, 4, 5Test 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 aredesigned and constructed. The common features of an operating system are discussed .

1. What is an operating system? What are the functionalities of an OS?2. Explain various components of an OS.3. What are the services provided by an OS?4. Explain the following types of OS:

(i) Batch (ii) RealTime (iii) TimeSharing (iv) Distributed systems (v)

Multimedia systems5. 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 system13.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 modernoperating systems. Topics under this chapter also cover methods for process schedulingand interprocess communication.16.What is a process? With the help of a diagram, explain the different states of a

process.


31/40



31

17.Explain the process control block , in detail.18.What is CPU Scheduling? What is the difference between preemptive and non-

preemptive 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 communication32.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,1and 4 respectively. For each of the following draw Gantt Chart and computeturnaround time.(i) RR (Quantum time 1 sec) (ii) FCFS (iii) Priority (iv) SJF

34.What is context switching? Explain process context switching with process statediagram. 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:

Processes Burst Timein

milliseconds

Arrival Timein

millisecondsP1 8 0

P2 4 1P3 9 2P4 5 3

Draw the Gantt chart and calculate the average waiting time using the followingalgorithms

(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 3P2 5 1P3 12 2P4 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) NonPre-emptive Shortest Job First (III) Non Pre-emptive priority-scheduling schemes.

38.Consider the following processes which have arrived the ready queue with the bursttime and the arrival time given in milliseconds as shown

Process Burst timeinmilliseconds

Arrival timeinmilliseconds


32/40



32

P1 8 0P2 4 1P3 9 2P4 5 3

Construct the Gantt chart and calculate the average waiting time using the FCFS andSJF (preemptive).

39.Consider the following set of processes, with the length of the CPU burst given inmilliseconds.

Process Bursttime

Priority Arrivaltime

P1 10 4 0P2 12 3 2P3 14 5 3P4 16 1 6PS 5 1 30

i) Draw a Gantt chart that illustrates the execution of these processes using thepreemptive priority scheduling algorithm (a smaller priority number implies ahigher 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 time1 0 102 1 153 2 174 3 20

i) Give a Gantt chart illustrating the execution of these jobs using the pre-emptiveand non-preemptive SJF scheduling algorithms.

ii) What is avg. waiting time of jobs for the above algorithms? What is yourconclusion?

41.Consider the following set of processes :Processes Burst Time Priority

P1 6 3

P2 4 1P3 10 2P4 3 4

The processes have arrived in the order P1, P3, P2 and P4. Obtain the Gantt chart, waitingtime using (i) SJF (ii) Pre-emptive priority-scheduling schemes.

Chapter 3: Process Synchronization

Objective: This chapter discusses the various mechanisms to ensure the orderlyexecution of processes that share a logical address space, so that data consistency ismaintained. 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 condition47.Explain the Readers-Writers problem in detail.48.Explain Dining-Philosophers problem and its solution.


33/40



33

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 withdeadlocks.

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 B C A B CP0 0 1 0 1 0 1 1 0 2P1 1 2 1 2 2 1P2 2 3 0 1 2 3P3 0 1 1 1 4 3

a. What is the content of need matrix?

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 CP0 0 1 0 7 5 3 3 3 2P1 2 0 0 3 2 2P2 3 0 2 9 0 2P3 2 1 1 2 2 2P4 0 0 2 4 3 3

Answer the following questions using Bankers algorithmsa. 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 brieflyabout the deadlock avoidance.

Chapter 5: Memory Management

Objective: This chapter deals with main memory management during the execution of aprocess. The different memory management schemes such as paging and segmentationare discussed.

61.Explain the following with respect to memory management:i) First Fit ii) Best Fit iii) Worst Fit


34/40



34

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 table68.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 replacement74.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, 4How many page faults would occur for the page replacement algorithms: LRU, FIFOand Optimal. Trace these algorithms for 3 frames. What is your comment on thesealgorithms?

77.Consider following reference string7,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 andOptimal. Trace these algorithms for 3 frames. Note that initially all the frames areempty.

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 handledin a modern computer system.

80.What is acyclic graph directory structure? Explain with example. Explain the following:i) File Operationsii) Files Typesiii) 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 Access84.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 table88.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.


35/40



35

90.Name the different file allocation methods. Explain the linked allocation methodgiving merits and demerits.

Chapter 7: Secondary Storage Structures, Protection

Objective: This chapter discusses access to data and programs residing on the disks. Italso discusses how the processes in an operating system are protected from one anothersactivities. 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) SCAN93.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 Management97.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 queueof pending requests in FIFO order is 98, 183, 37, 122, 14, 124, 65, 67. What is thetotal distance (in cylinders) that the disk arm move to satisfy all the pending requestsfor each of the below disk scheduling algorithms? Explain each with neat diagram.

i) FCFS ii) SSTF iii) SCAN98.Explain the following.

i) Boot Block ii) Bad Block99.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 theimplementation method of access matrix.106. Write short notes on the following:

i) Fragmentationii) 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. With a diagram explain the components of the Linux system.108. Discuss various kernel modules in Linux.109. Explain process management and process scheduling in Linux operating system.110. Explain memory management and File systems in Linux operating system.111. Explain Interprocess communication in Linux operating system.112. Explain Input-Output in Linux operating system.


36/40



36

SYSTEM SOFTWARE LAB

Sub. Code: 10MCA36 Hours/Week: 03

PART A

1. Program to count the number of vowels & consonants in a given string2. Program to count the number of characters, words, spaces & lines in a given input

file3. Program to count number of

a) positive & negative integersb) positive & negative fractions

4. Program to count the numbers of comment lines in a given C program. Alsoeliminate 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).


37/40



37

Java Programming Laboratory

Subject Code: 10MCA37 Hours/Week: 3

1. a. Write a JAVA Program to demonstrate Constructor Overloading and Methodoverloading.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 andfinally).3. Write a JAVA program which hasi. 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 throwsLessBalanceException if an account holder tries to withdraw money which makes thebalance become less than 500Rs.ii. A Class called LessBalanceException which returns the statement that says withdrawamount (___Rs) is not valid.iii. A Class which creates 2 accounts, both account deposit money and one account tries towithdraw more money which generates a LessBalanceException take appropriate action

for the same.4. Write a JAVA program using Synchronized Threads, which demonstrates ProducerConsumer concept.5. Write a JAVA program which hasi. A Interface class for Stack Operationsii. 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 theStack operations that demonstrates the runtime binding.6. Write a JAVA program which hasi. 2 classes which initializes a String in its constructorii. A Generic class with 2 type Parametersiii. 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 Class8. 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 MouseEvent12. Write JAVA Applet programs which handles KeyBoardEvent13. Write a JAVA program which implements RMI.14. Write a Swing Application which usesi. JTabbed Paneii. Each Tab should use JPanel, which includes any one component given below in eachPanel

iii. ComboBox / List / Tree / RadiobuttonNote:All the above Components should Listen to any one of their respective events and printappropriate message.


38/40



38

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 recordper student-class pair such that the student is enrolled in the class. Level is a twocharacter 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 byProf. Harshith

ii. Find the names of all classes that either meet in room R128 or have five or moreStudents enrolled.

iii. Find the names of all students who are enrolled in two classes that meet at thesame time.

iv. Find the names of faculty members who teach in every room in which some classis taught.

v. Find the names of faculty members for whom the combined enrollment of thecourses 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 havesalaries more than Rs.80,000.

ii. For each pilot who is certified for more than three aircrafts, find the eid and themaximum 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 routefrom Bengaluru to Frankfurt.

iv. For all aircraft with cruisingrange over 1000 Kms, Find the name of the aircraftand 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 NewDelhi

III. Consider the following database of student enrollment in courses & books adopted foreach 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)


39/40



39

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 foreignkeys.

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 thealphabetical order for courses offered by the CS department that use more thantwo books.

v. List any department that has all its adopted books published by a specificpublisher.

vi. Generate suitable reportsvii. 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 foreignkeys.

ii. Enter at least five tuples for each relation.iii. Give the details of the auth

Documents

III Sem CourseInfo 2011 With Questions