me-2

Which of the following is the most widely used external memory data structure?

• AVL Tree

• B-tree

• Red-black tree

• Both AVL tree and Red-black tree

What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0.

• 2

• 4

• 3

• 5

Suppose we are sorting an array of eight integers using quick sort, and we have just finished the first partitioning with the array looking like this:

2 5 1 7 9 12 11 10

• The pivot could be either the 7 or the 9

• The pivot could be the 7 but it is not the 9

• The pivot is not the 7 but it could be the 9

• neither the 7 nor the 9 is the pivot

What is the maximum height of a Red-black tree with 15 nodes?

• 3

• 4

• 5

• 6

Suppose we are sorting an array of ten integers using quick sort, and we have just finished the first partitioning with the array looking like this:

3 8 2 5 1 4 7 6 10 9

What is the position of the pivot after the first partitioning?

• The pivot could be either the 5 or the 6

• The pivot could be the 5 but it is not the 6

• The pivot is not the 5 but it could be the 6

• neither the 5 nor the 6 is the pivot

What is the maximum height of any AVL-tree with 10 nodes? Assume that the height of a tree with a single node is 0.

• 2

• 3

• 4

• 5

Suppose we are sorting an array of twelve integers using quick sort, and we have just finished the first partitioning with the array looking like this:

4 8 3 6 1 5 7 2 12 11 10 9

What is the position of the pivot after the first partitioning?

• The pivot could be either the 6 or the 7

• The pivot could be the 6 but it is not the 7

• The pivot is not the 6 but it could be the 7

• neither the 6 nor the 7 is the pivot

Quick sort uses which of the following method to implement sorting

• Merging

• Partitioning

• Selection

• exchanging

Which data structure is used to implement recursion

• queue

• stack

• list

• array