Scribd Logo
Upload

Welcome to Scribd!

  • EASACOLLEGE Advanced Data Structures and Algorithms Internal Test

    Uploaded by

    Nithya Subramanian
    14 views1 page
    This document contains an internal test from EASACollege of Engineering & Technology in Coimbatore, India from the 2011-2010 academic year. The test is for the subject Advanced Data Structures and Algorithms, and contains multiple choice and short answer questions about various heap data structures, including min-max heaps, binomial heaps, Fibonacci heaps, skew heaps, lazy-binomial heaps, and leftist heaps. Students are asked to explain the operations and properties of these different heap structures.

    Original Description:

    Original Title

    Second Int

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains an internal test from EASACollege of Engineering & Technology in Coimbatore, India from the 2011-2010 academic year. The test is for the subject Advanced Data Structures and Algorithms, and contains multiple choice and short answer questions about various heap data structures, including min-max heaps, binomial heaps, Fibonacci heaps, skew heaps, lazy-binomial heaps, and leftist heaps. Students are asked to explain the operations and properties of these different heap structures.

    Copyright:

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

    EASACOLLEGE Advanced Data Structures and Algorithms Internal Test

    Uploaded by

    Nithya Subramanian
    This document contains an internal test from EASACollege of Engineering & Technology in Coimbatore, India from the 2011-2010 academic year. The test is for the subject Advanced Data Structures and Algorithms, and contains multiple choice and short answer questions about various heap data structures, including min-max heaps, binomial heaps, Fibonacci heaps, skew heaps, lazy-binomial heaps, and leftist heaps. Students are asked to explain the operations and properties of these different heap structures.

    Copyright:

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

    EASACOLLEGE

    OF ENGINEERING & TECHNOLOGY, COIMBATORE


    EASACOLLEGE
    OF ENGINEERING & TECHNOLOGY, COIMBATORE

    Internal Test II (Academic year 2011-2010 ODD Semester) Internal Test II (Academic year 2011-2010 ODD Semester)

    Subject code: CP9112 Date: Subject code: CP9112 Date:


    Name: Advanced Data Structures and Algorithms Name: Advanced Data Structures and Algorithms
    Class: I ME Duration 2 Hrs Class: I ME Duration 2 Hrs
    Max Marks: 50 Max Marks: 50
    PART – A PART – A
    Answer for all Questions (7X2 = 14) Answer for all Questions (7X2 = 14)
    1. What are the operations performed in a Min-Max Heap. 1. What are the operations performed in a Min-Max Heap.
    2. Define Deaps? 2. Define Deaps?
    3. What is the Definition of A Min (Max) Leftist Tree. 3. What is the Definition of A Min (Max) Leftist Tree.
    4. A node in a B-heap has the following data members Explain briefly 4. A node in a B-heap has the following data members Explain briefly
    5. What are the Operations in a Fibonacci heap is a data structure that 5. What are the Operations in a Fibonacci heap is a data structure that
    supports the three binomial heap operations supports the three binomial heap operations
    6. What are the Problems with leftist heaps overcome by the Skew Heaps 6. What are the Problems with leftist heaps overcome by the Skew Heaps

    PART – B PART – B
    Answer for all Questions (3X12 = 36) Answer for all Questions (3X12 = 36)

    7. Explain in detail about the Min-max heaps.(12) 7. Explain in detail about the Min-max heaps.(12)
    OR OR
    8. Explain in detail about the Binomial heaps. 8. Explain in detail about the Binomial heaps.

    9. Explain in detail about the Fibonacci heaps (12) 9. Explain in detail about the Fibonacci heaps (12)
    OR OR
    10. Explain in detail about the Skew heaps (12) 10. Explain in detail about the Skew heaps (12)
    11. Explain in detail about the Lazy-binomial heaps (12) 11. Explain in detail about the Lazy-binomial heaps (12)
    OR OR
    12. Explain in detail about the Leftist heaps (12) 12. Explain in detail about the Leftist heaps (12)

    ALL THE BEST


    ALL THE BEST

    You might also like