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

End-Term exam
Paper Code: MCA-102 Subject: Data Structure
Second Semester [MCA] – MAY 2005
Time: three Hours Maximum Marks: 60
Q. one (a) describe B-Tree
(b) Convert subsequent infix expression into prefix and postfix
A* (B + C) * D/E .
(c) provide the difference ranging from external and internal sorting. provide names of a few
external sorting techniques.
(d) describe stack and provide a few application s of stacks.
(e) How many nodes are there on level I of a binary tree? Prove the ans.
(f) describe transitive closure of a graph.
(g) describe inverted files.
(h) define adjacency list representation of graph with the help of an example.
(i) provide 2 examples of Hash function.
(j) provide difference ranging from complete and full binary tree.
UNIT - I
Q. two How polynomial are represented using linked list. Write program for addition of
two polynomials represented using linked list.
Q. three discuss with the help of algorithm how infix expression converted to postfix
expression using stack.
UNIT - II
Q. four Write Prim’s algorithm for finding minimum cost spanning tree. Show its
working on a graph.
Q. five discuss how trees can used for representation of disjoint sets. discuss Union of
obtain operations on these sets.
UNIT - III
Q. six discuss Merge sort algorithm and show its working on subsequent members
4, 10, 2, 6, 8, 12, 5, 7
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.
Q. seven What is hashing? elaborate different kinds of Hash functions? elaborate different
methods of collision resolution?
UNIT - IV
Q. eight What do you mean by file organization? discuss different file organization
techniques.
Q. nine Write short notes on any 2 of the subsequent Index techniques –
(d) Cylinder surface indexing
(e) Hashed Indexes
(f) Tree indexing.

Earning:   Approval pending.