Register

Test by Bikram | Data Structures | Test 2 | Question: 8

416 views
1 votes
1 votes

Consider following Scenario -

  1. The five items : P,Q,R,S and T are inserted into stack A one after other starting from T in reverse order
  2. The stack is popped three times and each element is inserted into another stack B.
  3. Then two elements are deleted from the stack B and pushed back onto the stack A.

What are the topmost elements of stack A and Stack B respectively?

  1. RP
  2. QR
  3. QP
  4. RQ
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
Bikram asked Nov 26, 2016
1,673 views
Test by Bikram | Data Structures | Test 2 | Question: 29
Three algorithms do the same task. Algorithm One is $O(N)$ and Algorithm Two is $O(\log N)$ and Algorithm Three is $O(N1/2)$. Which algorithm should execute the fastest for large values of $N$? $O(N1/2)$ $O(N)$ $O(\log N)$ both A and B
Three algorithms do the same task. Algorithm One is $O(N)$ and Algorithm Two is $O(\log N)$ and Algorithm Three is $O(N1/2)$. Which algorithm should execute the fastest f...
User Avatar
1 votes
1 votes
3 answers
3
Bikram asked Nov 26, 2016
828 views
Test by Bikram | Data Structures | Test 2 | Question: 28
A circular linked list is used to represents a queue. A single variable L is used to access the queue. To which node should L point such that both the operation enqueue and dequeue can be performed in constant time ? node next to front front node not possible with a single node rear node
A circular linked list is used to represents a queue. A single variable L is used to access the queue. To which node should L point such that both the operation enqueue a...
User Avatar
0 votes
0 votes
0 answers
4
Bikram asked Nov 26, 2016
400 views
Test by Bikram | Data Structures | Test 2 | Question: 26
Suppose letters a,b,c,d,e,f have probabilities ½, ¼, 1/8, 1/16, 1/32, 1/32. Which of the following is the Huffman code for the letters a,b,c,d,e,f. 0, 10, 110, 1110, 11110, 11111 11, 10, 01, 001, 0001, 0000 11, 10, 011, 010, 001, 000 110, 100, 010, 000, 001, 111
Suppose letters a,b,c,d,e,f have probabilities ½, ¼, 1/8, 1/16, 1/32, 1/32. Which of the following is the Huffman code for the letters a,b,c,d,e,f.0, 10, 110, 1110, 111...
User Avatar
Link Copied!