Dr. A.P.J. Abdul Kalam University MCA II Sem (3 Year) Data Structure [MCA203] June 2021 Question Paper

Dr. A.P.J. Abdul Kalam University

Master of Computer Application

Second Semester Main Examination, June-2021

Data Structure [MCA203]

Time: 3:00 Hrs Max Marks 70

Note : Attempt all questions.

Q.1 (a) Implement the push and Pop operation on a stack.

(b) Compare and contrast exponential time complexity with polynomial

time complexity.

 OR

(a) Define AVLTree.

(b) What is doubly linked list? Compare doubly linked list and singly

linked list?

Q.2 (a) Describe Kruskal’s minimum cost spanning tree algorithm?

 (b) How can graph traversal procedures help in detecting graph connectivity?

OR

(a) Write a program to evaluate a postfix expression using a linked stack

implementation.

 (b) Explain the working of binary search.

Q.3 (a) Distinguish between best, worst and average case complexities of an

 algorithm.

 (b) How are push and pop operations implemented on a linked stack?.

 OR

 (a) Write an algorithm to insert a node into a binary search tree.

 (b) How is the deletion of a node that has both left and right sub trees,

undertaken in a binary search tree?

Q.4 (a) Compare and contrast exponential time complexity with polynomial time

complexity.

(a) Implement a DE queue DQUE in a one dimensional array.

Q.5 (a) How is binary search tree representation of lists advantageous over their

sequential list representations?

(b) Distinguish between internal sorting and external sorting

Scanned Copies:

Share This