GATE CSE 2020 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2020

MCQ (Single Correct Answer)

-0.33

What is the worst case time complexity of inserting n² elements into an AVL-tree with n elements initially?

$$\Theta \left( {{n^2}} \right)$$

$$\Theta \left( {{n^2}\log n} \right)$$

$$\Theta \left( {{n^4}} \right)$$

$$\Theta \left( {{n^3}} \right)$$

GATE CSE 2020

MCQ (Single Correct Answer)

-0.33

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?

20, 19, 18, 16, 15, 12, 11, 10

10, 11, 12, 15, 16, 18, 19, 20

11, 12, 10, 16, 19, 18, 20, 15

19, 16, 18, 20, 11, 12, 10, 15

GATE CSE 2020

MCQ (More than One Correct Answer)

-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?

$$\Theta \left( {{n^2}} \right)$$

$$\Theta \left( n \right)$$

$$\Theta \left( {nlogn} \right)$$

$$\Theta \left( 1 \right)$$

GATE CSE 2020

Numerical

-0.33

Consider a double hashing scheme in which the primary hash function is
h₁(k)=k mod 23, and the secondary hash function is h₂(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 ____

PREVIOUS NEXT

GATE CSE Papers

2024