Master of Computer Application I (Science)
Examination: Oct Nov 2016 Semester II (New CBCS)
SLR No. Day
Date Time Subject Name Paper
No. Seat No.
SLR U
07
Saturday
19/11/2016
10:30 A.M
to
01:00 P.M
Data Structures
C

Instructions: Question no. 1 2 are compulsory
Attempt 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 most correct alternatives. 10
In case of complete binary tree with N nodes has depth
Consider linked list of n elements which is pointed by an external pointer. What
is time taken to insert the element which is successor of the element pointed by a
given pointer?
In case of binary searchif target value is less than middle then we change
End=middle-1 Start=start+1
Start=middle+1 End=start+1
Running out of memory may occur due to
Non-recursive function call Recursive function call
Use of global variable None of these
A Non linear collection of data element in hierarchical manner is
Tree Linked list
Primitive list Stack
A connected graph T with cycles may be called as
A tree Free tree
Graph All of above
Which of the following abstract data type can be used to represent a
one-to-many relations?
Tree only Graph only
Both a b None of these
Page 1 of 2
Which of the following statement is False?
Every free is bipartite graph
A tree contain cycle
A tree with n nodes can contain n-1 edges
A tree is connected graph
If every node u in G adjacent to every other node v in A graph is said to
be
Isolated Complete
Finite Strongly connected
10) Which of the following sorting technique is slowest?
Quick sort Heap sort
Shell sort Bubble sort
State true or false 04
Complexity of linear search is 0 (log2n).
Binary may be applying on unsorted data.
Greedy algorithm works by taking a decision that appears best at the
moment.
Height depth of tree may be different.
Q.2 What is binary tree? Explain linked representation with example. 06
Sort following data using bubble sort 23,12,20,42,88,92,8,56. Give analysis. 08
Q.3 What is data structure? Explain linear Non-linear data structure. 06
Explain tree traversal with appropriate example. 08
Q.4 What is stack? Explain basic operation on static stack using appropriate
function.
06
Explain concept of polynomial arithmetic with linked list. 08
Q.5 Write is circular Queue? Explain process of inserting deleting node from
circular queue.
06
What is linear search? Write an algorithm for linear search in linked list? Give
one example.
08
Q.6 What is Hashing? Explain different hashing functions with example. 06
What is traversing? Explain traversing technique in graph. 08
Q.7 What is an AVL tree? Explain AVL rotations with example. 06
What is an abstract data type? Explain List ADT, Stack ADT Queue ADT 08