Scribd Logo
Upload

Welcome to Scribd!

  • Assignement 2

    Uploaded by

    knkeshari03
    3 views1 page
    1) The document provides assignments for the Data Structures course, including converting infix to postfix and prefix notation, writing algorithms for infix to postfix and prefix conversion, implementing conversions using a stack, and explaining the differences between stacks and queues. 2) Students are asked to write C programs that implement a stack using a linked list, perform insertion and deletion on a queue, and insert and delete from a double-ended queue. 3) The final assignment involves writing an algorithm and explaining the working of the Tower of Hanoi problem using diagrams for 4 disks.

    Original Description:

    Original Title

    Assignement 2 (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1) The document provides assignments for the Data Structures course, including converting infix to postfix and prefix notation, writing algorithms for infix to postfix and prefix conversion, implementing conversions using a stack, and explaining the differences between stacks and queues. 2) Students are asked to write C programs that implement a stack using a linked list, perform insertion and deletion on a queue, and insert and delete from a double-ended queue. 3) The final assignment involves writing an algorithm and explaining the working of the Tower of Hanoi problem using diagrams for 4 disks.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    3 views1 page

    Assignement 2

    Uploaded by

    knkeshari03
    1) The document provides assignments for the Data Structures course, including converting infix to postfix and prefix notation, writing algorithms for infix to postfix and prefix conversion, implementing conversions using a stack, and explaining the differences between stacks and queues. 2) Students are asked to write C programs that implement a stack using a linked list, perform insertion and deletion on a queue, and insert and delete from a double-ended queue. 3) The final assignment involves writing an algorithm and explaining the working of the Tower of Hanoi problem using diagrams for 4 disks.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    GALGOTIAS COLLEGE OF ENGINEERING AND TECHNOLOGY

    1, Knowledge Park-II, Greater Noida, U.P.


    Odd Semester 2022-23

    Subject: Data Structure Subject Code: BCS-301

    Branch: CSE Semester: III

    Assignment-2-(CO2)
    1. Convert infix to postfix and prefix.
    a) ((A-(B+C))*D)^(E+F)
    b) A*(B+C^D)-E^F*(G/H)
    c) (A+B)*(C-D)
    2. Write an algorithm to convert Infix to Postfix, and Infix to Prefix conversion.
    3. Convert infix to postfix by using stack method.
    a. A+B-C/D*E*F*G/H.
    b. PQ+S*TU-^
    4. Explain the difference between stack and queue. And also explain the advantage and
    disadvantage stack and queue.
    5. Write a C program to implement a stack using linked list.
    6. Write a C Program to insertion and deletion in queue.
    7. Write a program to insert and delete in double ended queue (DEQUE).
    8. Write an algorithm for finding solution to the Tower’s of Hanoi problem. Explain the working
    of your algorithm (with 4 disks) with diagrams.

    You might also like