Posted Date: 05 Jul 2016      Posted By:: Krishna Teja Yeluripati    Member Level: Gold  Points: 3 (Rs. 3)

# 2014 Acharya Nagarjuna University Bapatla Engineering College - Data Structures using C - B.Tech - Semester 4 - January 2014 Question paper

 Course: University/board: Acharya Nagarjuna University

Are you looking for the old question papers of Data Structures using C - Bapatla Engineering College - B.Tech? This is the original question paper from the B.Tech second year second semester exam conducted by Bapatla Engineering College in January 2014. Feel free to store a copy and use it to prepare for your upcoming exams.

II/IV B.Tech Degree Examinations, January 2014

Second Semester

Data Structures using C

Time : 3 hours

Maximum Marks : 60

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.
(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.

### Related Question Papers:

• B.Tech - Semester 3 - Bapatla Engineering College - Electrical Technology - June 2014

• Bapatla Engineering College - Electromagnetic Field Theory - B.Tech 2nd Year - Semester 1 - June 2014

• Electronic Devices - Bapatla Engineering College - B.Tech 2nd Year - Semester 1 - June 2014

• B.Tech 2nd Year - Semester 1 - Digital Electronics - Bapatla Engineering College - June 2014

• B.Tech 2nd Year - Semester 1 - Bapatla Engineering College - Network Analysis and Synthesis - January 2014

• ### Categories

Submit Previous Years University Question Papers and make money from adsense revenue sharing program

Are you preparing for a university examination? Download model question papers and practise before you write the exam.

### Subscribe to Email

• Get Jobs by Email
• Forum posts by Email
• Articles by Email
• Top Contributors
TodayLast 7 Daysmore...

### Online Members

Paresh Gujarati
More...