
	Trending ▼ ICSE CBSE 10th ISC CBSE 12th CTET GATE UGC NET Vestibulares ResFinder

IGNOU UNIVERSITY MCA - I (SEM 2) DEC 2009 : Data And File Structures

4 pages, 16 questions, 0 questions with responses, 0 total responses,

	mca_india	+Fave Message
	Profile Timeline Uploads Q & A

Home > mca_india >

Formatting page ...

MCS-021 I MCA (Revised) Term-End Examination December, 2009 0 MCS-021 : DATA AND FILE STRUCTURES tr) Time : 3 hours Maximum Marks : 100 (VVeightage 75%) Note : Question number 1 is Coinpulsory. Attempt any three questions from the rest. All algorithms should be written nearer to C language. 1. (a) Consider the algorithm given below : 10 Scanf ("%d", & n) ; for (i =1; m= 3n ; i<m ; it = 2) {Printf ("%d In", i); for (j 1/10 m= Y5 ; j <=m ; j++) {Printf ("%d In", j); H Calculate the complexity of the following code by using Big '0' notation. Also, compute the overall complexity of this code. MCS-021 1 P.T.O. (b) Using Dijkstra's algorithm, find the shortest path between A and F for the following graph. Show the intermediate steps also. C 10 E Sort the following numbers using Quick sort 10 algorithm. Show all intermediate steps. 10, 70, 2, 32, 11, 48, 6, 19 Write a program for multiplication of two polynomials using linked list. Assume the two polynomials of degree 'm' and degree 'n' respectively. 2. 10 (a) Construct a binary tree using the following pre-order and in-order sequences : 10 Pre-order : 35, 31, 15, 7, 33, 32, 43, 38, 40, 49 In-order : 7, 15, 31, 32, 33, 35, 38, 40, 43, 49 (b) Differentiate between singly linked list and Doubly linked list. Write algorithm to insert and delete elements in a singly linked list. MCS-021 2 10 (a) Write an algorithm to implement DFS and 10 BFS spanning tree. Also, find the spanning trees for the given graph using your algorithms of DFS and BFS. (b) Sort the following data using heapsort. Show various steps of sorting. 40, 86, 32, 99, 41, 56, 74 10 (a) What is a circular queue ? Write an 10 algorithm to insert and delete a node in a circular queue. Show the working of your algorithm using following data. Irfsert Nodes : 12, 8, 15, 7 Delete node : 8, 7 Prove that the height "h" of a complete 5 binary tree with n nodes is h=10g 2 (n + 1). What are the differences between sequential 5 and direct file organisation ? Under what conditions, if any, is it advantageous to have the file organised as a direct file rather than sequential file ? MCS-021 3 P.T.O. 5. Write short notes on the following with an example : 5x4=20 Red Black Tree Multiple stacks Applications of Tree Kruskal's Algorithm . (e) Binary search -o0o- MCS-021 4

Formatting page ...

Additional Info : Mca - I (sem 2) December 2009 Question Paper - Data And File Structures(Revised Course)
Tags : mca exam papers, mca question papers, ignou mca question papers, ptu mca question papers, mca sample question paper, mca mumbai university question papers, mca exam syllabus, mca exam question paper, online mca exam papers, online mca exam preparation, mumbai university mca question papers, ignou university mca question papers

mca_india chat

Horizontal lines at:
Guest Horizontal lines at:
AutoRM Data:
Box geometries: