CUET PG 2021 — Computer PYQ

Q: How do I solve CUET PG 2021 Computer questions?

Practice CUET PG 2021 Computer previous year questions with step-by-step solutions on Mathem Solvex. Each question includes a detailed explanation and video solution to help you master the concept quickly.

Q: What is the difficulty level of CUET PG Computer questions?

CUET PG Computer questions range from moderate to advanced difficulty. Consistent practice with official previous year papers and topic-wise drills on Mathem Solvex is the most effective preparation strategy.

Q: Are CUET PG previous year papers available for free?

Yes. Mathem Solvex provides free access to CUET PG previous year question papers and topic-wise PDFs. You can download them or attempt them as timed live mock tests directly on the platform.

Question

CUET PG 2021 — Computer PYQ

CUET PG | Computer | 2021

To evaluate an expression without any embedded function calls

Choose the correct answer:

Explanation

Solving: Expression Evaluation Logic

Jab hum kisi normal (Infix) expression ko bina function calls ke solve karte hain, toh computer use Stack Data Structure ki madad se process karta hai.

1. Expression Conversion:

Computer sabse pehle standard expression ( $Infix$ ) ko computer-friendly format ( $Postfix$ ) mein badalta hai:

\text{Infix: } A + B \implies \text{Postfix: } AB+

2. Stack Evaluation Rule:

Bina function call ke expression ko solve karne ka rule niche diya gaya hai:

Agar Operand (number) mile $\implies$ Stack mein Push karein.
Agar Operator ( $+, -, \times, \div$ ) mile $\implies$ Do operands ko Pop karein, solve karein aur result wapas Push karein.

Step-by-Step Mathematical Example

Expression: $3 + 4 \times 2$ (Infix)

Postfix equivalent: $3, 4, 2, \times, +$

Step	Symbol	Action	Stack State
1	3	Push 3	`[3]`
2	4	Push 4	`[3, 4]`
3	2	Push 2	`[3, 4, 2]`
4	$\times$	Pop 2, 4 $\rightarrow$ $4 \times 2 = 8$	`[3, 8]`
5	$+$	Pop 8, 3 $\rightarrow$ $3 + 8 = 11$	`[11]`

Final Result:

\text{Result} = 11

Final Answer

Bina function calls wale expression ko evaluate karne ke liye Stack Data Structure aur Postfix Notation ka upyog kiya jata hai. Is technique ko Stack-based evaluation kehte hain.