DS Model Exam-I Part A

Heap sort is a

• Fibonacci heap

• Binary tree

• Priority queue

• FIFO

Which of the following is a max-heap?

• 
• 
• 
• 

What is the time complexity of Build Heap operation. Build Heap is used to build a max(or min) binary heap from a given array. Build Heap is used in Heap Sort as a first step for sorting ?

• $O\left(n\ \cdot\ Log\ n\right)$

• $O\left(\ n^2\ \right)$

• $O\left(Log\ n\right)$
  

• $O\left(\ n\ \right)$

Consider a binary max-heap implemented using an array. Which one of the following array represents a binary max-heap?

• 25,12,16,13,10,8,14

• 25,12,16,10,13,8,14

• 25,14,16,13,10,8,12

• 25,14,12,13,10,8,16

On average, which searching algorithm is more efficient?

• Binary Search
• Linear Search

In separate chaining, what data structure is appropriate?

• Singly linked list

• Doubly linked list

• Circular linked list

• Binary trees

Which of the following is not a collision resolution technique?

• Separate chaining

• Linear probing

• Quadratic probing

• Hashing

Separate chaining is easier to implement as compared to open addressing .

• True

• False

Which sorting algorithm may make multiple swaps per pass?

• Bubble Sort
• Selection Sort
• Insertion Sort

We are sorting the following list in ascending order:
 
1    4    2    9    3    8    5
 
What does the list look like after one pass of the bubble sort algorithm. 

• 1 2 4 3 8 5 9
• 1 4 2 5 3 8 9
• 4 2 9 3 8 5 1