M.C.A. (Semester II) (CBCS) Examination Oct/Nov-2017
Science
DATA STRUCTURES
Day Date: Monday, 20-11-2017 Max. Marks: 70
Time: 10.30 AM to 01.00 PM
Instructions: Question 1 and 2 are compulsory.
Attempt any Three from Q.3 to Q.7
Figures to the right indicate full marks.
Q.1 Choose the correct alternatives: 10
Which of the following is not used as a data structure?
Array Linked List
Graph Directory
Which of the following term is related to the stack?
TOP PUSH
POP All of these
In a linked list,
Each link contains a pointer to the next link
An array of pointers point to the link
Each link contains data or pointer to links
The links are stored in an array
A heap allows a very efficient implementation of a
Double Ended Queue Priority Queue
Stack Trees
Moving through all the nodes of a tree is called as
Tree Traversal Tree Rotation
Binary Tree None of these
The smallest element of an array's index is called its
Smallest Bound Lower Bound
First Bound Higher Bound
In Queues, the items deleted at one end are called
Rear Front
Top Base
Each item in a linked list is called
Element Information
Data Node
Method of graph traversal
DFS BFS
Both and None of these
Page 2 of 2
SLR-SM-8
10) Which of the following statement is not true regarding graph?
A graph consists of a set of nodes and a set of arcs
A graph is a tree
A tree is a graph
Graphs can be directed
State whether True or False: 04
DS refers to a set of elements which may be finite or infinite.
Traversal is the method to reach every vertex of a graph.
Stack is FIFO structure.
The descendents of a node are all the nodes along the path from the
root to that node.
Q.2 Write short note on: 08
Data structure.
Linear Search.
Answer the following: 06
What is binary tree?
What is complexity of an algorithm?
Q.3 Answer the following:
Explain representations of single and multidimensional array with suitable
example.
07
Define Linked List data structure. What are the basic operations that can
be performed on a singly Linked List?
07
Q.4 Answer the following:
Write a program in C to implement stack using linked list. 07
Sort following data using bubble sort: 23, 12, 20, 42, 88, 92, 56. Give
analysis.
07
Q.5 Answer the following:
Evaluate the following postfix expression using stack.

07
Construct a Binary tree from given series and show the results of In-order
and Post-order traversing at constructed Binary tree.
Series: 39, 43, 83, 66, 10, 91, 26, 55, 72, 100, 12, 60.
07
Q.6 Answer the following:
Differentiate between Array and Stack. 07
Differentiate between Queue and Linked List. 07
Q.7 Answer the following:
Explain B Tree indexing and hash indexing. 07
Define the term Queue. Explain in detail insertion and deletion at in queue. 07