Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    DS Set-2 (Iat-2)

    Uploaded by

    s28903445
    Ds

    Copyright:

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

    DS Set-2 (Iat-2)

    Uploaded by

    s28903445
    3 views1 page
    Ds

    Original Title

    DS SET-2(IAT-2)

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Ds

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    3 views1 page

    DS Set-2 (Iat-2)

    Uploaded by

    s28903445
    Ds

    Copyright:

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

    DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

    BATCH (2023-2027): II YEAR / III SEM


    CS3301 – DATA STRUCTURES (R 2021)
    INTERNAL ASSESSMENT TEST-II
    DATE: 21.10.24 TIME: 1.45 HRS TOTAL MARKS: 60

    PART- A (6x2= 12 MARKS)

    1. Write the routine to push a element into a stack.?(C204.2)(PO2)


    2. How the stack is implemented by linked list?.(C204.2) (PO1)
    3.Define double ended queue. (C204.2) (PO2)
    4. What are enqueue and dequeue operations?.(C204.2)(PO1)

    5. Convert the infix expression (A-B/C)*(D/E-F) into a postfix..(C204.3) (PO11)

    6. What is meant by binary search tree?. (C204.3)(PO12)


    PART -B (4x12 = 48 MARKS)

    7. Explain how to evaluate arithmetic expressions using stacks. .(C204.3) (PO11)


    8. Explain b tree and B+ tree ADT in detail..(C204.3) (PO11)
    9. Explain AVL tree ADT in detail..(C204.3) (PO11)
    10. Explain Heap tree ADT in detail.. ?(C204.2)(PO2)

    PREPARED BY CHECKED BY APPROVED BY

    You might also like