C-Programming-data-structure || 2021 SET 1 || NAT || 1-mark || Module 2: Arrays | Stacks | Queue | Linked list1

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 _______.

2021 SET 1 || NAT || 1-mark