In infix expression, operator is:
Anonymous Quiz
29%
Before operands
11%
After operands
56%
Between operands
4%
At end
A singly linked list node contains:
Anonymous Quiz
5%
Data only
6%
Address only
86%
Data and next address
4%
Index
Insertion at beginning of singly linked list takes:
Anonymous Quiz
30%
O(n)
57%
O(1)
9%
O(log n)
4%
O(n²)
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²)