Master of Science I (Computer Science)
Examination: Oct Nov 2016 Semester I (Old CBCS)
SLR No. Day
Date Time Subject Name Paper
No. Seat No.
SLR SC
307
Wednesday
23/11/2016
10:30 AM
to
01:00 PM
Data Structure
C
IV
Instructions: Q.No.1 and 2 are compulsory.
Answer any three questions from Q.No.3 to Q.No.7.
Figures to the right indicate full marks.
Total Marks: 70
Q.1 Choose the correct alternative: 10
Which of the following data structure is not linear data structure?
Arrays Linked lists
Both of above None of above
Finding the location of the element with a given values is
Traversal Search
Sort None of above
Which of the following data structure store the homogeneous data
elements?
Arrays Records
Pointers None of above
When a data are to be deleted from a data structure, but there is an absence
of data then this situation is usually called.
Saturated Overflow
Houseful Underflow
The merge sort uses following strategy to sort the elementsa)
Divide and law strategy Divide and multiply strategy
Divide and concave strategy Divide and concurrent strategy
Which of the following name does not relate to stacks?
LIFO list Push-down lists
FIFO lists None of above
The algorithm is "greedy" in the sense that it always chooses
the closest vertex to the source among those whose shortest path is not yet
known.
Dynamic programming Branch and bound
Binary search tree Dijkstra's shortest path
A char is a data type and capable of holding one character in
the local character set.
String Single byte
User defined Strange
The is balanced when all the balancing factors of all the nodes
are +1.
General tree Binary tree
Forest tree Spanning tree
Page 1 of 3
10) uses 7 bit character code so characters may be viewed as
"digits"
American Standardization Coding for Internet Information
African Standard Code of Information Interchange
Asian Standard Code for Information Exchange
American Standard Code for Information Interchange
State true or false 04
Data and space measures for the efficiency of an algorithm.
Queue data structure has variant that can be used for the purpose of
expression conversion.
A dynamic programming is a name that comes from control theory and is
nothing but filling-in of a table of sub problems to get a solution to a given
problem and
Circular Lined list can be represented by using the first field of each cell to
point to the left child and the second field to point to the right child.
Q.2 Write a short note on 08
Data structure
Priority queue
Answer the following 06
What do you mean by Sparse Matrix?
Briefly explain doubly Linked List?
Q.3 Answer the following:
Define the term sorting. State and perform Bubble sort algorithm to sort
following numbers in ascending order
49, 65, 99, 23, 105, 13, 78, 55, 28, 100, 66, 35, 86, 19, 60, 25
07
Define the term tree. Discuss the Depth First Search algorithm for tree
traversing with suitable example.
07
Q.4 Answer the following
Define the term singly Linked List. Explain in detail atom insertion and
deletion operation in the Circular Linked List with suitable example.
07
Define the term stack. Illustrate a Tower of Hanoi Problem and its solution
having three disks and three pegs.
07
Q.5 Answer the following:
State the meaning of Data type? Discuss in detail Primitive and Composite
data type.
07
Illustrate and discuss the algorithm for the conversation of infix arithmetic
expression into postfix expression using stack on given expression
L A Z E M
07
Q.6 Answer the following:
Discuss in detail the differentiation between Queue and Dequeue with suitable
example.
07
Define the term Backtracking. Explain in detail the mechanism of
Backtracking with suitable example?
07
Page 2 of 3
Q.7 Answer the following:
State and discuss in detail Arrays as a structure with suitable example. 07
Define the term Binary tree. Illustrate the process of Pre-order, In-order and
Post- order traversing