BCA PART II
Subject:- Data Structure
Paper :- 201
Unit 1
Q1a)Define time
and space complexity of an algorithm. 5
b)what is stack?explain the push and pop
opetaion algorithms on stack. 5
Q2.a)what is the
reason of using circular queue? Explian the insertion and deletion
algorithm on circular queue. 5
b) conver following infix into 1) prefix
2)postfix notation. 5
i)(a+b*(c+d)) ii)
a*b-c+(e+f)*g-h
Unit
2
Q3.Explain the
all the cases of insertion and deletion operation in link list with the help of
algorithm. 10
Q4.a)Explain the
link list representation of Queue. 5
b) Write an algorithm to insert a node in
doubly link list at a specified position. 5
Unit
3.
Q5.a)What do you
mean by binary tree? Explain the basic terminology of binary tree. 5
b) Explain the traversal in binary tree. 5
Q6.what is
height balance binary tree and B-tree? 10
Unit
4.
Q7. explain
binary search and sequential search. 10
Q8.Explain
bubble sort and quick sort. 10
Unit
5
Q9.Explain graph
traversal algorithm. 10
Q10.a)Explain
minimum spanning tree . 5
b) write shortest Path algorithm 5
No comments:
Post a Comment