Scribd Logo
Upload

Welcome to Scribd!

  • 48 views

    University of Lahore, Islamabad Campus: Course: Dsa Assignment No.2

    Uploaded by

    Ramish Shakeel
    (1) The document contains an assignment submission for the course Data Structures and Algorithms (DSA). (2) It includes converting four infix expressions to prefix and postfix notation as well as drawing their parse trees. (3) The student provided the work and answers for converting and drawing the parse trees of the four expressions as required in the assignment.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    University of Lahore, Islamabad Campus: Course: Dsa Assignment No.2

    Uploaded by

    Ramish Shakeel
    48 views9 pages
    (1) The document contains an assignment submission for the course Data Structures and Algorithms (DSA). (2) It includes converting four infix expressions to prefix and postfix notation as well as drawing their parse trees. (3) The student provided the work and answers for converting and drawing the parse trees of the four expressions as required in the assignment.

    Original Title

    A2.70065661.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    (1) The document contains an assignment submission for the course Data Structures and Algorithms (DSA). (2) It includes converting four infix expressions to prefix and postfix notation as well as drawing their parse trees. (3) The student provided the work and answers for converting and drawing the parse trees of the four expressions as required in the assignment.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    48 views9 pages

    University of Lahore, Islamabad Campus: Course: Dsa Assignment No.2

    Uploaded by

    Ramish Shakeel
    (1) The document contains an assignment submission for the course Data Structures and Algorithms (DSA). (2) It includes converting four infix expressions to prefix and postfix notation as well as drawing their parse trees. (3) The student provided the work and answers for converting and drawing the parse trees of the four expressions as required in the assignment.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 9

    UNIVERSITY OF LAHORE, ISLAMABAD

    CAMPUS

    COURSE: DSA
    Assignment no.2
     Name : Iqra younis
     Class : BSSE
     Roll No : SEU-F16-148(70065661)
     Semester: 8th

    SUBMITTED TO: Sir Zafar Iqbal


    Q No. 1
    Convert the given below infix notations into Prefix and Postfix Notation following proper steps. Also
    convert the notations to parse tree. (Assignment is hand written)

    ( (A + B) ∗ C) – D
    ( (A * B) + (C / D) )
    ((A * (B + C) ) / D)
    (A * (B + (C / D) ) )
    ANSWER:
    ( (A + B) ∗ C) – D

    Reverse the resultant expression for prefix


    Sr. no. Expression Stack Prefix
    0 D ( D
    1 ( D
    2 – ( D –
    3 ( D –
    4 ( (( D –
    5 C (( D – C
    6 (( D – C
    7 (( D – C
    8 ∗ (( D – C ∗
    9 (( D – C ∗
    10 ( ((( D – C ∗
    11 B ((( D – C ∗ B
    12 ((( D – C ∗ B
    13 + (((+ D – C ∗ B
    14 (((+ D – C ∗ B
    15 A (((+ D – C ∗ B A
    16 ) (( D – C ∗ B A+
    17 (( D – C ∗ B A+
    18 ) ( D – C ∗ B A+
    19 ) D – C ∗ B A+
    Reverse the resultant expression for prefix
    Sr. no. Expression Stack Postfix
    0 ( ((
    1 ((
    2 ( (((
    3 A ((( A
    4 ((( A
    5 + (((+ A
    6 (((+ A
    7 B (((+ A B
    8 ) (( A B+
    9 (( A B+
    10 ∗ (( A B+ ∗
    11 (( A B+ ∗
    12 (( A B+ ∗
    13 C (( A B+ ∗ C
    14 ) ( A B+ ∗ C
    15 ( A B+ ∗ C
    16 – ( A B+ ∗ C –
    17 ( A B+ ∗ C –
    18 D ( A B+ ∗ C – D
    19 ) A B+ ∗ C – D
    ( (A * B) + (C / D) )

    Reverse the resultant expression for prefix


    Sr. no. Expression Stack Prefix
    0 ( ((
    1 ((
    2 ( (((
    3 D ((( D
    4 ((( D
    5 / (((/ D
    6 (((/ D
    7 C (((/ D C
    8 ) (( D C/
    9 (( D C/
    10 + ((+ D C/
    11 ((+ D C/
    12 ( ((+( D C/
    13 B ((+( D C/ B
    14 ((+( D C/ B
    15 * ((+(* D C/ B
    16 ((+(* D C/ B
    17 A ((+(* D C/ B A
    18 ) ((+ D C/ B A*
    19 ((+ D C/ B A*
    20 ) ( D C/ B A* +
    21 ) D C/ B A* +
    Reverse the resultant expression for prefix
    Sr. no. Expression Stack Postfix
    0 ( ((
    1 ((
    2 ( (((
    3 A ((( A
    4 ((( A
    5 * (((* A
    6 (((* A
    7 B (((* A B
    8 ) (( A B*
    9 (( A B*
    10 + ((+ A B*
    11 ((+ A B*
    12 ( ((+( A B*
    13 C ((+( A B* C
    14 ((+( A B* C
    15 / ((+(/ A B* C
    16 ((+(/ A B* C
    17 D ((+(/ A B* C D
    18 ) ((+ A B* C D/
    19 ((+ A B* C D/
    20 ) ( A B* C D/ +
    21 ) A B* C D/ +
    ((A * (B + C) ) / D)
    Reverse the resultant expression for prefix
    Sr. no.Expression Stack Prefix
    0 ( ((
    1 D (( D
    2 (( D
    3 / ((/ D
    4 ((/ D
    5 ( ((/( D
    6 ((/( D
    7 ( ((/(( D
    8 C ((/(( DC
    9 ((/(( DC
    10 + ((/((+ D C
    11 ((/((+ D C
    12 B ((/((+ D C B
    13 ) ((/( D C B+
    14 ((/( D C B+
    15 * ((/(* D C B+
    16 ((/(* D C B+
    17 A ((/(* D C B+ A
    18 ) ((/ D C B+ A*
    19 ) ( D C B+ A*/
    20 ) D C B+ A*/
    Reverse the resultant expression for prefix
    Sr. no.Expression Stack Postfix
    0 ( ((
    1 ( (((
    2 A ((( A
    3 ((( A
    4 * (((* A
    5 (((* A
    6 ( (((*( A
    7 B (((*( AB
    8 (((*( AB
    9 + (((*(+ A B
    10 (((*(+ A B
    11 C (((*(+ A B C
    12 ) (((* A B C+
    13 (((* A B C+
    14 ) (( A B C+ *
    15 (( A B C+ *
    16 / ((/ A B C+ *
    17 ((/ A B C+ *
    18 D ((/ A B C+ * D
    19 ) ( A B C+ * D/
    20 ) A B C+ * D/
    (A * (B + (C / D) ) )
    Reverse the resultant expression for prefix
    Sr. no. Expression Stack Prefix
    0 ( ((
    1 ((
    2 ( (((
    3 (((
    4 ( ((((
    5 D (((( D
    6 (((( D
    7 / ((((/ D
    8 ((((/ D
    9 C ((((/ D C
    10 ) ((( D C/
    11 ((( D C/
    12 + (((+ D C/
    13 (((+ D C/
    14 B (((+ D C/ B
    15 ) (( D C/ B+
    16 (( D C/ B+
    17 * ((* D C/ B+
    18 ((* D C/ B+
    19 A ((* D C/ B+ A
    20 ) ( D C/ B+ A*
    21 ) D C/ B+ A*

    Reverse the resultant expression for prefix

    Sr. no. Expression Stack Postfix

    0 ( ((

    1 A (( A

    2 (( A

    3 * ((* A

    4 ((* A

    5 ( ((*( A

    6 B ((*( AB

    7 ((*( AB

    8 + ((*(+ A B

    9 ((*(+ A B
    10 ( ((*(+( A B

    11 C ((*(+( A B C

    12 ((*(+( A B C

    13 / ((*(+(/ A B C

    14 ((*(+(/ A B C

    15 D ((*(+(/ A B C D

    16 ) ((*(+ A B C D/

    17 ((*(+ A B C D/

    18 ) ((* A B C D/ +

    19 ((* A B C D/ +

    20 ) ( A B C D/ + *

    21 ) A B C D/ + *

    You might also like