Roll
No....................
Total
No. of Questions : 07
Paper ID [B0208]
(Please fill this Paper
ID in OMR, Sheet)
BCA (Sem. – 2nd)
DATA STRUCTURES (BC -
204)
Time
: 03 Hours
Instruction
to Candidates:
1) Section - A is
Compulsory.
2) Attempt any Four
questions from Section - B.
Section - A
Q1)
a) What is
problem analysis? Explain.
b) What is Big
Oh notation? Explain its use.
c) Explain the
terms Overflow and Underflow.
d) What is
queue? How it can be represented in memory?
e) Explain
various advantages and disadvantages of linked list over after.
f) Write an
algorithm to insert node at the beginning of linked list.
g) What is
linear search? How it is different from binary search?
h) What is
binary tree? How it is different from heap tree?
i) What is bubble
sort? Write an algorithm to sort an affray using bubble sort.
j) What is tree?
What are various applications of Tree?
Section - B
Q2) what is data and data structure? Explain
different categories
of data structures. Also explain various common operations
that can be applied to data structure.
Q3) Explain
how Stack can be implemented using any and linked list?
Q4) what
is insertion sort? write an algorithm to sort a list using
Insertion sort'
Q5) What
is circular linked list ? Write an algorithm.
·
To insert a node at the
beginning of circular linked
list'
·
To insert a node at the
beginning of circular linked
list'
Q6) Write
and explain post-order traversal algorithm of binary
tree'
Q7) What
is Desuetude and priority queue? Explain their
applications'
0 comments:
Post a Comment
North India Campus