Download Model question papers & previous years question papers

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

2014 Acharya Nagarjuna University B.Tech 2nd Year - 2nd Semester - Data Structures using C - Bapatla Engineering College - June 2014 Question paper



Course:   University/board: Acharya Nagarjuna University

Do you need the previous 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 June 2014. Feel free to make a copy and use it to prepare for your upcoming exams.



II/IV B.Tech Degree Examinations, June 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) Give an example for Array.
b) Define double linked list.
c) Define static data structure
d) List out basic operations performed on stack.
e) Give an example for Infix notation.
f) Give two advantages of using postfix notation.
g) Define a priority queue.
h) Define a deque.
i) What are the advantages of modularity?
j) List the applications of stacks.
k) What is shell sort?
l) What are the different binary tree traversal techniques?

UNIT - I [1 x 12 = 12M]

2. Write a C program to perform all the operations in single linked list. (OR)
3. What are the various linked list operations? Explain in detail with suitable example program.

UNIT - II [1 x 12 = 12M]

4. Explain how stack is applied for evaluating arithmetic expression and write the steps for converting infix to postfix expression with an example. (OR)
5. a) Write a C program to implement circular queue.
5. b) What are the applications of queues?

UNIT - III [1 x 12 = 12M]

6. a) Write a program to find G.C.D of a number by using recursion.
6. b) Write a program to sort the elements using bucket sort method. (OR)
7. a) Write heap sort algorithm and explain with example.
7. b) Explain hash sort with an example.

UNIT - IV [1 x 12 = 12M]

8. Write a C program to construct a linear search tree and perform the following operations. (OR)
9. Explain in detail about B trees and applications with an example program.





Return to question paper search

Next Question Paper: Signals and Systems - Bapatla Engineering College - II/IV B.Tech - 2nd Semester - June 2014

Previous Question Paper: B.Tech 2nd Year - 2nd Semester - Bapatla Engineering College - Electronic Circuits I - June 2014

Related Question Papers:


  • Signals and Systems - Bapatla Engineering College - B.Tech - Semester 4 - January 2014


  • B.Tech - Semester 3 - Network Analysis and Synthesis - Bapatla Engineering College - June 2014


  • 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


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


    Awards & Gifts
    Top Contributors
    TodayLast 7 Daysmore...

     
    ISC Technologies, Kochi - India. © All Rights Reserved.