Roll
No....................
Total
No. of Questions : 07
MAY 2014
BCA (Sem. – 2nd)
DATA STRUCTURES
SUBJECT CODE: (BC -
204)(N-2)
Time
: 03 Hours
Instruction
to Candidates:
1) Section - A is
Compulsory.
2) Attempt any Four
questions from Section - B.
Section - A
1.
a. What
is an algorithm? State its features.
b. Define
Big O Notation?
c. Differentiate
between LIFO lists and FIFO lists.
d. What
are priority queues?
e. Define
garbage collection.
f. Define
prefix. infix and postfix notations
g. What is recursion?
h. Applications
of trees.
i. Describe
various stack operations in brief
j. What
are the various Binary tree traversal techniques?
Section –B
2.
a. What
are data structures ? name various data
structure and various operations
performed on them.
b. How
to find complexity of an algorithm? What is the
relation between and space
complicity of an algorithm.
3. Define
single linked lists. How are they stored in memory? Write an algorithm to
insert a node at the beginning of a single linked
list.
4. What
is quick sort technique ? give algorithm and example in
support of your answer.
5. What
are queues? How are queues implemented in memory ?
what are the various queue
operation? Write algorithms for each.
6. Differentiate
between linear and binary search
techniques.
Explain with examples. Write an algorithm to perform linear
search
on a list of N numbers.
7.
a. What
are binary tress? Enlist and explain in brief about various binary tree
traversal techniques.
b. A
Binary Tree T has 9 nodes:
Inorder: E A,C,K,F,H,D,B,G
Preorder: F,A,E,K,C,D,H,G,B
Draw
the tree T and write its post order traversal .
0 comments:
Post a Comment
North India Campus