## Data Structure Question Paper of 3rd Semester CSE74 Download Previous Years Question Paper 1

• Wednesday, September 07, 2016
• • ,
• No comments

Roll No.
Total No. of Questions: 09
B.TECH(3D ANIMATION & GRAPHICS,CSE, IT) (Sem.-3rd)
DATA STRUCTURE
Subject Code: BTCS-304
Paper ID: [A126]
Time: 3 Hrs
INSTRUCTIONS TO CANDIDATES:
1. Section –A, is Compulsory.
2. Attempt any four questions from Section-B.
3. Attempt any two questions from Section-C.

Section –A
Q.1.
(a) What is meant by an abstract data type?
(b) Differentiate between Stack and Queue?
(c) What are the advantages in the array implementation of list?
(d) What is the usage of stack in recursive algorithm implementation?
(e) What is a circular queue and its use?
(f) What condition is checked to determine if pointer, P has moved past he end of the list?
(g) Evaluate: (a) + 1 24 3 + * 41 - (b) 25 7 * 14 – 6 +
(h) Define the term sparse matrix. How they are stored in memory.
(i) List out he different types of hashing functions?
(j) What is meant by strongly connected in a graph?

Section –B

Q. 2. Define the terms: static and dynamic data structures. List some of the static and dynamic data structure in C.
Q. 3. What is traversing? Write an algorithm for traversing a link list?

Q. 4. What Criteria is used for evaluating the suitability of a particular data structure for a given application.

Q. 5. Make a binary search tree and a heap tree from the given data.

23 7 92 6 12 14 40 4 20 21

Q. 6. What is Graph. Describe in brief the various methods used to represent Graphs in memory.

Section –C

Q. 7. What is the advantage and average efficiency of quick sort? Apply Quick sort on the following data and show the contents of the array every pas:
48 7 26 4 13 23 98 57 10 5 32

Q. 8. Write the algorithms for the following:

(a) Deleting an element from a doubly link list.
(b) Inserting an element in a priority queue.
(c) To reverse a string of characters using stack.
(d) To search an element in a sorted array.

Q. 9. Define AVL and B-trees and their applications? Explain various operations used for balancing a binary tree with the help of a suitable example?