Computer Sciences > GATE 2021 SET-1 > Data Structures
Consider the following sequence of operations on an empty stack.
push(54); push(52); pop(); push(55); push(62); s = pop();
Consider the following sequence of operations on an empty queue.
enqueue(21); enqueue(24); dequeue(); enqueue(28); enqueue(32); q = dequeue();
The value of s + q is
push(54); push(52); pop(); push(55); push(62); s = pop();
Consider the following sequence of operations on an empty queue.
enqueue(21); enqueue(24); dequeue(); enqueue(28); enqueue(32); q = dequeue();
The value of s + q is
Correct : 86
Similar Questions
Consider the following statements.S1: The sequence of procedure calls corresponds to a preorder traversal of the activation tree.S2: The sequence of procedure r...
Consider the following statements.S1: The sequence of procedure calls corresponds to a preorder traversal of the activation tree.S2: The sequence of procedure r...
Consider the following statements.S1: The sequence of procedure calls corresponds to a preorder traversal of the activation tree.S2: The sequence of procedure r...
Total Unique Visitors
Loading......