A.  Full parenthesized infix expression 
B.  Prefix expression 
C.  Partially parenthesized infix expression 
D.  More than one of these 
Option: D Explanation : 
The five items:A,B,C,D, and E are pushed in a stack, one after the other starting from A.The stack is popped four times and each element is inserted in a queue.Then two elements are deleted from the queue and pushed back on the stack.Now one item is popped from the stack.
The popped item is
A.  E 
B.  B 
C.  C 
D.  D 
Option: D Explanation : In queue elements are deleted from front (FIFO) and in stacks elements are popped from top (LIFO)

If memory for the runtime stack is only 150 cells(words), how big can N be in Factorial(N) before encounterring stack overflow?
A.  24 
B.  12 
C.  26 
D.  50 
Option: C Explanation :
Given that, the size of a run time stack is of 150 cells (words). The arguments to be evaluate the factorial are placed on the stack. A function call is made to calculate the factorial. Subroutine is executed for each time the function call is made. Each funcall creates a stack frames of co words (Cells), 2 words for n, 2 words for program counter (PC) and 2 words for some other information.
The value of n should be such that, the size of stack should not exceed 150 cells. If we consider the value of n to be 26, it executes 25 procedure calls each of it with 6word stack frame. In this case totalnumber of words of stack space would be 150 (6 words × 25 procedure calls = 150) cells.
Therefore, value of n will be 26 is n! before encountering a stack overflow for the stack of size 150 cells (words)

Using
Pop(S1, Item)
Push(S1,Item)
Read(Item)
Print(Item)
the variables S1 represents (stack) and Item are given the input file:
A,B,C,D,E,F <EOF>
Which stacks are possible:
A. 
5 A 
B. 
5 
C. 
5 
D. 
5 
Option: C Explanation : 
Using Pop (S1,Item) ,Push(S1, Item), Getlist(Item), Pop(S2,Item), and the variables S1,S2(stacks with Top1 and Top2) and Item and given the input file: A,B,C,D,E,F Which stack are possible?
A.  All possible stacks with A,B,C,D,E and F 
B.  No possible stacks with A,B,C,D,E and F 
C.  Exact and only those stacks which can be produced with S1 alone 
D.  Twice as many stacks as can be produced with S1 alone 
Option: A Explanation : 
Syllabus covered in this section is
This Section covers Data Structures Questions Answers using C language .
Who can benefit 
Various Search Terms used for this section are