Question: One of the clever aspects of heaps is that they can be stored in arrays without using any __.

• 1. pointers
• 2. constants
• 3. variables
• 4. functions

Question: In which order we can sort?

• 1. increasing order only
• 2. decreasing order only
• 3. increasing order or decreasing order
• 4. both at the same time

Question: In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as?

• 1. T(n)
• 2. T(n / 2)
• 3. log n
• 4. n / 2 + n / 4

Question: For the heap sort we store the tree nodes in?

• 1. level-order traversal
• 2. in-order traversal
• 3. pre-order traversal
• 4. post-order traversal

Question: We do sorting to __.

• 1. keep elements in random positions
• 2. keep the algorithm run in linear order
• 3. keep the algorithm run in (log n) order
• 4. keep elements in increasing or decreasing order

Question: For the heap sort, access to nodes involves simple __ operations.

• 1. arithmetic
• 2. binary
• 3. algebraic
• 4. logarithmic

Question: he sieve technique works in __ as follows.

• 1. phases
• 2. numbers
• 3. integers
• 4. routines

Question: The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of?

• 1. divide-and-conquer
• 2. decrease and conquer
• 3. greedy nature
• 4. 2-dimension Maxima

Question: The analysis of Selection algorithm shows the total running time is indeed __in n.

• 1. arithmetic
• 2. geometric
• 3. linear
• 4. orthogonal

Question: How many elements do we eliminate in each time for the Analysis of Selection algorithm?

• 1. n / 2 elements
• 2. (n / 2) + n elements
• 3. n / 4 elements
• 4. n elements