Welcome to the Tree Properties MCQs Page

Dive deep into the fascinating world of Tree Properties with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Tree Properties, a crucial aspect of Discrete Mathematics. In this section, you will encounter a diverse range of MCQs that cover various aspects of Tree Properties, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Discrete Mathematics.

Check out the MCQs below to embark on an enriching journey through Tree Properties. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Discrete Mathematics.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Tree Properties. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Tree Properties MCQs | Page 4 of 6

Explore more Topics under Discrete Mathematics

01

Logics and Proofs

02

Sets and Functions

03

Sequences,Sums and Matrices

04

Algorithms

05

Number Theory and Cryptography

06

Induction and Recursion

07

Counting Theory

08

Discrete Probability

09

Relations

10

Graphs and Graphs Properties

11

Boolean Algebra and Modeling Computations

12

Group Theory

Q31.

Evaluation of expression a/b+c*d-e in postfix notation.

ab+cd/*-e

ab/cd*+e-

abc/+d*-e

abcd/+*-e

Discuss

Answer: (b).ab/cd*+e-

Q32.

Evaluation of 4*5+3/2-9 in prefix notation.

*45-/32+9

*+453/-29

-+*45/329

*+/45932

Discuss

Answer: (c).-+*45/329

Q33.

What is the output of the following if funct1(7)?

128

4320

720

5040

Discuss

Answer: (d).5040

Q34.

Infix to prefix conversion can be done using __________

two queues

two stacks

one stack and two queues

one stack

Discuss

Answer: (b).two stacks

Q35.

Conversion from prefix to postfix expression can be done _______________

using bubble sort

using radix sort

using two queues

in a direct manner

Discuss

Answer: (d).in a direct manner

Q36.

What is the postfix expression of 9+3*5/(10-4)?

9 3 + * 5 / 10 4 –

9 3 5 + * / 10 4 –

9 3 + 5 * / 10 4 –

9 3 5 * / + 10 – 4

Discuss

Answer: (c).9 3 + 5 * / 10 4 –

Q37.

What is the postfix expression of (A+B)-C*(D/E))+F?

A B + C D E / * – F +

A B C D E + / * F – +

A B C + * D E / F + –

A B + C – * D E / F +

Discuss

Answer: (a).A B + C D E / * – F +

Q38.

Convert the following expression into prefix notation.

(g-(f^e/d+c)-ba)

(f^e/d+c)-ba)
a) ^-/gfed+c-ab

-ab/+-ec^dgf

-ab-+c/d^efg

ab/+-^cde-fg

Discuss

Answer: (c).-ab-+c/d^efg

Q39.

What is the postfix expression of the given expression, (2*4-(5+7/3^4)-8)10?

2 4 5 * 7 3 4 ^ / + 8 – – 10

2 4 * ^ 5 7 3 4 / + 8 10 – –

2 4 * 5 7 ^ 3 4 / + – 8 10 –

2 4 * 5 7 3 4 ^ / + – 8 – 10

Discuss

Answer: (d).2 4 * 5 7 3 4 ^ / + – 8 – 10

Q40.

Prefix expression can be evaluated _________

from right to left

from left to right

from the exact middle

from second right element

Discuss

Answer: (b).from left to right

Page 4 of 6

Welcome to the Tree Properties MCQs Page

Tree Properties MCQs | Page 4 of 6

Explore more Topics under Discrete Mathematics

Logics and Proofs

Sets and Functions

Sequences,Sums and Matrices

Algorithms

Number Theory and Cryptography

Induction and Recursion

Counting Theory

Discrete Probability

Relations

Graphs and Graphs Properties

Boolean Algebra and Modeling Computations

Group Theory

Suggested Topics

Hadoop

Object Oriented Programming

Microprocessor

Cloud Computing

Operating System

Systems Programming

Data Science

JavaScript

Digital Logic Design