B.C.A. (Semester III) (CBCS) Examination Mar/Apr-2018
DATA STRUCTURES USING
Time: 2½ Hours
Max. Marks: 70
Instructions: All Questions are compulsory. Figures to the right indicate full marks.
Q.1
Choose the correct alternatives:
14
is Non-linear data structure.
Array
Stack
Queue
Tree
Which of the following lined list has NULL pointer?
Singly linear
Singly circular
Doubly Circular
None of these
If front rear then linear queue is
Full
Empty
Non-full
Non-Empty
In case of algorithm, a main problem is breakdown into two or more sub-problems.
Branch bound
Greedy
Divide conquer
None of these
Which of the following is not application of stack?
Reversal of string
Evaluation of Postfix expression
CPU scheduling
Matching parenthesis in an expression
In binary tree, the degree of node is zero.
Leaf
Non-Leaf
Internal Node
Non-terminal
The dissimilar elements are grouped into
Array
String
Both a and b
Structure
Node of linked list contains two parts.
Singly
Doubly
Both a and b
None of these
The amount of time taken by the program for execution is called complexity.
Space
Memory
Time
Both a b
10) If one hash function generates same hash address for different keys then it is called?
Static binding
Run time binding
Collision
Both a b
Page 2 of 2
SLR-SR-12
11) In case of queue, intrinsic ordering of element does not determine its result.
Linear
Circular
Priority
Deque
12) data structure is useful for polynomial manipulations.
Stack
Queue
Linked list
Both a b
13) search method is applicable over sorted as well as unsorted data.
Linear
Binary
Both a and b
None of these
14) To sort elements bubbles sort requires maximum successful swapping.
3
4
2
1
Q.2
Solve any seven from the followings:
14
Why sorting is necessary?
Why queue is called FIFO data structure?
Write importance of header node in linked list.
List out applications of tree data structure.
Define 'two dimensional' array and write its declaration syntax.
Differentiate between linear non-linear data structure.
What is complete binary tree?
Why circular queue is better than linear queue?
What is Static dynamic memory allocation?
Q.3
Solve any two of the followings:
10
Implement function that counts and display leaf nodes of binary tree.
Write algorithm that converts infix expression to postfix expression.
Explain 'Selection sort' method with example.
Write a program that finds addition of only odd numbers in an array.
04
Q.4
Answer any two of the followings:-
14
Write a program to implement linear queue.
Explain 'Threaded binary tree' with its types.
What is Linear linked list? Explain its following operations:-
insert
Search()
remove_after()
Q.5
Answer any two of the followings:-
14
Write a program that converts decimal number into binary number using stack.
Explain node delete operation of binary search tree with following cases
Deleting leaf node
Deleting node having one child
Deleting node having two children
Write a program to implement Input Restricted Deque with its basic operations.