2014 B Tech Computer Science and Engineering CS216  Data Structures Using C (DS)  Question Paper  November 2014  CSE  B.Tech  Acharya Nagarjuna University Question paper
The question paper shown below is one of the old question papers of Acharya Nagarjuna University  B.Tech  CSE  CS216  Data Structures Using C (DS). If by any chance, you are looking for such an old question paper, you are in luck. This is the original question paper of the II/IV B.Tech  1st semester students of Acharya Nagarjuna University conducted in November 2014. You are free to download or print this paper inorder to use it in your examination preparation.
[Total No. of Questions : 09]
CS/IT 216 (CR)
II/IV B.Tech Degree Examinations, November 2014 First Semester CS/IT Data Structures Using C
Time : 3 hours
Maximum Marks : 70
Answer question No.1 Compulsory Answer ONE question from each Unit
1. Briefly explain following [7 x 2 = 14M] a) Big O notation. b) Advantages of doubly linked list over singly linked list. c) Convert the following infix expression (a * b  c) / d * (f  g) / h d) Time complexity of merge sort. e) Expression tree. f) Binary heap. g) Open addressing.
UNIT  I [1 x 14 = 14M] 2. Write a program in C to implement Doubly linked list. (OR) 3. Explain how a polynomial ADT can be implemented and write a program to implement polynomial addition.
UNIT  II [1 x 14 = 14M] 4. Write an algorithm to convert the given infix expression to postfix and explain the trace of the algorithm on the expression (a + b)  c / d * (e / f) (OR) 5. a) Write a program to implement shell sort and give a trace of the algorithm on 19,15,12,7,3,4,13,18,99,10,8,100. 5. b) Explain the purpose of external sorting methods.
UNIT  III [1 x 14 = 14M] 6. Write a program to implement binary search tree and give a trace how the BST can created while inserting the elements 19,15,12,7,3,4,13,18,99,10,8,100 followed by the deletion of 18,100,13. (OR) 7. a) What is a height balanced tree and write the code to insert an element into an AVL tree. 7. b) What are the different single rotations that are implemented on AVL tree? Explain with suitable example.
UNIT  IV [1 x 14 = 14M] 8. a) Define graph and explain different representations of graph with suitable example. 8. b) Define hashing and explain its purpose and importance. (OR) 9. Write a program to implement min heap.
Return to question paper search
