Test: Time and Space Complexity - 1

Question 1

Which of the following best describes time complexity in algorithms?

Accepted Answer

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

Answer

It measures the amount of memory used by an algorithm.

Answer

It measures the efficiency of an algorithm in terms of input size.

Answer

It measures the number of steps executed by an algorithm.

Question 2

What does O(1) time complexity mean?

Accepted Answer

The algorithm takes constant time to run, regardless of the input size.

Answer

The algorithm takes linear time to run.

Answer

The algorithm takes logarithmic time to run.

Answer

The algorithm takes quadratic time to run.

Question 3

Which of the following represents the best-case time complexity of an algorithm? a) O

Accepted Answer

O(1)

Answer

O(n)

Answer

O(n2)

Answer

O(log n)

Question 4

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

Accepted Answer

O(n2)

Answer

O(1)

Answer

O(n)

Answer

O(log n)

Question 5

What does space complexity in algorithms measure?

Accepted Answer

It measures the amount of memory used by an algorithm.

Answer

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

Answer

It measures the efficiency of an algorithm in terms of input size.

Answer

It measures the number of steps executed by an algorithm.

Question 6

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

Accepted Answer

O(n)

Answer

O(1)

Answer

O(n^2)

Answer

O(log n)

Question 7

What is the output of the following code snippet?
int count = 0;
for (int i = 1; i <= n; i *= 2) {
count++;
}
cout << count;

Accepted Answer

log(n)

Answer

n

Answer

sqrt(n)

Answer

n^2

Question 8

What is the time complexity of the following code snippet?
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cout << i << " " << j << endl;
}
}

Accepted Answer

O(n^2)

Answer

O(1)

Answer

O(n)

Answer

O(log n)

Question 9

What is the output of the following code snippet?
int n = 5;
int count = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
for (int k = 1; k <= n; k++) {
count++;
}
}
}
cout << count;

Accepted Answer

125

Answer

15

Answer

225

Answer

625

Question 10

What is the space complexity of the following code snippet?
int n = 10;
int* arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = i;
}
delete[] arr;

Accepted Answer

O(1)

Answer

O(n)

Answer

O(n^2)

Answer

O(log n)

Question 11

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

Accepted Answer

O(n log n)

Answer

O(n)

Answer

O(log n)

Answer

O(n^2)

Question 12

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

Accepted Answer

O(n log n)

Answer

O(n)

Answer

O(log n)

Answer

O(n^2)

Question 13

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

Accepted Answer

O(log n)

Answer

O(n)

Answer

O(n log n)

Answer

O(n^2)

Question 14

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

Accepted Answer

O(n^2)

Answer

O(n)

Answer

O(log n)

Answer

O(n log n)

Question 15

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

Accepted Answer

O(n^2)

Answer

O(n)

Answer

O(n log n)

Answer

O(1)

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

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

Which of the following best describes time complexity in algorithms?

What does O(1) time complexity mean?

Which of the following represents the best-case time complexity of an algorithm? a) O

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

What does space complexity in algorithms measure?

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

What is the output of the following code snippet?
int count = 0;
for (int i = 1; i <= n; i *= 2) {
count++;
}
cout << count;

What is the time complexity of the following code snippet?
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cout << i << " " << j << endl;
}
}

What is the output of the following code snippet?
int n = 5;
int count = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
for (int k = 1; k <= n; k++) {
count++;
}
}
}
cout << count;

What is the space complexity of the following code snippet?
int n = 10;
int* arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = i;
}
delete[] arr;

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

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

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

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

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

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 - 1 - Free MCQ Practice Test with solutions,

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

Which of the following best describes time complexity in algorithms?

What does O(1) time complexity mean?

Which of the following represents the best-case time complexity of an algorithm? a) O

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

What does space complexity in algorithms measure?

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

What is the output of the following code snippet? int count = 0; for (int i = 1; i <= n; i *= 2) { count++; } cout << count;

What is the time complexity of the following code snippet? for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cout << i << " " << j << endl; } }

What is the output of the following code snippet? int n = 5; int count = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { for (int k = 1; k <= n; k++) { count++; } } } cout << count;

What is the space complexity of the following code snippet? int n = 10; int* arr = new int[n]; for (int i = 0; i < n; i++) { arr[i] = i; } delete[] arr;

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

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

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

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

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

DSA in C++

DSA in C++

Top Courses for Software Development

About this Software Development Practice Test

Explore more Software Development Study Resources

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

What is the output of the following code snippet?
int count = 0;
for (int i = 1; i <= n; i *= 2) {
count++;
}
cout << count;

What is the time complexity of the following code snippet?
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cout << i << " " << j << endl;
}
}

What is the output of the following code snippet?
int n = 5;
int count = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
for (int k = 1; k <= n; k++) {
count++;
}
}
}
cout << count;

What is the space complexity of the following code snippet?
int n = 10;
int* arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = i;
}
delete[] arr;

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

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

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

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

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