MOTHER THERESSA COLLEGE OF ENGINEERING AND TECHNOLOGY
M-TECH I-I MID – I EXAMINATION
SUBJECT: ADVANCE DATA STRUCTURE BRANCH: CSE
WRITE ANY FOUR ANSWER: 4 X 5 = 20
1.Explain heap structures?
2.Write short notes on min-max heaps?
3.Describe hashing and collisions?
4.Explain
a) Division method
b) Mid square method
c) Folding method
5. What is AVL trees and Red black trees?
6.Explain the binominal heap?
Multiple-Choice Questions (MCQs): 5 MARKS
1. Which of the following is a type of abstract data type (ADT)? ( )
a) Stack
b) Array
c) Linked List
d) All of the above
2. Which data structure is used in a Depth First Search (DFS) traversal? ( )
a) Queue
b) Stack
c) Array
d) Linked List
3. In a priority queue, the element with the highest priority is always ( )
a) The first element inserted
b) The last element inserted
c) The first element to be removed
d) The last element to be removed
4. Which of the following operations is NOT supported by a linked list? ( )
a) Insertion
b) Deletion
c) Direct Access to elements
d) Traversal
5. In a binary search tree, the left child of a node has a value: ( )
a) Greater than the node
b) Less than the node
c) Equal to the node
d) Undefined
Fill-in-the-Blank Questions: 5 MARKS
1. In a stack data structure, the operation that removes an element is called
______________.
2. A ______________ is an unordered collection of items in which the
elements are stored in a linear order and can be accessed by their
position.
3. A tree where each node has at most two children is known as a
______________ tree.
4. In a queue, the element is inserted at the ______________ end and
removed from the ______________ end.
5. A ______________ search algorithm finds the position of a target value
within a sorted array by repeatedly dividing the search interval in half.
