www.ThinkITI.com

Home
MCQ
Search
Free Apps
Important
Study Groups
Contact Us
Policy

Home
MCQ
Objective Questions
Engineering
Computer Science
Computer Science Set-1
Data structures and Algorithms
42

Data structures and Algorithms MCQ with Answers

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

24

12

26

50

Answer is:

26

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

Related Data structures and Algorithms MCQ with Answers

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?

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

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

Exact and only those stacks which can be produced with S1 alone

Twice as many stacks as can be produced with S1 alone

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

Correct

Incorrect

Correct but only in some conditions

None of these

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

2,2,1,1,2

2,2,1,2,2

2,1,2,2,1

2,1,2,2,2

Answer is:

2,2,1,1,2

46) In evaluating the arithmetic expression 2*3-(4+5),using stacks to evaluate its equivalent postfix form, which of the following stack configuration is not possible?

4 6

5 4 6

9 6

9 3 2

Answer is:

9 3 2

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here