Test: Time and Space Complexity - 2

Question 1

Which of the following asymptotic notations represents the worst-case time complexity of an algorithm?

Accepted Answer

O(n)

Answer

O(1)

Answer

&Theta;(n)

Answer

&Omega;(n)

Question 2

The time complexity of an algorithm is expressed as O(log n). This indicates that the algorithm has a ________ time complexity.

Accepted Answer

Logarithmic

Answer

Linear

Answer

Quadratic

Answer

Exponential

Question 3

Which of the following asymptotic notations represents the upper bound of the time complexity of an algorithm?

Accepted Answer

O-notation

Answer

Ω-notation

Answer

Θ-notation

Answer

None of the above

Question 4

In terms of time complexity, which of the following statements is correct?

Accepted Answer

O(log n) is faster than O(sqrt(n))

Answer

O(n^2) is faster than O(n log n)

Answer

O(n!) is faster than O(2^n)

Answer

O(n log n) is faster than O(n^3)

Question 5

The time complexity of an algorithm is given by T(n) = 5n^2 + 3n + 2. What is the dominant term in this equation?

Accepted Answer

5n^2

Answer

3n

Answer

2

Answer

None of the above

Question 6

What will be the output of the following code?
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j < n; j = j * 2) {
sum++;
}
}
cout << sum;

Accepted Answer

log(n)

Answer

n

Answer

n^2

Answer

2^n

Question 7

What will be the output of the following code?
int func(int n) {
if (n <= 0) {
return 1;
}
return func(n / 2) + func(n / 2);
}
int result = func(8);
cout << result;

Accepted Answer

256

Answer

128

Answer

64

Answer

16

Question 8

What will be the output of the following code?
int n = 100;
int count = 0;
while (n > 0) {
n = n / 2;
count++;
}
cout << count;

Accepted Answer

7

Answer

6

Answer

8

Answer

9

Question 9

What will be the output of the following code?
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j = j * 2) {
cout << j << " ";
}
cout << endl;
}

Accepted Answer

1 2 3 4 5
2 4 8
3 5

Answer

1 2 3 4 5
2 3 4 5
4 5
8

Answer

1 2 3 4 5
2 4 8

Answer

1 2 4 8

Question 10

What will be the output of the following code?
int n = 4;
int count = 0;
for (int i = n; i >= 1; i = i / 2) {
for (int j = 1; j <= i; j++) {
count++;
}
}
cout << count;

Accepted Answer

9

Answer

6

Answer

7

Answer

8

Question 11

What is the time complexity of the following code snippet?
int func(int n) {
if (n <= 0) {
return 0;
}
return 1 + func(n / 2);
}
int result = func(16);

Accepted Answer

O(log n)

Answer

O(n)

Answer

O(sqrt(n))

Answer

O(n log n)

Question 12

What is the space complexity of the following code snippet?
void func(int n) {
if (n <= 0) {
return;
}
cout << n << " ";
func(n - 1);
func(n - 1);
}
func(4);

Accepted Answer

O(n)

Answer

O(log n)

Answer

O(sqrt(n))

Answer

O(n log n)

Question 13

Which of the following statements about time complexity is false?

Accepted Answer

The time complexity of an algorithm is always constant.

Answer

The time complexity of an algorithm measures the amount of time taken by the algorithm to run.

Answer

Time complexity is often expressed using asymptotic notations.

Answer

The time complexity of an algorithm depends on the input size.

Question 14

What is the time complexity of the following code snippet?
int sum = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j = j * 2) {
sum++;
}
}

Accepted Answer

O(n^2)

Answer

O(n)

Answer

O(log n)

Answer

O(n log n)

Question 15

What is the space complexity of the following code snippet?
int fib(int n) {
if (n <= 1) {
return n;
}
return fib(n - 1) + fib(n - 2);
}
int result = fib(5);

Accepted Answer

O(2^n)

Answer

O(n)

Answer

O(log n)

Answer

O(sqrt(n))

Time and Space Complexity - 2 - Free MCQ Practice Test with solutions,

MCQ Practice Test & Solutions: Test: Time and Space Complexity - 2 (15 Questions)

Which of the following asymptotic notations represents the worst-case time complexity of an algorithm?

The time complexity of an algorithm is expressed as O(log n). This indicates that the algorithm has a ________ time complexity.

Which of the following asymptotic notations represents the upper bound of the time complexity of an algorithm?

In terms of time complexity, which of the following statements is correct?

The time complexity of an algorithm is given by T(n) = 5n^2 + 3n + 2. What is the dominant term in this equation?

What will be the output of the following code?
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j < n; j = j * 2) {
sum++;
}
}
cout << sum;

What will be the output of the following code?
int func(int n) {
if (n <= 0) {
return 1;
}
return func(n / 2) + func(n / 2);
}
int result = func(8);
cout << result;

What will be the output of the following code?
int n = 100;
int count = 0;
while (n > 0) {
n = n / 2;
count++;
}
cout << count;

What will be the output of the following code?
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j = j * 2) {
cout << j << " ";
}
cout << endl;
}

What will be the output of the following code?
int n = 4;
int count = 0;
for (int i = n; i >= 1; i = i / 2) {
for (int j = 1; j <= i; j++) {
count++;
}
}
cout << count;

What is the time complexity of the following code snippet?
int func(int n) {
if (n <= 0) {
return 0;
}
return 1 + func(n / 2);
}
int result = func(16);

What is the space complexity of the following code snippet?
void func(int n) {
if (n <= 0) {
return;
}
cout << n << " ";
func(n - 1);
func(n - 1);
}
func(4);

Which of the following statements about time complexity is false?

What is the time complexity of the following code snippet?
int sum = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j = j * 2) {
sum++;
}
}

What is the space complexity of the following code snippet?
int fib(int n) {
if (n <= 1) {
return n;
}
return fib(n - 1) + fib(n - 2);
}
int result = fib(5);

DSA in C++

DSA in C++

Top Courses for Software Development

Schools

Competitive Exams

International Exams

Quick Links

About this Software Development Practice Test

Explore more Software Development Study Resources

Time and Space Complexity - 2 - Free MCQ Practice Test with solutions,

MCQ Practice Test & Solutions: Test: Time and Space Complexity - 2 (15 Questions)

Which of the following asymptotic notations represents the worst-case time complexity of an algorithm?

The time complexity of an algorithm is expressed as O(log n). This indicates that the algorithm has a ________ time complexity.

Which of the following asymptotic notations represents the upper bound of the time complexity of an algorithm?

In terms of time complexity, which of the following statements is correct?

The time complexity of an algorithm is given by T(n) = 5n^2 + 3n + 2. What is the dominant term in this equation?

What will be the output of the following code? int sum = 0; for (int i = 0; i < n; i++) { for (int j = 1; j < n; j = j * 2) { sum++; } } cout << sum;

What will be the output of the following code? int func(int n) { if (n <= 0) { return 1; } return func(n / 2) + func(n / 2); } int result = func(8); cout << result;

What will be the output of the following code? int n = 100; int count = 0; while (n > 0) { n = n / 2; count++; } cout << count;

What will be the output of the following code? int n = 5; for (int i = 1; i <= n; i++) { for (int j = i; j <= n; j = j * 2) { cout << j << " "; } cout << endl; }

What will be the output of the following code? int n = 4; int count = 0; for (int i = n; i >= 1; i = i / 2) { for (int j = 1; j <= i; j++) { count++; } } cout << count;

What is the time complexity of the following code snippet? int func(int n) { if (n <= 0) { return 0; } return 1 + func(n / 2); } int result = func(16);

What is the space complexity of the following code snippet? void func(int n) { if (n <= 0) { return; } cout << n << " "; func(n - 1); func(n - 1); } func(4);

Which of the following statements about time complexity is false?

What is the time complexity of the following code snippet? int sum = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j = j * 2) { sum++; } }

What is the space complexity of the following code snippet? int fib(int n) { if (n <= 1) { return n; } return fib(n - 1) + fib(n - 2); } int result = fib(5);

DSA in C++

DSA in C++

Top Courses for Software Development

About this Software Development Practice Test

Explore more Software Development Study Resources

What will be the output of the following code?
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j < n; j = j * 2) {
sum++;
}
}
cout << sum;

What will be the output of the following code?
int func(int n) {
if (n <= 0) {
return 1;
}
return func(n / 2) + func(n / 2);
}
int result = func(8);
cout << result;

What will be the output of the following code?
int n = 100;
int count = 0;
while (n > 0) {
n = n / 2;
count++;
}
cout << count;

What will be the output of the following code?
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j = j * 2) {
cout << j << " ";
}
cout << endl;
}

What will be the output of the following code?
int n = 4;
int count = 0;
for (int i = n; i >= 1; i = i / 2) {
for (int j = 1; j <= i; j++) {
count++;
}
}
cout << count;

What is the time complexity of the following code snippet?
int func(int n) {
if (n <= 0) {
return 0;
}
return 1 + func(n / 2);
}
int result = func(16);

What is the space complexity of the following code snippet?
void func(int n) {
if (n <= 0) {
return;
}
cout << n << " ";
func(n - 1);
func(n - 1);
}
func(4);

What is the time complexity of the following code snippet?
int sum = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j = j * 2) {
sum++;
}
}

What is the space complexity of the following code snippet?
int fib(int n) {
if (n <= 1) {
return n;
}
return fib(n - 1) + fib(n - 2);
}
int result = fib(5);