D

B3D042 Pages: 2
Reg. No. Name:
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017
CS205: DATA STRUCTURES (CS, IT)
Max. Marks: 100 Duration: 3 Hours
PARTA
Answer all questions.
1. Derive the Big O notation for f(n) = 1212715. (3)
2. Write a recursive function(C / pseudocode) for linear search. (3)
3. What are the applications of a linked list? (3)
4. Compare a linked list and an array implementation of a general list. (3)
PART 8
Answer any two questions.
5. a. Write a function(C / pseudocode) to delete a node in a singly linked list. (4.5)
b. Derive the Big O notation using the step count for the function. (4.5)
6. Write a recursive algorithm to insert an element into ೩ linked list in which elements
are stored in ascending order. (9)
7. ൭. What do you mean by abstract and concrete data structures? (4.5)
b. Compare vectors and arrays in detail. (4.5)
PART C
Answer all questions.
8. What is a double ended queue? (3)
9. Explain any two applications of a Stack. (3)
10. What is a Binary Tree? (3)
11. What is the purpose of studying graphs as a data structure? (3)
PART D
Answer any two questions.
12. a. Write a function(C / pseudocode) to delete a sub-string in a given string. (4.5)
b. Give the DFS algorithm for graph traversal. (4.5)
13. a. Write a function(C / pseudocode) to insert an element into a BST. (4.5)

Page 1 of 2