The preorder traversal of a binary search tree is 15, 10, 12, 11, 20, 18, 16, 19.
Which one of the following is the postorder traversal of the tree?
A
20, 19, 18, 16, 15, 12, 11, 10
B
10, 11, 12, 15, 16, 18, 19, 20
C
11, 12, 10, 16, 19, 18, 20, 15
D
19, 16, 18, 20, 11, 12, 10, 15
2
GATE CSE 2020
MCQ (More than One Correct Answer)
+1
-0.33
What is the worst case time complexity of inserting n elements into an empty linked list, if the linked list needs to be maintained in sorted order?
A
$$\Theta \left( {{n^2}} \right)$$
B
$$\Theta \left( n \right)$$
C
$$\Theta \left( {nlogn} \right)$$
D
$$\Theta \left( 1 \right)$$
3
GATE CSE 2020
Numerical
+1
-0.33
Consider a double hashing scheme in which the primary hash function is h1(k)=k mod 23, and the secondary hash function is h2(k)=1+(k mod 19). Assume that the table size is 23. Then the address returned by probe 1 in the probe sequence (assume that the probe sequence begins at probe 0) for key value k=90 is _______.
Your input ____
4
GATE CSE 2020
MCQ (Single Correct Answer)
+2
-0.67
Consider a schedule of transactions T1 and T2 :
Here, RX stands for “Read(X)” and WX stands for “Write(X)”. Which one of the following schedules is conflict equivalent to the above schedule?
