MSCCS-07
December Examination 2016
MSCCS (Final) Examination
Data Structure and Algorithm
Paper MSCCS-07
Time 3 Hours Max. Marks 100
Note: The question paper is divided into three sections B and C. Write answers as per given instructions.
Section A 10 × 2 20
(Very Short Answer Questions)
Note: Answer all questions. As per the nature of the question delimit your answer in one word, one sentence or maximum upto 30 words. Each question carries 2 marks.
What is the meaning of base address?
Name various methods to traverse a TREE.
Minimum number of queues needed to implement the priority queue.
Define stack.
What is the meaning of dynamic and static binding?
Define Binary Search Tree?
In an AVL tree, at what condition the balancing is to be done?
597
MSCCS-07 300 3 (P.T.O.)
MSCCS-07 300 3 (Contd.)
597
(viii) What is an array?
What is Recursion?
What is a connected graph?
Section B 4 × 10 40
(Short Answer Questions)
Note: Answer any four questions. Each answer should not
exceed 200 words. Each question carries 10 marks.
Explain the basic operations on stack?
What is Data Structure? Explain in detail.
Explain basic operations on queue.
What are common operations that can be performed on a
data-structure?
Explain the Prim's Algorithm with example.
What is sorting? Describe any one type of sorting.
Which data structures are used for BFS and DFS of a graph?
Explain.
Describe the vertex cover problem with suitable example.
MSCCS-07 300 3
597
Section C 2 × 20 40
(Long Answer Questions)
Note: Answer any two questions. You have to delimit your each
answer maximum upto 500 words. Each question carries
20 marks.
10) Perform a quicksort on the following list of integers. Show your
work. Make sure you specify what happens with the pivot at
each step. 15, 27,
11) What is an AVL tree? Explain the insertion and deletion
operation with example.
12) Describe the Breadth First Search and Depth First Search
traversal of graph.
13) Explain the sorting algorithms (any two) with suitable example.