Skip to content
Software Engineering –
Medium Difficulty
ARE YOU READY?
LET’S PRACTICE!
#1. Worst-case comparisons for binary search on sorted array size 512 are closest to:
#2. Which sorting algorithm has average time complexity O(n log n)?
#3. Linear search on an unsorted array of size n has worst-case complexity:
#4. Big-O notation describes algorithm growth with respect to:
#5. For an O(n^2) algorithm, if n doubles from 10000 to 20000, runtime scales approximately by:
#6. Which case best benefits from hash-based lookup over binary search tree traversal?
#7. Worst-case comparisons for binary search on sorted array size 128 are closest to:
#8. Which sorting algorithm has average time complexity O(n log n)?
#9. Linear search on an unsorted array of size n has worst-case complexity:
#10. Big-O notation describes algorithm growth with respect to:
#11. For an O(n^2) algorithm, if n doubles from 1000 to 2000, runtime scales approximately by:
#12. Which case best benefits from hash-based lookup over binary search tree traversal?
#13. Worst-case comparisons for binary search on sorted array size 128 are closest to:
#14. Which sorting algorithm has average time complexity O(n log n)?
#15. Linear search on an unsorted array of size n has worst-case complexity:
#16. Big-O notation describes algorithm growth with respect to:
#17. For an O(n^2) algorithm, if n doubles from 10000 to 20000, runtime scales approximately by:
#18. Which case best benefits from hash-based lookup over binary search tree traversal?
#19. Worst-case comparisons for binary search on sorted array size 512 are closest to:
#20. Which sorting algorithm has average time complexity O(n log n)?
#21. Linear search on an unsorted array of size n has worst-case complexity:
#22. Big-O notation describes algorithm growth with respect to:
#23. For an O(n^2) algorithm, if n doubles from 100 to 200, runtime scales approximately by:
#24. Which case best benefits from hash-based lookup over binary search tree traversal?
#25. Worst-case comparisons for binary search on sorted array size 1024 are closest to:
#26. Which sorting algorithm has average time complexity O(n log n)?
#27. Linear search on an unsorted array of size n has worst-case complexity:
#28. Big-O notation describes algorithm growth with respect to:
#29. For an O(n^2) algorithm, if n doubles from 1000 to 2000, runtime scales approximately by:
#30. Which case best benefits from hash-based lookup over binary search tree traversal?
#31. Worst-case comparisons for binary search on sorted array size 512 are closest to:
#32. Which sorting algorithm has average time complexity O(n log n)?
#33. Linear search on an unsorted array of size n has worst-case complexity:
#34. Big-O notation describes algorithm growth with respect to:
#35. Which data structure supports FIFO behavior?
#36. Average-time lookup in a hash table (good hash, moderate load factor) is typically:
#37. In a binary search tree, left child keys are generally:
#38. Dynamic arrays (vectors) commonly provide amortized complexity for append of:
#39. Which structure is most suitable for LIFO undo operation stacks?
#40. An array provides which major benefit compared with linked list for random index access?
#41. Which data structure supports FIFO behavior?
#42. Average-time lookup in a hash table (good hash, moderate load factor) is typically:
#43. In a binary search tree, left child keys are generally:
#44. Dynamic arrays (vectors) commonly provide amortized complexity for append of:
#45. Which structure is most suitable for LIFO undo operation stacks?
#46. An array provides which major benefit compared with linked list for random index access?
#47. Which data structure supports FIFO behavior?
#48. Average-time lookup in a hash table (good hash, moderate load factor) is typically:
#49. In a binary search tree, left child keys are generally:
#50. Dynamic arrays (vectors) commonly provide amortized complexity for append of:
#51. Which structure is most suitable for LIFO undo operation stacks?
#52. An array provides which major benefit compared with linked list for random index access?
#53. Which data structure supports FIFO behavior?
#54. Average-time lookup in a hash table (good hash, moderate load factor) is typically:
#55. In a binary search tree, left child keys are generally:
#56. Dynamic arrays (vectors) commonly provide amortized complexity for append of:
#57. Which structure is most suitable for LIFO undo operation stacks?
#58. An array provides which major benefit compared with linked list for random index access?
#59. Which data structure supports FIFO behavior?
#60. Average-time lookup in a hash table (good hash, moderate load factor) is typically:
#61. In a binary search tree, left child keys are generally:
#62. Dynamic arrays (vectors) commonly provide amortized complexity for append of:
#63. Which structure is most suitable for LIFO undo operation stacks?
#64. An array provides which major benefit compared with linked list for random index access?
#65. Which data structure supports FIFO behavior?
#66. Average-time lookup in a hash table (good hash, moderate load factor) is typically:
#67. In a binary search tree, left child keys are generally:
#68. A recursive function must include which essential component to avoid infinite recursion?
#69. Which control-flow statement immediately exits the current loop iteration and begins the next one?
#70. A loop executes from i=1 to i=7 inclusive. How many iterations occur?
#71. Unit testing primarily validates:
#72. Which test technique focuses specifically on edge values of an input range?
#73. Compared with recursion, iteration often provides what practical advantage in constrained environments?
#74. A recursive function must include which essential component to avoid infinite recursion?
#75. Which control-flow statement immediately exits the current loop iteration and begins the next one?
#76. A loop executes from i=1 to i=5 inclusive. How many iterations occur?
#77. Unit testing primarily validates:
#78. Which test technique focuses specifically on edge values of an input range?
#79. Compared with recursion, iteration often provides what practical advantage in constrained environments?
#80. A recursive function must include which essential component to avoid infinite recursion?
#81. Which control-flow statement immediately exits the current loop iteration and begins the next one?
#82. A loop executes from i=1 to i=6 inclusive. How many iterations occur?
#83. Unit testing primarily validates:
#84. Which test technique focuses specifically on edge values of an input range?
#85. Compared with recursion, iteration often provides what practical advantage in constrained environments?
#86. A recursive function must include which essential component to avoid infinite recursion?
#87. Which control-flow statement immediately exits the current loop iteration and begins the next one?
#88. A loop executes from i=1 to i=5 inclusive. How many iterations occur?
#89. Unit testing primarily validates:
#90. Which test technique focuses specifically on edge values of an input range?
#91. Compared with recursion, iteration often provides what practical advantage in constrained environments?
#92. A recursive function must include which essential component to avoid infinite recursion?
#93. Which control-flow statement immediately exits the current loop iteration and begins the next one?
#94. A loop executes from i=1 to i=7 inclusive. How many iterations occur?
#95. Unit testing primarily validates:
#96. Which test technique focuses specifically on edge values of an input range?
#97. Compared with recursion, iteration often provides what practical advantage in constrained environments?
#98. A recursive function must include which essential component to avoid infinite recursion?
#99. Which control-flow statement immediately exits the current loop iteration and begins the next one?
#100. A loop executes from i=1 to i=6 inclusive. How many iterations occur?
