Spring 2012

Master of Computer Application (MCA) Semester II MC0068 Data structutes using C 4 Credits
(Book ID: B0701 & BO702)

Assignment Set 1 (40 Marks)

Questions From Book-ID : B0701 1. Write the advantages of implementation checks preconditions. [ 5 Marks]

2. Discuss the STACK operation with Suitable example and Show how to implement stack operations of integer in C by using array. 3. Discuss how Queues are differ from Stack. Questions From Book-ID : B0702 4. Explain the AVL Tree with suitable example? [ 4 Marks] [ 10 Marks] [ 5 Marks]

5. Insert the keys in order show into an initially empty VAL tree. And show the sequence of trees produced by these insertions. A,Z,B,Y,T,M,E,W,D,G,X,F,P,O,C,H,Q,S [ 6 Marks]

6. Explain the adjacency Matrix and adjacency List with suitable example. [ 5 Marks] 7. Write a algorithm for the followings: i. Dijkstra Algorithm ii. Bellman-Ford Algorithm [ 5 Marks]

Spring 2012

Master of Computer Application (MCA) Semester II MC0068 Data structutes using C 4 Credits
(Book ID: B0701 & BO702)

Assignment Set 2 (40 Marks)

Questions From Book-ID : B0701 1. Illustrate to implement dqueue using circular linked list. [ 10 Marks]

2. .What do you mean by searching? Define searching problem and how do you evaluate the performance of any searching algorithm? Questions From Book-ID : B0702 3. Compare and contrast DFS and BFS and DFS+ID approaches [5 Marks] [ 10 Marks]

4. Discuss how Splay Tree differs from a Binary Tree? Justify your answer with appropriate example. 5. Write note on : i. Threaded lists ii. Dynamic Hashing [ 10 Marks] [5 Marks]