Multiple Choice
Which of the following statements is NOT TRUE for Internal Sorting algorithms
A) usually deal with small number of elements
B) no of elements must be able to fit in process\s main memory
C) use auxilliary memory like tape or hard disk
D) ususally are of type compare-exchange
Correct Answer:
Verified
Correct Answer:
Verified
Q1: In Binary tree representation created by execution
Q2: Which of the following is not a
Q3: Which of following is NOT A WAY
Q5: The procedure of sorting a bitonic sequence
Q6: In first step of parallelizing quick sort
Q7: Pivot in Quick sort can be selected
Q8: The odd-even transposition algorithm sorts n elements
Q9: The VLIW processors are much simpler as
Q10: While mapping Bitonic sort on Hypercube, Compare-exchange
Q11: The VLIW architecture follows ..... approach to