Complexity A-Level

Complexity A-Level

Time limit: 0

Quiz Summary

0 of 19 Questions completed

Questions:

Information

You have already completed the quiz before. Hence you can not start it again.

Quiz is loading…

You must sign in or sign up to start the quiz.

You must first complete the following:

Results

Quiz complete. Results are being recorded.

Results

0 of 19 Questions answered correctly

Your time:

Time has elapsed

You have reached 0 of 0 point(s), (0)

Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)

Categories

Algorithms ALevel 0%

Aaaand relax…it’s over! Take your time reviewing your answers, reading the feedback as you go, learning from your mistakes.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19

Current
Review
Answered
Correct
Incorrect

Question 1 of 19

1. Question
Which of the following Big-O Notation measurements describes the complexity of an algorithm where it takes the same number of steps to execute regardless of the size of the data set (n)?
- O(n)
- O(1)
- O(n^2)
- O(k^n)
- O(log n)
- O(n log n)
Correct

Incorrect
Question 2 of 19

2. Question
Which of the following Big-O Notation measurements describes the complexity of an algorithm where the number of steps required to execute the algorithm increases in direct proportion to the size of the data set (n)?
- O(n)
- O(1)
- O(n^2)
- O(k^n)
- O(log n)
- O(n log n)
Correct

Incorrect
Question 3 of 19

3. Question
Which of the following Big-O Notation measurements describes the complexity of an algorithm which makes use of the principles of ‘Divide and Conquer’?
- O(n)
- O(1)
- O(n^2)
- O(k^n)
- O(log n)
- O(n log n)
Correct

Incorrect
Question 4 of 19

4. Question
Which of the following Big-O Notation measurements describes an algorithm of an intractable problem?
- O(n)
- O(1)
- O(n^2)
- O(k^n)
- O(log n)
- O(n log n)
Correct

Incorrect
Question 5 of 19

5. Question
Which of the following Big-O Notation measurements describes polynomial growth?
- O(n)
- O(1)
- O(n^2)
- O(k^n)
- O(log n)
- O(n log n)
Correct

Incorrect
Question 6 of 19

6. Question
Which of the following Big-O Notation measurements describes the complexity of the following algorithm?
- O(n)
- O(1)
- O(n^2)
- O(k^n)
- O(log n)
- O(n log n)
Correct

Incorrect
Question 7 of 19

7. Question
Which of the following Big-O Notation measurements describes the complexity of the following algorithm?
- O(n)
- O(1)
- O(n^2)
- O(k^n)
- O(log n)
- O(n log n)
Correct

Incorrect
Question 8 of 19

8. Question
If an algorithm has 2n^2 + 6n + 9 steps to execute, what is the Big-O notation to describe the algorithm’s complexity?
- O(n)
- O(1)
- O(n^2)
- O(k^n)
- O(log n)
- O(n log n)
Correct

Incorrect
Question 9 of 19

9. Question
If an algorithm has 1254 steps to execute, what is the Big-O notation to describe the algorithm’s complexity?
- O(n)
- O(1)
- O(n^2)
- O(k^n)
- O(log n)
- O(n log n)
Correct

Incorrect
Question 10 of 19

10. Question
If an algorithm has 5n + 6n + 8 steps to execute, what is the Big-O notation to describe the algorithm’s complexity?
- O(n)
- O(1)
- O(n^2)
- O(k^n)
- O(log n)
- O(n log n)
Correct

Incorrect
Question 11 of 19

11. Question
Which of the following Big-O notations describe line 3 of the graph?
- O(n)
- O(1)
- O(n^2)
- O(k^n)
- O(log n)
- O(n log n)
Correct

Incorrect
Question 12 of 19

12. Question
Which of the following Big-O notations describe line 4 of the graph?
- O(n)
- O(1)
- O(n^2)
- O(k^n)
- O(log n)
- O(n log n)
Correct

Incorrect
Question 13 of 19

13. Question
Which of the following Big-O notations describe line 6 of the graph?
- O(n)
- O(1)
- O(n^2)
- O(k^n)
- O(log n)
Correct

Incorrect
Question 14 of 19

14. Question
Which of the following Big-O notations describe line 7 of the graph?
- O(n)
- O(1)
- O(n^2)
- O(k^n)
- O(log n)
Correct

Incorrect
Question 15 of 19

15. Question
An algorithm whose execution time increases at the same rate as the size of data it has to work on increases, is said to have a _________ time complexity.
- Logarithmic
- Exponential
- Linear
- Polynomial
Correct

Incorrect
Question 16 of 19

16. Question
An algorithm whose execution time increases at a faster rate as the size of data it has to work on increases (yet is still executed in acceptable time ) is said to have a ________ time complexity.
- Logarithmic
- Exponential
- Linear
- Polynomial
Correct

Incorrect
Question 17 of 19

17. Question
An algorithm whose execution time increases at a faster rate as the size of data it has to work on increases (and is not executed in acceptable time) is said to have a ________ time complexity.
- Logarithmic
- Exponential
- Linear
- Polynomial
Correct

Incorrect
Question 18 of 19

18. Question
An algorithm whose execution time increases at an increasingly slower rate compared to the rate of increase in size of data it has to work on, is said to have a ________ time complexity.
- Logarithmic
- Exponential
- Linear
- Polynomial
Correct

Incorrect
Question 19 of 19

19. Question
Big-O notation typically describes…
- Best Case
- Average Case
- Worst Case
Correct

Incorrect

×

Login

Accessing this course requires a login. Please enter your credentials below!

Username or Email Address

Password

Remember Me

Continue with Google

Lost Your Password?