Master of Science I (Computer Science) Examination: Oct/Nov
2016 Semester I (New CBCS)
SLR No. Day
Date Time Subject Name Paper
No. Seat No.
SLR SC
300
Friday
18/11/2016
10.30 AM
to
01.00 PM
Data structure
C
HCT 1.2
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 correct alternatives 10
The step count is the maximum number of steps that can be
executed for the given parameter.
Best Case Worst Case
Average Case None of the above
Theta notation is used to denote
Lower Bounds Upper Bounds
Upper and Lower Bounds None of the above
Sorting is done on data which is stored in called as External
Sorting.
Main Memory Auxiliary Memory
Register None of the above
is a finite ordered set of homogenous elements.
Tree Graph
List Array
refers to a set of elements which may be finite or infinite.
Abstract Data Type Data Structure
Data Objects Data Type
The function which calls itself is called
Reserve function Recursive function
Return function None of the above
A large collection of structured information is called a
Data structure Array
Database None of the above
Computer memory is
Quadratic Linear
Non-linear Cubic
A step by step procedure to solve a problem is called as
Data structure Problem server
Algorithm Procedural language
Page 1 of 2
10) If non-zero elements are less in count, then such matrix is called
Identity Matrix Row Matrix
Triangular Matrix Sparse Matrix
True or False 04
In the prefix form, the operator precedes the two operands
The stack operates in Last in first out.
Tower of Hanoi is example of recursion
An array is static data structure
Q.2 Write a short note 08
Linked List
Non Linear Data Structure
Answer the following 06
What do you mean by Primitive Data Type?
What is the efficiency of Bubble sort?
Q.3 Answer the following
Define term Singly Linked List? State and explain in detail the various
operations on Singly Linked List with suitable example?
Explain with example representation of stack using linked list.
07
07
Q.4 Answer the followings
Define the term Queue? Explain in detail insertion and deletion at Dequeue
with suitable example?
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: B F G A C D E
07
07
Q.5 Answer the followings
Define the term Sorting? Perform merge Sort and show the result in passes
on following series.
Series 19, 20, 10, 13, 10, 29, 16, 39
Define Array? Discuss representation and applications of Single and
Multidimensional Array with suitable example?
07
07
Q.6 Answer the following
Write down Breadth First search algorithm with suitable example?
Write down the counting sort algorithm? Sort the series 5 8 6 2 1 3 using
counting sort algorithm
07
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 b h
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 digit 2 in it
Series 15, 10, 13, 12, 19, 6.