What is the least order of execution time for the following code segment, if the
segment terminates without error?
int i = 0, count = 0;
while (i < N) {
current = A[i];
while (i < N && current = = A[i]) {
i++;
count++
}
}
A -
O (SQRT(N))
B -
O (N)
C -
O (N^2)
D -
O (N log N)
2-
What is the time complexity for the following algorithm, in terms of the number of
additions performed?
/* assume that n is greater than 0 */
int x = 0;
for(int I = (int)sqrt(n); i
x = x + i;
A -
O(n^2log(n))
B -
O(1)
C -
O(n^2)
D -
O(n)
3-
What is the time complexity for the following algorithm, in terms of the number of
multiplications performed?
A -
None of the others answers
B -
O(nlog(n))
C -
O(log(n))
D -
O(log(log(n)))
4-
What is the time complexity for the following algorithm, in terms of the number of
additions performed?
int x = 0;
for (int i = n; i > 1; i = i/2)
for (int j = 0; j < n*n; j++)
x = x + 10;
A -
O(log(n))
B -
None of the others answers
C -
O(n^2log(n))
D -
O(n^4)
5-
What is the time complexity for the following algorithm, in terms of the number of
additions performed?
int x = 0;
for (int i = 0 i
for (int j = 0; j < i; j++)
x = x + i + 1;
A -
O(n^4)
B -
O(n^3)
C -
O(n^2)
D -
None of the others answers
6-
What is least order of execution time for the following code segment, if the segment
terminates without error?
int i = 0, count = 0;
while (i < N) {
current = A[i];
while (i < N && current = = A[i]) {
i++;
count++
}
}
A -
O (N log N)
B -
O (SWRT(N))
C -
O (N^2)
D -
O (N)
7-
What is a queue?
A -
Linked list
B -
A Queue is a sequential organization of data
C -
None of the above
D -
Array
8-
What happends when you push a new node onto a stack?
A -
The new node is placed at the back of the linked list
B -
No Changes happends
C -
The new node is placed at the front of the linked list
D -
The new node is placed at the middle of the linked list
9-
What is the formula used to calculate the back of the queue?
A -
The back of the queue is calculated by using the following formula: back = (back+1) % size-1
B -
The back of the queue id calculated by using the following formula: back = back % size
C -
The back of the queue is calculated by using the following formula: back = (back+1) % size
D -
None of the others
10-
What will be the output of the following code?
int x, y, z;
x=1; y=2; z=3;
int* a = &x;
*a = y;
cout << x <
