AR16
CODE: 16CS1002
ADITYA INSTITUTE OF TECHNOLOGY AND MANAGEMENT, TEKKALI
(AUTONOMOUS)
I [Link] II Semester Supplementary Examinations, August-2017
Data Structures
(Common to CSE, IT Branches)
Time :3 Hours Max Marks:70
Answer ONE Question from each Unit
All Questions Carry Equal Marks
All parts of the question must be answered in one place only
UNIT–I
1. a. What is a Recursion? Write C programs to generate a Fibonacci series using recursive
function. 7M
b. Define and explain the operations of data structure. 7M
(OR)
2. a. explain the linear and binary recursion with examples 7M
b. Define data structures. What are the differences between linear and Non-Linear Data
Structures 7M
UNIT–II
3. a. Write an algorithm for linear search and explain with an example? 7M
b. Show how split an merge take place when merge sort is applied on the following
list of numbers: 39,9,81,45,90,27,72,18. 7M
(OR)
4. a. Write a C program to search an element in an array using Binary Search. 7M
b. Define sorting? Explain the differences between bubble sort and quick sort. Which
One is more efficient? 7M
UNIT–III
5. a. Write a C program that implement stack operations using arrays 7M
b. Define a Stack and explain the application of Stack 7M
(OR)
6. a. Explain the conversion procedure from infix expression to postfix expression. 7M
b. Explain the queue operations and array representation in Queue. 7M
1 of 2
AR16
CODE: 16CS1002
UNIT–IV
7. a. Write a C program to implement various operations on a single linked list. 7M
b. Write algorithms to insert into and delete elements from a doubly linked list. 7M
(OR)
2 2 2
8. a. Give the linked representation of the following polynomial: 7x y -8x y+3xy-11x-4. 7M
b. Write the procedure for inserting a node in the linked list at given position. 7M
UNIT–V
9. a. Differentiate binary tree and binary search tree 4M
b. Given an expression Exp=((a+b)-(c*d))%((e^f)/(g-h)),construct the corresponding binary
tree. 3M
c. write a non recursive algorithm for post order traversals with example. 7M
(OR)
10. a. Define a Graph? Explain Adjacent Matrix representation with example? 10M
b. Write a program to implement the Breadth First search algorithm. 4M
2 of 2
