M.Sc.(Computer Science)(Semester (CBCS) Examination, 2017
DATA STRUCTURES
Day Date: Thursday, 20-04-2017 Max Marks: 70
Time: 10.30 AM to 01.00 PM
Instruction: Question no. 1 and 2 are compulsory.
Attempt any 3 questions from Q. no. 3 to Q. no. 7
Figures to the right indicate full marks.
Q.1 Choose correct alternatives. 10
The count is the minimum number of steps that
can be executed for the given parameter.
Best case Worst case
Average case None of the above
Big-Oh notation is used to
Lower Bounds Upper Bounds
Upper and Lower Bounds None of the above
The function which calls itself is
Reverse function Recursive function
Return function None of the above
a tree means visiting all its nodes to get the
complete tree information.
Searching Traversing
Sorting None of the above
In we traverse the tree levelwise from left to right
starting from the root.
Depth First Traversal Breadth First Traversal
Left to Right Traversal Levelwise traversal
A large collection of structured information is called
Data structure Array
Database None of above
The time complexity of Bubble sort is

Sorting is done on data which is stored in called as
Internal Sorting.
Main memory Auxiliary memory
Register None of the above
Page 1 of 3
SLR- RG -330
When each array element is another array, it is called a
1D array 2D array
3D array Multidimensional array
10) Computer memory is
Quadratic Linear Non-linear Cubic
State True or False 04
The tree is linear data structure
In the infix form, the operator precedes the two operands.
The queue operated in First in first out.
Tower of Hanoi is example of recursion.
Q.2 Write short note of the following. 08
Need for Data Structure
Complexity of an algorithm
Answer the following. 06
Discuss the advantages and disadvantages of binary search.
What is the efficiency of Binary Search?
Q.3 Answer the following.
Define Array? Discuss the different ways of representing
two-dimensional Arrays in memory with suitable examples.
07
Discuss in detail how to satisfy the constraints to solve Tower of
Hanoi problem having three disks and three pegs?
07
Q.4 Answer the following.
Define the term Stack? Explain in detail insertion and deletion
operation in stack with suitable example.
07
What do you mean by Binary Tree? Construct a Binary tree from
given series and show the results of Pre-order, In-order and
Post-order traversing at constructed Binary tree.
Series: 2 4 1 5 7 3 20.
07
Q.5 Answer the following.
Define the term Sorting? Perform Bubble Sort and show the result
in passes on following series.
Series: 39, 43, 83, 66, 10, 91, 26, 55, 72, 100, 12, 60.
07
Define a linked list. Explain with example representation of queue
using linked list.
07
Page 2 of 3
SLR- RG -330
Q.6 Answer the following.
Discuss Breadth and Depth First search as a classical tree
traversing algorithm with suitable example?
07
Define Algorithm. Discuss the characteristics of an algorithm. 07
Q.7 Answer the following.
State the algorithm for conversion of Infix into Postfix string?
Apply the same on given infix expression show its conversion into
postfix string?
Infix Expression:
07
State the algorithm of Binary Search and Linear Search and also
show the results of the both of the search on given series to find
the number 55 in it.
Series: 35, 90, 13, 89, 77, 55, 10, 613, 10, 19, 61.