Database Concepts and Applications

,'.'. Page No... 1 MCA401 USN Fourth Semester M.C.ADegree Examination, July IAugust 2004 Master of Computer Applications (Old Scheme) Database Concepts and Applications Time: 3 hrs.] [Max.Marks : 100 Note: Answer any FIVE full questions. 1. (a) Describe the approach used for handling data in early file based system. Discuss the disadvantages of this approach. (b) Discuss the role of the following in database environment. i) DBA ii) Application programmer ii1)sophisticated user v) DBM iv)naiveuser (10 Marti) 2. (a) Explain the following terms i) Data abstraction ii) Data independence (lomarks) (b) 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. 3. (a) What is a data model? With a suitable example explain different types ofdata model. # (b) Consider the following database schema. Hotel (Hotelno. name. city) Room (Roornno. 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) iv) Insert a new guest into the database assuming the values for required fields suitably. 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 that hotel. 4. (a) Define the basic relational algebra operators. Show how natural join. intersection and division can be implemented using basic operators. COntd... 2

Page No... 2 (b) What are integrity constraints? and explain any two of them. MCA401 List different types of integrity constraints (10Mllu) 5. (a) What is the purpose of normalization? Describe the concept of transitive dependency and write how this is related to 3 NF. Give an example to illustrate your answer. (10 Muks) (b) What is meant by lossless decomposition? Write an algorithm to checkif the decomposition is lossless. 6. (a) What is multivalved dependency? How is it related to 4NF? Give an exampl to illustrate your answer. (b) Describe how the database system will ensure that the modifications tothe database will not violate referential integrity constraints. 7. (a) With examples explain the implementation of fixed length and variable length records. (b)-explain two phase locking protocal. 8. Write short notes on the following a) B+ trees b) Shadow paging c) Database modification using QUEL d) Statistical database (5 X 4=20 Markl

MCA402 USN Fourth Semester M.C.ADegree Examination, July/August 2004 Time: 3 hrs.] Master of Computer Applications (Old Scheme) Computer Networks Note: A nswer any FIVE full questions. [Max.Marks : 100 1. (a) Explain the ISO-OSI reference model. (b) Discuss the types of services offered by layers in OSI model. Also discuss the various service primitives. 2. (a) Explain circuit switching and packet switching. (b) Explain CRC with an example. 3. (a) Explain a simplex stop - and - wait protocol. Give algorithms for sender and receiver. (b) Explain IEEE 802.5. the token ring. 4. (a) Explain slotted ALOHAand derive an expression for its efficiency. (b) Explain various training techniques in DLL. 5. (a) Classify routing algorithms. disadvantages. Explain flooding with. advantages and (b) Mention and bpieflyexplain congestion control techniques in virtual circuit subnets. 6. (a) Explain different types of fragmentation techniques in internetworking. (b) Explain the structure of IP packet header and the IP address formats. 7. (a) Explain a three - way handshaking technique for releasing a connection in transport layer. (b) Mention and briefly explain transport layer quality ofservice (QOS)parameters. 8. Write short notes on the following : (a) Network goals (b) Firewalls (c) Transport layer in TCPlIP (d) Gateways (4 x 5=20 Marks)

MCA403 USN ourth Semester M.C.A Degree Examination, July/August 2004 Master of Computer Applications (Old Scheme) Software Engineering Time:3 hrs.] [Max.Marks : 100 Note: 1. A nswer any FIVE full questions. 2. All questions carry equal marks. 1. (a) What is software engineering? Explain the applications of software engineering. (b) Describe the water model and discuss its benefits and dtsadvantages.u s Marks) 2. (a) (b) (c) 3. (a) (b) Discuss risk identification & risk analysis. (c) 4. (a) (b) Explain the components of software requirement specifications (SRS).(6Marks) Discuss the characteristics of SRS. (6Marks) Develop DFD for ATM. Explain project monitoring plans. Explain software project scheduling and staffing. Explain briefly the software design principles. Discuss briefly the structured design methodology. 5. (a) Explain any two graphical notations in detail. (b) Compare top-down llesign strategy with bottom up design strategy. 6. (a) What do you mean by structured programming? Explain with an example. (b) Discuss the general rules that are usually applied for the programming style. 7. (a) Discuss different levels of testing. 8. (b) Describe the different techniques of functional testing. Write short notes on : (a) Block box testing (b) Design metrics (c) Software reliability (d) Software validation (5 x 4=20 Marks)

Page No... 2 MCA404 (b) Does the above method give optimum result for (0-1) version of Knapsack problem? Justify your answer. (4 Marks) (c) Briefly explain Dijkstrais algorithm to solve single source. shortest ~ath ~I()~ \em. (SMarks) 5. (a) Brieflyexplain the concept ofprinciple of optimality and dynamic programming. (8 Maris) (b) Explain an algorithm to build an optimal binary search tree. Illustrate it on the data below Keys 10 15 20 25 p'.s 30 40 35 50 ~ ls 25 30 15 60 20 ~ (12 Maru) 6. (a) Briefly explain the back trucking solution to n-queen's problem. (b) Trace the solution for 4-queen problem. (10 Maru) 7. (a) Briefly explain the branch and bound solution to the travelling salesman problem. (b) Show that the clique problem is NP-complete. 8. Write short notes on : (a) Depth first search (b) Huffman code (c) Lower bound in sorting (d) Disjoint set union find algorithm. (5 x 4 =20 Marks),

Page No... 2 MCA404 (b) Does the above method give optimum result for (0-1) version of Knapsack problem? Justify your answer. (4 Marks) (C) Briefly explain Dijkstrais algorithm to solve single source shortest path problem. (SMarks! 5. (a) Brieflyexplain the concept ofprinciple of optimality and dynamic programming (SMarks (b) Explain an algorithm to build an optimal binary search tree. Illustrate it 0 the data below Keys 10 15 20 25 p'.s '!, 30 40 35 50 q~s '!, 25 30 15 60 20 (12 Mark! 6. (a) Briefly explain the back trucking solution to n-queen's problem. (b) Trace the solution for 4-queen problem. (10 Mark! (10 Mark! 7. (a) Briefly explain the branch and bound solution to the travelling salesma problem. (10 Mark (b) Show that the clique problem is NP-complete. (10 Mark 8. Write short notes on : (a) Depth first search (b) Huffman code (c) Lower bound in sorting (d) Disjoint set union find algorithm. (5X4 =20 Marll

Page No... 1 MCA4052 USN FourthSemester M.C.A Degree Examination, July/August 2004 Time:3 hrs.] Master of Computer Applications (Old Scheme) Algorithmic Graph Theory Note: Answer any FIVE full questions. 1. (a) Explain with illustrations. how the concepts of graph theory can be used in computer applications. (b) Describe KOnigsbergbridge problem. Discuss on the existance of solution to this problem. (C) State and prove handshaking principle of Euler. (4 Marks) 2. (a) What are adjacent edges and adjacent vertices? Give examples to distinguish between edge - disjoint and vertex - disjoint graph. (b) Prove that in a simple graph with 'p' vertices and 'q' components can have at most (p-q) ~-q+l) edges. (C) [Max.Marks : 100 Given below are the vertex set V(G)and the edge set E (G)of a graph G V(G) = {a,,8,1',8} E(G) = {a,8,a1',a8,,88,,81',1'8} Draw the graph..is this Eulerian and/ or Hamiltonian graph? 3. (a) Defme an unicursal graph. Draw a graph to show that it is unicursal graph. # (b) State Euler polynomial formulae for a plane map. If Gis a(p, q) plane map in which every face is an n - cycle. then show that. - ~. q - n(n_2) and hence. deduce the necessary condition for planarity of a (p, q) graph.. (c) Define i) a cut vertex. ii) a bridge and iii) a block Give one example for each. 4. (a) Define Kr,s. Show that a graph is bipartite if and only if all its cycles are even. (b) Define a planar graph. Give an algorithm for planarity testing. (C) Show that the maximum number of edges in a simple graph with n vertices is n(1-1 ) (4 Marks) 5. (a) Define an adjacency matrix. and discuss the important observations that you find in an adjacency matrix. (4 Marks) (b) Defme chromatic polynomial f( G, t). Show that for any graph (G). fa ~ X (G) ~ p -,80 + 1 Contd... 2

Page No... 2 '. MCA4052 (c) Draw a graph for the following incidence matrix and also discuss the important findings in an inctdence matrix. a bed e f 9 h 00010 1 0 0 000 1 1 1 1 o 0 0 0 0 0 0 1 1 1 1 0 1 0 0 0 001 1 0 0 1 0 1 1 000 0 0 0 6. (a) Define a tree. If G is a tree, show that every two vertices of G are joined by a unique path and p = q + 1. (b) Write the Solin's algorithm to obtain a minimal spanning tree. (C) Determine the minimal spanning tree by applying Kruskal's algorithm in the following graph. \ 7. (a) Write Warshall's algorithm to find the shortest path. (b) Using Dijkstras' algorithm find the shortest path in the following graph. 8. (a) (c) Draw two non-isomorphic spanning trees of Ks. c Prove KeG) ::;.A(G) ::;h( G) for any graph G. (b) Define i}an acyclic graph ii) Vertex colourtng. (c) (4 Marks) Show that in a gathering of six people there are either three people who all know each other or three people none of whom knows either of the other two.

MCA4053 USN Fourth Semester M.C.ADegree Examination, July IAugust 2004 Time:3 hrs.] Master of Computer Applications (Old Scheme) Microprocessor Application Note: 1. Answer any FIVE full questions. 2. All questions carry equal marks. 1. (a) With neat block diagram explain the internal microprocessor. [Max.Marks : 100 architecture of 8085 (b) With the help of neat pinout diagram of 8085 explain the function of i) ALE ii) HOLD 1i1)51. SO iv) READY. 2.. (a) Explain how instructions are classified in 8085. Give example for each class. (b) Explain addressing modes of 8085. Give atleast two examples of each mode.. 3. (a) What is a stack? Explain the stack operations in 8085. (5 Marks) (b) Write an assembly language program to sort the numbers in descending order. The count is placed in location 2500 H. The numbers are stored from location 250 IH. (c) Write a note on serial operations in 8055. 4. (a) Explain fetching of the instruction diagram. (b) 5. (a) With neat diagram explain the interrupt facility of 8085. (b) Explain how 8259 PIC helps 8085 in handling multiple interrupts. 6. (a) (b) 7. (a) With neat block diagram explain the 8257 DMAcontroller. 8. (b) Describe the functional block diagram of 8251A USART. a) b) c) d) (5 Marks) MVI A. 32H with the help of a timing How 16 X 8 ROMand 16 X 8 RWMare interfaced with 8085? Explain. Write memory map of the system. With neat block diagram explain the 8255 PPI. Also explain mode O. mode I and mode 2 operation of 8255. With neat block diagram explain the 8253 programmable interval timer. Write notes on : RIMand SIM instructions. Address - data bus demulttplexing Memory mapped I/O & I/O mapped I/O. Synchronous and Asynchronous serial data transfer. (4 X 5=20 Marks)