Questions : BCA 2nd Year (Magadh University)
Paper IV
1. a) Define deferent data structure operations also define
linear and non-linear data structures
b) Explain time complexity
of algorithm.
c) Explain time mean
by an array give their characteristic features.
2. a) what do you mean by an array? Give their
characteristics features.
b) what is
stack? How is it different from queue? what are the possible operations thhat
can be
performed on the stack?
3. Define
binary search tree. how can it be stored in computer memory as lan array? give suitable
example?
4. What are the different types
01 sorting ? give algorithm for bubble sort. also calculate the complexity.
5. What is linked list? how is it
different from array? how can insertion and deletion operation be performed
in the linked list?
6. Differentiate among graph Tree,
binary tree and complete binary tree.
7. Construct the given infix expression
into postfix expression
A+ (B*C-(D/E^F)*G)*H
8. Write the algorithm of quick
sort and calculate the complexity of quick sort in wrost case.
9. Write the algorithm of kruskal
and prim's for minimum spanning tree.
10. Write short notes on any
three of the following-
a) Depth and
breath first search
b) Hash table
and collision resolution technique
c) Heap Sort
d) Traversal of binary
tree.
Subscribe to:
Post Comments
(
Atom
)
thank you Sr. Ji
ReplyDeleteyou welcome
Delete