
Competitive Programming: Intro to the Arts of Problem Solving
Authored by Thuy Vy Tran
Computers
9th - 12th Grade
Used 1+ times

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
34 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
10 sec • 1 pt
What is space complexity in computer science?
The amount of memory used by an algorithm during its execution
The time it takes for an algorithm to run
The number of processors needed to execute an algorithm
The maximum file size that can be handled by an algorithm
2.
MULTIPLE CHOICE QUESTION
10 sec • 1 pt
What does time complexity measure in an algorithm?
The amount of memory an algorithm uses
The time taken for an algorithm to run as a function of the length of the input
The number of lines of code in an algorithm
The number of processors needed to execute an algorithm
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following statements is true about Big O, Big Omega, and Big Theta notations?
Big O describes the best-case scenario, Big Omega describes the worst-case scenario, and Big Theta describes the average-case scenario.
Big O describes the worst-case scenario, Big Omega describes the best-case scenario, and Big Theta describes the average-case scenario.
Big O describes the worst-case scenario, Big Omega describes the best-case scenario, and Big Theta describes the exact behavior.
Big O describes the upper bound, Big Omega describes the lower bound, and Big Theta describes the exact bound of an algorithm's time complexity.
4.
MULTIPLE CHOICE QUESTION
10 sec • 1 pt
What is the time complexity?
O(1)
O(log n)
O(n)
O(n^2)
5.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
What is the Bubble Sort algorithm?
A sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.
A sorting algorithm that divides the list into two halves, recursively sorts them, and then merges the sorted halves.
A sorting algorithm that builds the final sorted array one item at a time by selecting the smallest available element.
A sorting algorithm that uses a binary heap data structure to sort elements.
6.
MULTIPLE CHOICE QUESTION
5 sec • 1 pt
What is the time complexity of merge sort?
O(n)
O(n^2)
O(n log n)
O(log n)
7.
MULTIPLE CHOICE QUESTION
5 sec • 1 pt
What is the correct way to declare an integer variable in C++?
int x;
integer x;
var x;
x int;
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?