1) Which sort algorithm has abysmal O(n2) time complexity? a) bubble b) insertion c) quicksort d) merge 2) Over a large data set stored on disk, which sort algorithm offers the best performance? a) bubble b) insertion c) quicksort d) merge 3) Which sort algorithm offers the best general performance characteristics? a) bubble b) insertion c) quicksort d) merge 4) Which sort algorithm is the most efficient over very small datasets? a) bubble b) insertion c) quicksort d) merge 5) Which search algorithm is best for unsorted datasets? a) linear b) binary c) interpolation 6) Which search algorithm is best for sorted, uniformly distributed datasets? a) linear b) binary c) interpolation 7) Which search algorithm is best for sorted, randomly distributed datasets? a) linear b) binary c) interpolation 8) What advantage does a set offer over a traditional array? a) In a set, you can check elements in O(1) time. b) In a set, you always know what order items are stored in. c) In a set, you know what elements are in the array without checking. d) In a set, you can check elements in O(n) time. 9) What is a hash collision? a) When two different elements in a hash-based data structure hash to the same value. b) When two different elements in a hash-based data structure have the same value. c) When two different elements in a hash-based data structure are in the same bucket. d) When two identical elements in a hash-based data structure hash to different values. 10) When does the master theorem not apply? a) Where the form of the child functions and the node functions are different but they share the same time complexity. b) Where the form of the child functions and the node functions are the same and they share the same time complexity. c) Where the form of the child functions and the node functions are the same but the child has greater time complexity. d) Where the form of the child functions and the node functions are the same but the node has greater time complexity.

DSA 1 Multiple Choice Quiz

列印
嵌入

排行榜

視覺風格

選項

切換範本

恢復自動保存: ?