Centre for Development of Advanced Computing(C-DAC) 2006 M.C.A Data Structure - Question Paper

End-Term exam
Paper Code: MCA-102 Subject: Data Structure
Second Semester [MCA] – MAY-JUNE 2006
Time: three Hours Maximum Marks: 60

Q. one (a) Differentiate ranging from the terms “variable” and “parameter”.
(b) Determine the length and number of substring of string ‘THREAD’.
A* (B + C) * D/E .
(c) obtain the number of elements in the array A (1:8, -5:5, -10:5). Which will be
the 1st and the last element of this array
(d) When is a link list better than arrays.
(e) Why infix expressions are converted into postfix expressions.
(f) “Circular Queues is better than linear queues”. Justify the statement.
(g) A provided binary search tree is to be sorted. Which traversal method should be
applied?
(h) Why searching is easier in sorted list.
(i) explain any 1 hash function.
(j) What is a B-tree?
Q. two (a) provided a linear sorted array having N elements and that it can store MAX
elements. Write an algorithm to insert the contents of ITEM into it.
(b) Consider a linked list described by begin. It has a node with address P. Write
an algorithm to split it into 2 link lists 1 starting with begin and 2nd has
P as into 1st node.
Q. three (a) The element of a binary tree.
Have to be stored in an array. Write the desired algorithm. Te output should also
indicate number of elements in the tree.
Paper Code: MCA-102 Subject: Data Structure
Note: ques. 1. is compulsory and is of 20 marks. Attempt 1 out of 2 ques.
from remaining 4 units. All ques. in units are of 10 marks every.
(b) obtain the path matrix using WARSHALL algorithm for the graph G.
Q. four (a) provided list of numbers organizes in the form of linear array 44, 33, 11, 51, 77,
90, 99, 22. Using quick sort algorithm obtain the element of the array when 44 is set
it position. Also explain the status of STACK.
(b) provided the sorted list in the form of linear arrays having N and M elements.
Write an algorithm to MERGE these lists into a single sorted list. The name of the
elements these are repeated is to be enumerated.
Q. five (a) What is file organization? Why it is needed. explain in detail sequential file
organization with its MERITS and DEMERITS.
UNIT – III
Q. six Write an algorithm to convert a provided infix expression into an equivalent portfolio
expression. Illustrate the working of the algorithm on the subsequent infix
expression.
((8*7) + 4) * (7+9)/6-10
Q. seven define any 2 of the subsequent algorithms:
(a) Kruskal’s Algorithm
(b) Shell Sort
(c) Polyphone Merge sort

Earning:   Approval pending.