Scribd Logo
Upload

Welcome to Scribd!

  • R7210503 Advanced Data Structures

    Uploaded by

    sivabharathamurthy
    15 views1 page
    This document contains exam questions for an Advanced Data Structures course covering various data structures and algorithms topics. The questions assess knowledge of function overloading and runtime polymorphism using virtual functions, algorithm performance analysis, stack abstract data type implementation, collision resolution techniques for hash tables, priority queue implementation, external sorting techniques, AVL tree operations and examples, red-black tree operations, B-tree deletion, brute force pattern matching, and tries. Students are instructed to answer 5 of the 8 questions in detail.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains exam questions for an Advanced Data Structures course covering various data structures and algorithms topics. The questions assess knowledge of function overloading and runtime polymorphism using virtual functions, algorithm performance analysis, stack abstract data type implementation, collision resolution techniques for hash tables, priority queue implementation, external sorting techniques, AVL tree operations and examples, red-black tree operations, B-tree deletion, brute force pattern matching, and tries. Students are instructed to answer 5 of the 8 questions in detail.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    15 views1 page

    R7210503 Advanced Data Structures

    Uploaded by

    sivabharathamurthy
    This document contains exam questions for an Advanced Data Structures course covering various data structures and algorithms topics. The questions assess knowledge of function overloading and runtime polymorphism using virtual functions, algorithm performance analysis, stack abstract data type implementation, collision resolution techniques for hash tables, priority queue implementation, external sorting techniques, AVL tree operations and examples, red-black tree operations, B-tree deletion, brute force pattern matching, and tries. Students are instructed to answer 5 of the 8 questions in detail.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    Code: R7210503

    R07

    II B.Tech I Semester (R07) Supplementary May 2012 Examinations ADVANCED DATA STRUCTURES
    (Common to Computer Science & Engineering and Electronics & Computer Engineering) Time: 3 hours Max. Marks: 80 Answer any FIVE questions All questions carry equal marks 1. 2. (a) (b) (a) (b) ***** Discuss various types of functions of detail. Write a short note on function overloading. How we can implement runtime polymorphism using virtual functions? Explain. How we can measure the performance of an algorithm? Discuss. Define abstract data type. Explain the implementation of stack ADT in detail. Discuss various collision resolution techniques in detail. (a) (b) Discuss priority quemes implementation in detail. Discuss external sorting technique with example. Define AVL tree. Discuss in detail about various operations on AVL trees with examples. (a) (b) (a) (b) List various operations on red-black trees. Explain in detail. Explain the method of deletion operation on B-trees with example. Discuss brute force pattern matching algorithm. Write a short note on tries.

    3.

    4. 5.

    6.

    7.

    8.

    *****

    You might also like