II/IV B.Tech Degree Examinations, January 2014
Second Semester
Data Structures using C
Time : 3 hours
Maximum Marks : 60
Answer question No.1 Compulsory
Answer ONE question from each Unit
1. Answer the following [12 x 1 = 12M]
a) What are the differences between Arrays and Linked list?
b) What is LIFO?
c) What is the difference between linear and circular queue?
d) What is recursion?
e) What is the complexity of bubble sort?
f) What is merge sort?
g) What is hashing?
h) Define tree.
i) Define inorder traversal.
j) Write the difference between BST & AVL tree.
k) Transform ABCDE -+/*EF*- to infix.
l) Define level of tree.
UNIT - I [1 x 12 = 12M]
2. a) List the operations on linked list and write a C program to perform these operations by using single linked list. (OR)
3. Write a C program to perform the following operations using linked list.
(i) Polynomial Addition
(ii) Polynomial Multiplication
UNIT - II [1 x 12 = 12M]
4. a) Describe stack ADT. Write a C program for the implementation of the stack using arrays.
4. b) Write a C program for the evaluation of postfix expression. (OR)
5. a) Write a C program to implement circular queue
5. b) What are the applications of stack and queues? And write the difference between stack and queue?
UNIT - III [1 x 12 = 12M]
6. a) Write a program to find the factorial of a number by using recursion.
6. b) Write a program to sort the elements using bubble sort method. (OR)
7. a) Write quick sort algorithm and explain with example.
7. b) Explain radix sort with an example.
UNIT - IV [1 x 12 = 12M]
8. a) Write a C program to construct a BST and perform the following operations.
(i) Insertion
(ii) deletion
(iii) searching node
(iv) traversals (OR)
9. a) Write about various hashing methods.
9. b) Write about B trees and applications.