Data structures and Algorithms MCQ with Answers

Data structures and Algorithms MCQ with Answers

41) 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

Answer is:

D

42) If memory for the run-time stack is only 150 cells(words), how big can N be in Factorial(N) before encountering stack overflow

Answer is:

26

43) 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?

Answer is:

All possible stacks with A,B,C,D,E and F

44) A postfix expression is merely the reverse of the prefix expression

Answer is:

Correct

45) Following sequence of operations is performed on a stack push(1),push(2),pop, push(1),push(2)pop,pop,pop,push(2),pop.The sequence of poped out values are

Answer is:

2,2,1,1,2

6
7
8
9
10
11
12