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

• Wednesday, September 07, 2016

Roll No.
Total No. of Questions : 09
B.Tech. (CSE)
DATA STRUCTURES
Subject Code : BTCS-304

Time : 3 Hrs.
Note: Section A of the questions paper is compulsory. Attempt any four questions from Section B. attempt any question form section C.

Section –A

1.     Answer the following in brief:
a.     Dangling pointers
b.     Abstract data type
c.      Post-fix expression
d.     Priority queue
e.      Linked representation of queue
f.       B-Tree
g.     Depth First Search
h.     Double hashing
i.       Big O notation

Section –B

Note : Attempt any four questions from this section.

2.     How arrays are stored in memory? Explain column major representation of an array.
3.     Explain conversion form infix to postfix representation with the help of stack use.
4.     Explain the linked representation of a circular queue and operations to be performed on it with the help of suitable example.
5.     Discuss the application of heap in implementing priority queue with the help of suitable example.
6.     What is a hash function ? discuss the concept of collision resolution in hash table with the help of suitable example.
Section –C

7.     Consider the following numbers are stored in an array A:

31,52,28,84,65,24,14,56
Apply bubble sort algorithm to the array A and show each pass separately.
8.     Write the algorithm for post-order tree traversal. Also show the steps of this algorithm on a set of numbers to show an example
9.     What are the applications of queue? Write an algorithm to create a doubly- linked list and also write a function to delete a node from double-linked list.