Scribd Logo
Hochladen

Willkommen bei Scribd!

  • DSA-Assignment No-1

    Hochgeladen von

    harshubhoskar3500
    10 Ansichten1 Seite
    1. A circular queue is better than a linear queue because it uses memory efficiently by avoiding empty spaces and overflow. 2. Stack overflow occurs when the stack is full and underflow occurs when it is empty. A program is provided to demonstrate these conditions. 3. The main differences between a stack and an array are that a stack follows LIFO order and can be dynamically resized while an array follows FIFO order and has a fixed size.

    Originalbeschreibung:

    A1

    Originaltitel

    a-1

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Verfügbare Formate

    DOCX, PDF, TXT oder online auf Scribd lesen

    Stufen Sie dieses Dokument als nützlich ein?

    Sind diese Inhalte unangemessen?

    Dieses Dokument melden
    1. A circular queue is better than a linear queue because it uses memory efficiently by avoiding empty spaces and overflow. 2. Stack overflow occurs when the stack is full and underflow occurs when it is empty. A program is provided to demonstrate these conditions. 3. The main differences between a stack and an array are that a stack follows LIFO order and can be dynamically resized while an array follows FIFO order and has a fixed size.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Als DOCX, PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    10 Ansichten1 Seite

    DSA-Assignment No-1

    Hochgeladen von

    harshubhoskar3500
    1. A circular queue is better than a linear queue because it uses memory efficiently by avoiding empty spaces and overflow. 2. Stack overflow occurs when the stack is full and underflow occurs when it is empty. A program is provided to demonstrate these conditions. 3. The main differences between a stack and an array are that a stack follows LIFO order and can be dynamically resized while an array follows FIFO order and has a fixed size.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Als DOCX, PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    von 1

    DSA- Assignment No-1 2013

    1. Explain the concept of circular Queue? How circular queue is better than linear Queue. 2. What do you understand by Stack Overflow and underflow? Write a program for stack and show overflow and underflow condition. 3. Differentiate between stack and array. 4. Explain the term infix, prefix and postfix. And convert the following infix expression to postfix. I. ((A*B)+(C/D)-(D+E)) II. (A-2*(B+C)/(D*E)+F 5. Draw the queue structure for following operations, I. ADD a,b,c,d,e,f II. Delete two alphabets III. Add G IV. Add H V. Delete four alphabets VI. Add I 6. Differentiate between linked list and linear array. Which one will you preferred to use. 7. Why doubly linked list is more useful than singly linked list. 8. Give the advantages and uses of circular linked list.

    By: Prof. Yogita D. Mane Department Of computer Engineering, UCOE, Kaman

    Das könnte Ihnen auch gefallen