Deleting last node in singly linked list takes:
Anonymous Quiz
30%
O(1)
58%
O(n)
10%
O(log n)
2%
O(n²)
Double linked list node contains:
Anonymous Quiz
1%
One pointer
87%
Two pointers
6%
No pointer
6%
Three pointers
Linked list elements are stored:
Anonymous Quiz
21%
Contiguously
56%
Non-contiguously
15%
In array
9%
In stack
What is the time complexity?
for(int i = 1; i <= n; i++)
{ for(int j = 1; j <= n; j++) { cout << i << j; } }
for(int i = 1; i <= n; i++)
{ for(int j = 1; j <= n; j++) { cout << i << j; } }
Anonymous Quiz
11%
O(n)
10%
O(n log n)
78%
O(n²)
0%
O(log n)
What is the time complexity?
for(int i = 1; i <= n; i = i * 2)
{ cout << i; }
for(int i = 1; i <= n; i = i * 2)
{ cout << i; }
Anonymous Quiz
25%
O(n)
60%
O(log n)
7%
O(n²)
7%
O(√n)
What is the time complexity?
for(int i = 1; i <= n; i++)
{ for(int j = 1; j <= i; j++) { cout << j; } }
for(int i = 1; i <= n; i++)
{ for(int j = 1; j <= i; j++) { cout << j; } }
Anonymous Quiz
19%
A) O(n)
63%
O(n²)
13%
O(n log n)
5%
O(log n)
What is the time complexity?
for(int i = 1; i <= n; i++)
{ for(int j = 1; j <= n; j = j * 2) { cout << j; } }
for(int i = 1; i <= n; i++)
{ for(int j = 1; j <= n; j = j * 2) { cout << j; } }
Anonymous Quiz
4%
O(n)
72%
O(n log n)
13%
O(log n)
12%
O(n²)
What is the time complexity?
for(int i = n; i > 0; i--)
{ cout << i; }
for(int i = n; i > 0; i--)
{ cout << i; }
Anonymous Quiz
14%
O(1)
72%
O(n)
8%
O(log n)
6%
O(n²)
What is the time complexity?
for(int i = 1; i <= n; i++)
{ for(int j = i; j <= n; j++) { cout << j; } }
for(int i = 1; i <= n; i++)
{ for(int j = i; j <= n; j++) { cout << j; } }
Anonymous Quiz
12%
O(n)
73%
O(n²)
14%
O(n log n)
1%
O(√n)
What is the time complexity?
for(int i = 1; i <= n; i++) { for(int j = 1; j <= n; j = j * 2) { cout << i << j; } }
for(int i = 1; i <= n; i++) { for(int j = 1; j <= n; j = j * 2) { cout << i << j; } }
Anonymous Quiz
13%
O(n²)
17%
O(log n)
61%
O(n log n)
8%
O(n)
What is the time complexity?
for(int i = 1; i <= n; i = i * 2)
{ for(int j = 1; j <= i; j++) { cout << j; } }
for(int i = 1; i <= n; i = i * 2)
{ for(int j = 1; j <= i; j++) { cout << j; } }
Anonymous Quiz
11%
O(n)
66%
O(n log n)
11%
O(log n)
12%
O(n²)
What is the time complexity?
for(int i = 1; i <= n; i++)
{ for(int j = 1; j <= n; j++) { for(int k = 1; k <= n; k = k * 2) { cout << k; } } }
for(int i = 1; i <= n; i++)
{ for(int j = 1; j <= n; j++) { for(int k = 1; k <= n; k = k * 2) { cout << k; } } }
Anonymous Quiz
56%
O(n² log n)
31%
O(n³)
8%
O(n log n)
5%
O(n²)
What is the time complexity?
for(i = 1; i * i <= n; i++)
print(i);
for(i = 1; i * i <= n; i++)
print(i);
Anonymous Quiz
42%
O(n)
24%
O(log n)
26%
O(√n)
8%
O(n²)
🤔3❤1
What is the time complexity of searching for an element in a binary search tree?
Anonymous Quiz
13%
A) O(1)
55%
B) O(log n)
21%
C) O(n)
11%
D) O(n log n)
The circular queue is considered full when:
Anonymous Quiz
3%
Front == size
13%
Rear == Front
62%
Count == size
21%
Rear == size - 1