Bit 9 Assign3

NUST School of Electrical Engineering and Computer Science Data Structures Assignment-3 (BIT-9 A&B) Submission Date: Monday, 12th May 2008 at 1300 hrs MAX MARKS : 10 A: This assignment is to be done by each student individually. You are allowed to discuss the general concepts with other students, but these discussions must end the moment you start programming. B: 50% marks will be given for the complete correct code and rest of the marks will be given after the demonstration. C: This is ANONYMOUS assignment, therefore, your name should NOT appear on the assignment (NEITHER ON SOFT-COPY NOR ON HARD-COPY), only the registration number should be mentioned.

Deliverables: 1. Hard-copy to PA to HoD of ISE (i.e in AB-2) well in time. Each page must have your registration number on it 2. Submit a soft-copy electronically on MyDropBox 3. Email a soft-copy having the subject “assignment3” on the following e-mail address: - [email protected] (for BIT-9A students) - [email protected] (for BIT-9B students) The name of the file (submitted on MyDropBox as well as the one sent via email) should be your complete registration number followed by your section. i.e. for example, 2007-NUST-BIT-999-A (WITHOUT any space in between) WARNING: • Assignment will not be considered, if the above rules are not followed. • Late assignment policy applies

Write a program that takes as input an expression in infix notation and displays the given expression in postfix notation as its output. Assume that the expression being entered is a character string and each operand (whether a variable or a constant) is no more than one character, for your own convenience.