Sikkim-Manipal University of Health Medical and Technological Sciences (SMUHMTS) 2008 M.C.A Computer S.M.UAssignment s . -university exam paper

MC0052 – 01
Marks: 20
DATA AND FILE STRUCTURE


1. Sort the subsequent array: [4]
99 88 77 11 22 33 66 44
Using:
a) Insertion Sort b) Selection Sort
(Show all the possible passes)
2. Explain Quick Sort with the help of an example. [4]
3. What is a Binary Search Tree? discuss in brief the Searching in a Binary Search Tree. [4]
4. Find the Inorder, Preorder and the Postorder traversals of the subsequent Binary Tree. [4]

5. Explain in brief the insertion in a B-Tree with the help of an example. [4]

MC 0052 – 02
Marks: 20
DATA AND FILE STRUCTURE


1. Define the subsequent terms: [5]
a. FAT
b. Track
c. Sector
d. Cluster
e. Seek Time
2. What is Collision? discuss in brief various collision resolution methods. [4]
3. Explain Kruskal’s algorithm to obtain the minimum spanning tree with the help of an example. [4]
4. Given a Sorted array: [4]
8 13 17 26 44 56 88 97
Using Binary Search method obtain the element 13. Show the contents of high, low and mid at every step.
5. Explain Push and Pop Operation in a Stack. [3]

Earning:   Approval pending.