DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
FM: 50 PM: 30 See moreTime: 1 hr Attempt All of the following questions. Each question carry equal mark Attempt online MCQ test on Data Structures and Algorithms.
S [Top-n]
S [Top+n]
S [Top-n-1]
None of the above
Rate this question:
Xxx
Yyy
Zzz
Can not be determined
Rate this question:
2
1
0
3
Rate this question:
0
5
10
15
Rate this question:
2
5
3
0
Rate this question:
O(n logn)
O(2n)
O(n2)
None of above
Rate this question:
First record of the actual data
Last record of the actual data
Pointer to the last record of the actual data
None of above
Rate this question:
3
Junk value
Run time error
Address of the third element
Rate this question:
Only (i)
Only (ii)
Both (i) and (ii)
Both (ii) and (III)
Rate this question:
+, -, *, x, y, z, w
X, -, y, +, z, *, w
X, y, z, w, -, *, +
-, x, y, +, *, z, w
Rate this question:
Right child of node labeled 7
Left child of node labeled 7
Left child of node labeled 14
Right child of node labeled 8
Rate this question:
2 deletion and 3 additions
3 deletions and 2 additions
3 deletions and 3 additions
3 deletions and 4 additions
Rate this question:
16
12
6
10
Rate this question:
11
12
13
14
Rate this question:
L1,L2
Max(L1,L2)
Min(L1,L2)
L1+L2-1
Rate this question:
4
5
6
3
Rate this question:
2,2,1,2,2
2,2,1,1,2
2,1,2,2,1
2,1,2,2,2
Has 19 nodes
Has 16 nodes
Has 15 nodes
None of the above
Rate this question:
Log (n +1) - 1
Log (n)
Log (n -1)n -1
Log (n) + 1
Rate this question:
Post order traversal
Inorder traversal
Preorder traversal
None of above
Rate this question:
2.6
2.7
2.8
2.9
Rate this question:
3
4
5
6
Rate this question:
N/2
(n-1)/2
(n+1)/2
Log (n) + 1
Rate this question:
N2
Nn
N3
N
Rate this question:
X1, X2, X3, X4, X5, X6
X3, X4, X1, X5, X6, X2
X1, X3, X2, X4, X5, X6
None of the above
Rate this question:
150
140
55
None of the above
Rate this question:
Max(f(n),g(n))
Min(f(n),g(n))
F(n)+g(n)
F(n)*g(n)
Rate this question:
It decides the best algorithm to solve a problem
It determines maximum size of a problem, that can be solved in given system in given time
It is the lower bound of growth rate of algorithm
None of the above
N2
N
N3
Nn
Rate this question:
A1
A2
A3
A4
Rate this question:
Log n
N
N2
Nn
Rate this question:
Internal sorting is used, if number of items to be sorted is very large
External sorting is used, if number of items to be sorted is very large
External sorting needs auxiliary storage
Internal sorting needs auxuliary storage
Rate this question:
Stable
Consistent
External
Linear
Rate this question:
2.15
3.01
2.3
1.78
Rate this question:
T(1)=T(2)=T(3)
T(1) + T(2) = 2T2
T(1) - T(3) = T(2)
T(1) + T(2) = T(3)
Rate this question:
Bubble sort
Selection sort
Insertion sort
Merge sort
Rate this question:
------------ | 4 | 6 | ------------
------------ | 5 | 4 | 6 | ------------
------------ | 9 | 6 | ------------
------------ | 9 | 3 | 2 | ------------
Constant
Linear
Logarithmic
Exponential
Rate this question:
8/3
8/5
11/7
11/6
Rate this question:
Bubble sort
Quick sort
Merge sort
Heap sort
Rate this question:
Heap sort
Quick sort
Insertion sort
Selection sort
Rate this question:
Dijkastra's algorithm
Floyd's algorithm
Prim's algorithm
Worshal's algorithm
Rate this question:
6
7
2
5
Rate this question:
Symbol table
Dope vector
Register vector
Activation table
Rate this question:
5 x 6 matrix with 9 non-zero entries
5 x 6 matrix with 8 non-zero entries
6 x 5 matrix with 8 non-zero entries
6 x 5 matrix with 9 non-zero entries
Rate this question:
Conceptually easier
Completely dynamic
Efficient in accessing an entry
Efficient if the sparse matr4ix is a band matrix
Rate this question:
Correct answer is (i)
Correct answer is (ii)
Correct answer is (iii)
Correct answer is (iv)
FILO
FIFO
LIFO
Both a and c above
Rate this question:
Quiz Review Timeline (Updated): Mar 20, 2023 +
Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.
Wait!
Here's an interesting quiz for you.