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
39

Data structures and Algorithms MCQ with Answers

39) The postfix form of A*B+C/D is

*AB/CD+

AB*CD/+

A*BC+/D

ABCD+/ *

Answer is:

AB*CD/+

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

Related Data structures and Algorithms MCQ with Answers

40) Which of the following types of expressions does not require precedence rule when evaluated

Full parenthesized infix expression

Prefix expression

Partially parenthesized infix expression

More than one of these

Answer is:

More than one of these

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

E

B

C

D

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

24

12

26

50

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?

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

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here