DSA Series - Infix → Postfix Exercises (C Edition, Easy(10), Medium(10), Gate Exam Level(10))

on

 


10 Infix → Postfix Exercises (C Edition – DSA Series)

[Follow here] for daily coding insights.

(Answers provided at the end)

Exercise 1

Convert the following infix expression to postfix:

A + B

Exercise 2

Convert:

A + B * C

Exercise 3

Convert:

(A + B) * C

Exercise 4

Convert:

A * (B + C) / D

Exercise 5

Convert:

A + B * C - D

Exercise 6

Convert:

(A + B) * (C - D)

Exercise 7

Convert:

A + (B * C - D) / E

Exercise 8

Convert:

A ^ B ^ C

(Remember: ^ is right associative)

Exercise 9

Convert:

(A + B * (C - D)) / E

Exercise 10

Convert:

( (A + B) * (C + D) ) / (E - F * G)

ANSWERS (Postfix)

Match your answers here:

Exercise 1

A B +

Exercise 2

A B C * +

Exercise 3

A B + C *

Exercise 4

A B C + * D /

Exercise 5

A B C * + D -

Exercise 6

A B + C D - *

Exercise 7

A B C * D - E / +

Exercise 8

A B C ^ ^

Exercise 9

A B C D - * + E /

Exercise 10

A B + C D + * E F G * - /

**Answers provided at the end.**

10 Tough Infix → Postfix Conversion Exercises

Exercise 1

A * (B + C / (D - E)) ^ F

Exercise 2

(A + B * (C ^ D - E)) / (F + G * H)

Exercise 3

( A ^ (B * C) ) + (D / (E - F * G))

Exercise 4

A + B * (C + D * (E ^ F - G))

Exercise 5

((A + B) * (C - D)) ^ (E + F / (G - H))

Exercise 6

A * B + C / D - E ^ (F + G * H)

Exercise 7

(A + (B * C)) ^ (D - (E / F ^ G))

Exercise 8

(A - B / (C + D)) * (E ^ (F - G * H))

Exercise 9

((A ^ B) * (C + D)) / (E - (F + G / H))

Exercise 10

A + (B - (C * (D ^ (E - F)))) / (G + H * I)

ANSWERS — Postfix (Complex Level)

Exercise 1

A B C D E - / + F ^ *

Exercise 2

A B C D ^ E - * + F G H * + /

Exercise 3

A B C * ^ D E F G * - / +

Exercise 4

A B C D E F ^ G - * + * +

Exercise 5

A B + C D - * E F G H - / + ^

Exercise 6

A B * C D / + E F G H * + ^ -

Exercise 7

A B C * + D E F G ^ / - ^

Exercise 8

A B C D + / - E F G H * - ^ *

Exercise 9

A B ^ C D + * E F G H / + - /

Exercise 10

A B C D E F - ^ * - G H I * + /

10 GATE-Level Very High Difficulty Infix → Postfix Exercises

Exercise 1

A ^ (B * (C + D ^ (E - F * (G + H))))

Exercise 2

((A - B) / (C + D * (E ^ (F - G)))) + H

Exercise 3

A * (B + (C - (D ^ (E / (F + G - H))))) / I

Exercise 4

(A + B * (C - D)) ^ ((E / F) + (G - (H * I ^ J)))

Exercise 5

((A ^ (B - C * D)) + (E / (F + G ^ H))) * (I - (J / (K + L)))

Exercise 6

A - (B * (C + (D * (E - (F / (G ^ H))))))

Exercise 7

( (A/B) ^ (C - (D * (E + F ^ (G - H)))) ) + I * J

Exercise 8

((A + (B - C)) * (D ^ (E - (F * (G / (H - I)))))) / (J + K - L)

Exercise 9

A ^ B ^ (C + (D / (E - (F * (G ^ (H - I)))))) - J

Exercise 10

( (A + B - (C / (D ^ (E - F)))) * (G + H * (I - (J / (K + L ^ M)))) ) ^ N

ANSWERS — Postfix (GATE-Level)

Exercise 1

A B C D E F G H + * - ^ + * ^

Exercise 2

A B - C D E F G - ^ * + / H +

Exercise 3

A B C D E F G + H - / ^ - + * I /

Exercise 4

A B C D - * + E F / G H I J ^ * - + ^

Exercise 5

A B C D * - ^ E F G H ^ + / + I J K L + / - *

Exercise 6

A B C D E F G H ^ / - * + * -

Exercise 7

A B / C D E F G H - ^ + * - ^ I J * +

Exercise 8

A B C - + D E F G H I - / * - ^ * J K + L - /

Exercise 9

A B ^ C D E F G H I - ^ * - / + ^ ^ J -

Exercise 10

A B + C D E F - ^ / - G H I J K L M ^ + / - * N ^

ALSO CHECK 

DS(Data Structure) Python&C Edition

DSA Series Chapter 1 Time & Space Complexity ( C Edition)

DSA Series Chapter 2 Arrays  (C Version)


DSA Series Chapter 2 Arrays  (Python Version)

DSA Series Chapter 3 Strings (C Version)


DSA Series Chapter 3 Strings (Python Version)


DSA Series Chapter 4 Linked Lists (Python Version)


DSA Series Chapter 4 Linked Lists (C Version)


DSA Series Chapter 5 Stacks (Python Version)


DSA Series Chapter 5  Stacks  (C Version)









Tail Recursion Optimization: How Compilers Convert Recursion Into Iteration


Advanced Recursion: Memoization vs. Tabulation — The Deep Optimization Blueprint for Professionals


Advanced Sorting Algorithms: Merge Sort Internals — Merge Tree, Cache Behavior & Real Cost Analysis


Enjoyed this post? [Follow here] for daily coding insights.

Comments

Post a Comment