BARC CS 2018 Nuclear Quiz -2 (DS)

Attempt now to get your rank among 704 students!

Question 1

The operation
i= pop(s)
Push (s,i)
is equivalent to

• Ai= stacktop (s)
• Bempty (s)
• CRemove (i)
• Dadd(i)

Question 2

Consider the following directed graph:

The number of different topological orderings of the vertices of the graph is __________.

• A3
• B4
• C5
• D6

Question 3

If a base condition isn’t specified in a recursive program, what will it lead to?

• AStack Overflow
• BStack Underflow
• CDoesn’t compile
• DNothing happens

Question 4

Consider the complete binary tree, with all the nodes in order, sequentially from left to right, generation by generating. For such a complete binary ree, the parent nodes of nodes 24 and 25 would be

• A12 13
• B10 11
• C12 12
• D11 11

Question 5

Consider the following New-order strategy for traversing a binary tree:
• Visit the root;
• Visit the right subtree using New-order;
• Visit the left subtree using New-order;
The New-order traversal of the expression tree corresponding to the reverse polish expression is given by:

• A+ - 1 6 7 * 2 ˆ 5 - 3 4 *
• B- + 1 * 6 7 ˆ 2 - 5 * 3 4
• C- + 1 * 7 6 ˆ 2 - 5 * 4 3
• D1 7 6 * + 2 5 4 3 * - ˆ -

• 704 attempts
• 3 upvotes
• 15 comments