GUG/W/18/10769 1 P.T.O
Master of Computer Management (M.C.M.) (CBCS Pattern) Second Semester CBCS
PCMCMT104.2 Paper-IV Elective-II: Data Structure File System
P. Pages 2 GUG/W/18/10769
Time Three Hours Max. Marks 80

Notes 1. All questions are compulsory and carry equal marks.
2. Draw neat and labelled diagram and use supporting data wherever necessary.
3. Avoid vague answers and write specific answer Related to questions.
1.
Either:

Define data structures. Explain what is algorithm and approaches for designing algorithm.
8

Define Array and Explain types of array in detail.
8
OR

What is algorithm analysis and explain Big-O Notation in detail.
8

Write an algorithm to scan all the elements in array.
From Beginning ii) After Rotation
8
2.
Either:

Define recursion and Explain properties of recursion in detail.
8

Write an algorithm to insert an element at the FRONT of the queue.
8
OR

What is Tower of Hanoi problem. Explain all the moves involved in moving three disks from source to destination.
8

What is linked list. Explain algorithm to delete the node from given linked list.
8
3.
Either:

Define Tree what is AVL tree or heighted balanced tree and Explain algorithm to insert a node in AVL tree.
8

Define Graph. What is Warshall's algorithm. Explain spanning tree with an example.
8
OR

What is complete binary tree. Explain algorithm to search a node in a binary search tree.
8

What is traversing of a Graph and Explain Breadth first search algorithm in details.
8
*2923*
GUG/W/18/10769 2
4.
Either:

What is sorting. Explain quick sort with an example.
8

What is searching. Explain binary search with an example.
8
OR

What in insertion sort. Write an algorithm to explain insertion sort in detail.
8

What is interpolation search. Explain an algorithm to search an item using Interpolation method.
8
5.
Solve all the questions.
Write short note on brute force algorithm.
4
Explain Link representation of stack in detail.
4
What is minimum spanning tree and explain kruskal's algorithm with an example.
4
Write a short note on Topological Sort with an example.
4