Multiple Choice
______________ algorithms use auxiliary storage (such as tapes and hard disks) for sorting because the number of elements to be sorted is too large to fit into memory.
A) internal sorting
B) internal searching
C) external sorting
D) external searching
Correct Answer:
Verified
Correct Answer:
Verified
Q5: The fundamental operation of comparison-based sorting is
Q6: Graph search involves a closed list, where
Q7: _ algorithms use a heuristic to guide
Q8: Breadth First Search is equivalent to which
Q9: Cost of a parallel system is sometimes
Q11: Quicksort is one of the most common
Q12: The main advantage of _ is that
Q13: _ can be comparison-based or noncomparison-based.<br>A)searching<br>B)sorting<br>C)both a
Q14: mathematically efficiency is<br>A)e=s/p<br>B)e=p/s<br>C)e*s=p/2<br>D)e=p+e/e
Q15: In BFS, how many times a node