Time Left - 12:00 mins
ISRO CS 2019 : DS Booster Quiz 1
Attempt now to get your rank among 862 students!
Question 1
Consider any array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array (i≤n), the index of the parent is
Question 2
Worst case time complexity to delete the root from min heap tree of n elements is ___.
Question 3
Assuming the items are inserted in order sorted into an empty binary search tree T, then the depth of such a tree is
Question 4
Maximum number of edges in an n-node undirected graph without self loops is
Question 5
#include
int test(int count)
What is sum of all outputs:-
Question 6
What is the purpose of “%%” in printf statement?
Question 7
The functions to be overridden ______
Question 8
Tower of Hanoi uses _______.
Question 9
A stack can be implemented using two queues. Let the queues be q1, q2 and the stack be s.
The operations push and pop are implemented in the following way:
push(s, x):
a. enqueue x to q2.
b. P
c. Q
pop(s):
dequeue from q1
The best possible option for P and Q are respectively:
The operations push and pop are implemented in the following way:
push(s, x):
a. enqueue x to q2.
b. P
c. Q
pop(s):
dequeue from q1
The best possible option for P and Q are respectively:
Question 10
How many difrerent binary trees (with three nodes P, Q and R) are possible with “PQR” as preorder traversal.
- 862 attempts
- 1 upvote
- 4 comments
Oct 10GATE & PSU CS