M.C.A. (Science) (Semester II) (CBCS) Examination, 2017
DATA STRUCTURES
Day Date: Friday, 21-04-2017 Max. Marks: 70
Time: 10.30 AM to 01.00 PM
N.B.: 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
A two dimensional array int a contains elements.
2 4 8 16
Through Linked List one cam implement
Stack Queue Graph All of these
Priority Queue can be
Ascending Descending
Both and None of these
Which of the following is not a feature of Tree?
It is a Data Structure
It has a main node-root
It has only one path from a node to another node
It can have cycle
Stack is structure
LIFO FIFO FILO FCFS
The list with no nodes on it is called
Empty List Null List
Both and None of these
In Queues, the end form where items inserted is called
Rear Front Top Base
A is an ordered collection of items from which items may
be deleted at one end and onto which items may be inserted at the
another end
Stack Array Queue Graph
The address of the first element of an array is called
First Address Base Address
Initial Address Location Address
Page 1 of 2
10) When we traverse the tree in pre-order node is visited
first.
The top The end root binary
State whether True or False: 04
All the nodes are concentrated in the right sub tree while the left
sub tree is empty is called a right skewed tree.
A sparse matrix is a matrix having very few non-zero elements and
large number of elements are zero.
Children of the different parent are called siblings.
In DFS method, we display the tree level wise.
Q.2 Write short note on: 08
Sparse Matrix
Hash indexing
Answer the following: 06
What is Priority queue?
What is complexity of an algorithm?
Q.3 Answer the following:
Define the term Sorting, Perform selection sort algorithm to sort
following numbers in ascending order.
Datap:66, 35, 105, 13, 78, 55, 28, 86, 49, 65, 99, 23, 81, 44
07
Describe height balanced trees with example. 07
Q.4 Answer the following:
Explain Binary tree indexing 07
Define the term data type. Discuss in detail Primitive and Composite
data type with suitable example.
07
Q.5 Answer the following:
Discuss in detail meaning of Backtracking and its mechanism with
suitable example.
07
Perform Binary search and Linear search and show the results of the
both of the search on given series to find the digit 100 in it.
Series: 35, 98, 13, 89, 77, 55, 103, 613, 100, 19, 61.
07
Q.6 Answer the following:
Differentiate between Stack and Linked List 07
What is Queue? Explain its different types. 07
Q.7 Answer the following:
What is stack? Write an algorithm to push element in to a stack using
array.
07
Write a program to implement insertion operation on a singly linked
list.