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
35

Data structures and Algorithms MCQ with Answers

35) The data structure required to evaluate a postfix expression is

Queue

Stack

Array

linked-list

Answer is:

Stack

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

Related Data structures and Algorithms MCQ with Answers

36) The postfix form of the expression (A+B)∗(C∗D-E)∗F/G is

AB+CD ∗ E−FG/∗∗

AB+CD ∗ E−F∗∗G/

AB+CD ∗ E−∗F∗G/

AB+CDE∗ −∗F∗G/

Answer is:

AB+CD ∗ E−FG/∗∗

37) What is the postfix form of the following prefix expression -A/B*C$DE

ABCDE$*/-

A-BCDE$*/-

ABC$ED*/-

A-BCDE$*/

Answer is:

ABCDE$*/-

38) The data structure required to check whether an expression contains balanced parenthesis is

Stack

Queue

Tree

Array

Answer is:

Stack

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