Virtual Labs

In the simulation, when comparing Binary Search and Linear Search for N = 10⁶, which algorithm shows significantly faster execution time?

a: Linear Search Explanation

Explanation

b: Binary Search Explanation

Explanation

c: Both have similar execution times Explanation

Explanation

d: Neither can handle N = 10⁶ Explanation

Explanation

Based on the simulation graph, which sorting algorithm's execution time grows faster as input size increases?

a: Bubble Sort Explanation

Explanation

b: Quick Sort Explanation

Explanation

c: Both grow at the same rate Explanation

Explanation

d: The trend cannot be determined from the graph Explanation

Explanation

In the simulation, why does Matrix Multiplication have a lower maximum N limit compared to Matrix Addition?

a: Matrix Multiplication uses less memory Explanation

Explanation

b: Matrix Addition is O(n³) while Multiplication is O(n²) Explanation

Explanation

c: Both have the same time complexity Explanation

Explanation

d: Matrix Multiplication is O(n³) while Addition is O(n²) Explanation

Explanation

When running Subset Generation in the simulation, why is the maximum N limited to around 22?

a: The algorithm is poorly implemented Explanation

Explanation

b: Because 2²² ≈ 4 million subsets, which takes significant time Explanation

Explanation

c: Memory limitations only Explanation

Explanation

d: It's an arbitrary limitation Explanation

Explanation

What does the simulation's execution time table help you understand?

a: Only the fastest algorithm Explanation

Explanation

b: The memory usage of each algorithm Explanation

Explanation

c: How execution time changes for different input sizes across algorithms Explanation

Explanation

d: The number of lines of code in each algorithm Explanation

Explanation

In the simulation, Permutation Generation has an even lower N limit than Subset Generation. Why?

a: O(n!) grows faster than O(2ⁿ) Explanation

Explanation

b: Permutations are easier to generate Explanation

Explanation

c: O(2ⁿ) grows faster than O(n!) Explanation

Explanation

d: Both have the same complexity Explanation

Explanation

What is the purpose of the 'Max Simulation Time' setting in the simulation?

a: To make algorithms run faster Explanation

Explanation

b: To change the algorithm implementation Explanation

Explanation

c: To increase the accuracy of results Explanation

Explanation

d: To limit how long each algorithm can run before stopping Explanation

Explanation

From the simulation graph, why might curves appear distorted when comparing algorithms with very different complexities?

a: The graph library has bugs Explanation

Explanation

b: The scale must accommodate vastly different execution times Explanation

Explanation

c: The algorithms are incorrectly implemented Explanation

Explanation

d: The browser is too slow Explanation

Explanation

Time complexities of Algorithms