MSCCS-07
June 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 Type 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 Non Linear data structure?
What is Recursion?
What is limitation of linear queue and how to overcome by circular queue?
Name various methods to traverse a Tree.
Name any two non-homogeneous data structures.
What is Big O and small o in analysis of algorithms?
What is the prerequisite for binary search?
597
MSCCS-07 300 4 (P.T.O.)
MSCCS-07 300 4 (Contd.)
597
(viii) What is pendent node in a graph?
What is AVL-Tree?
Name various methods to traverse a 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.
Write algorithm/program segment to check if two arrays
of equal size are identical or not. Where two arrays
are said to be identical if corresponding elements are same in
both the arrays.
Write algorithm/sub-program to check if the given stack is
overflow or underflow.
Write a program/algorithm to check if the array is already
sorted or not. Find its complexity also.
For the given tree in Fig. No. 1 write any two traversals.
Fig. No. 1
MSCCS-07 300 4 (P.T.O.)
597
Write algorithm/program to search a number in the matrix of
MxN using any one technique.
Write statements to display the contents of a given doubly
linked list.
What is spanning tree? For a given graph in Fig. No. 2 obtain
any two spanning trees, and their distance.
Fig. No. 2
Write a program/algorithm to count number of leaf nodes in
the tree given in Fig. No. 1.
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) Generate prime numbers between 5 and 100 using dynamic
programming.
MSCCS-07 300 4
597
11) Write a program/algorithm for test followings in a circular
queue:
Empty or Not
Full or Not
Only single Elements or more.
12) Write a program/algorithm for simple merge.
13) What is the difference between static and dynamic data
structure? Explain using two examples for each of them.