Scribd Logo
Upload

Welcome to Scribd!

  • Data Structures - 11ES202 Home Assignment - 2

    Uploaded by

    Chaitanya Krishna Reddy
    27 views1 page
    The document provides instructions for a data structures homework assignment. It lists 8 problems to solve involving different data structures: 1) Create and test an AVL tree, 2) Implement AVL tree operations, 3) Explain hashing and implement hash tables, 4) Implement binary search trees, 5) Create and test a B-tree, 6) Explain splay tree rotations and build an expression tree, 7) Compare external and internal sorting and explain external sorting methods, 8) Implement and test heap sort. Students are instructed to submit their source code with comments and formatting for evaluation.

    Original Description:

    Data-structures Assignment

    Original Title

    Ds Homeassignment 2

    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
    The document provides instructions for a data structures homework assignment. It lists 8 problems to solve involving different data structures: 1) Create and test an AVL tree, 2) Implement AVL tree operations, 3) Explain hashing and implement hash tables, 4) Implement binary search trees, 5) Create and test a B-tree, 6) Explain splay tree rotations and build an expression tree, 7) Compare external and internal sorting and explain external sorting methods, 8) Implement and test heap sort. Students are instructed to submit their source code with comments and formatting for evaluation.

    Copyright:

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

    Data Structures - 11ES202 Home Assignment - 2

    Uploaded by

    Chaitanya Krishna Reddy
    The document provides instructions for a data structures homework assignment. It lists 8 problems to solve involving different data structures: 1) Create and test an AVL tree, 2) Implement AVL tree operations, 3) Explain hashing and implement hash tables, 4) Implement binary search trees, 5) Create and test a B-tree, 6) Explain splay tree rotations and build an expression tree, 7) Compare external and internal sorting and explain external sorting methods, 8) Implement and test heap sort. Students are instructed to submit their source code with comments and formatting for evaluation.

    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

    Data Structures 11ES202 Home Assignment 2

    Submission date: 26 October 2013 Mode of submission: Programs written in Lab Observation book Format: Source code with line numbers, Comments, Indentation Evaluation: viva voce + Program Execution (which should be shown in the laptop)

    1.

    Create AVL Tree with the following set of identifiers .apply and explain required rotations. 3,2,1,4,5,6,7,16,15,14,13,12,11,10,9,8,34,27,18.

    2. Implement and test all AVL Tree operations 3. A) What is Hashing .Explain different hashing method with examples? b) Implement a program to resolve collisions in hash table with separate chaining and open addressing techniques 4. What are the properties of Binary Search trees (BST)? Implement and test all BST functions(Create, Insertion ,deletion, MakeEmpty, FindMin, FindMax) 5. A) Create B-Tree of order5 with the following numbers. 3,2,1,4,5,6,7,16,15,14,13,12,11,10,9,8,34,27,18. b) Write and implement algorithms to add and multiply polynomials using arrays and linked list 6. A)Explain Zig-Zig ,Zig Zag rotation of Splay tree with neat diagrams b)Construct Expression Tree with your own expression 7. Differentiate external Sorting and Internal Sorting. Explain Different External sorting method. 8. Develop a program to implement and test heap sort technique

    You might also like