M.C.A. DEGREE EXAMINATION, MAY 2017
(First Year)
DATA STRUCTURES
Time 3 Hours Maximum Marks 70
SECTION A × 15 45)
Answer any three questions
Q1) What is a structure? How to create, store and access structure elements? Illustrate with
suitable example?
Q2) Write an algorithm for insertion and deletion of a node from double linked list and also
discuss applications of linked lists.
Q3) Write pseudo code of FRONT and REAR functions for the queue using arrays.
Q4) Draw a binary search tree whose elements are inserted in the following order:
50, 70, 90, 93, 100, 20, 10, 12, 25, 51, 15, 95.
And also mention its subroutines.
Q5) Explain quick sort algorithm and also sort the following list of element by quick sort
procedure.
67, 12, 89, 26, 38, 45, 22, 79, 53, 61.
SECTION B × 4 20)
Answer any five questions
Q6) Write short notes on pointers.
Q7) Write about linear and non-linear data structures.
Q8) How can stacks be used to check whether an expression is correctly parenthized or not.
Q9) Briefly explain about circular queue.
Q10) Construct binary tree from the following information:
In-order 50, 10, 30, 90, 60, 80, 40, 20, 70
Pre-order 60, 10, 50, 90, 30, 40, 80, 70, 20
Q11) Write an algorithm to test whether a given binary tree is a binary search tree.
Q12) Write about selection sort procedure.
Q13) Implement binary search using recursion and find its complexity.
SECTION C × 1
Answer all questions
Q14) How to create dynamic array?
Q15) Define priority queue.
Q16) Define complete binary tree.
Q17) Define recursion.
Q18) Define in-order and post-order of tree traversing.