Total No. of Questions 10] [Total No. of Pages 01
P.G. DIPLOMA DEGREE EXAMINATION, MAY 2017
COMPUTER APPLICATIONS
Data Structures
Time 3 Hours Maximum Marks 70
Answer any five questions
All questions carry equal marks
Q1) Explain about arrays and structures with suitable example.
Q2) What is pointer? Describe advantages and disadvantages of pointers?
Describe any five string handling functions?
Q3) Explain about circular queue, priority queue and de-queue's with suitable example.
Q4) How to create node in double linked list? Explain about different operations of double
lined list.
Q5) What is Recursion? Illustrate how the stack is used to implement recursion with example.
Q6) Implement stack operations using single linked list and also describe the applications
of stacks.
Q7) Consider the following list elements: 67, 12, 89, 26, 38, 45, 22, 79, 53, 61 sort these
elements using selection sort.
Q8) Explain about sub-routine of merge sort with suitable example.
Q9) 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 describe tree operations.
Q10) Explain about different searching techniques with example.