Scribd Logo
Upload

Welcome to Scribd!

  • 1 views

    DSA-CIA2

    Uploaded by

    hodshsrce

    Copyright:

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

    DSA-CIA2

    Uploaded by

    hodshsrce
    1 views2 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

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

    DSA-CIA2

    Uploaded by

    hodshsrce

    Copyright:

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

    Reg. No.

    DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING


    R21 CD3291-DATA STRUCTURES AND ALGORITHMS

    CONTINOUS INTERNAL ASSESMENT TEST - II

    Time : 3 Hrs. QUESTION CODE : CS22404 Maximum Marks:100


    Session : AN Year / Sem : II /III Date : 18.11.2024
    Answer ALL questions
    PART – A (10X2=20 Marks)
    BT
    Q.No QUESTIONS CO’s
    Level
    1) Difference between Internal and External sorting. CO 1 K1
    2) List out advantages and disadvantages of binary search. CO 1 K1
    3) Define Mid Square Method. CO 1 K1
    4) Enlist the conditions in which the rehashing is required. CO 1 K2
    5) Define collision in hashing. What are the collision resolution methods? CO 1 K3
    6) Difference between linear data structures and non-linear data structures. CO 2 K1
    7) What is meant by full binary tree and complete binary tree? CO 2 K1
    8) Compare AVL tree and Binary Search Tree. CO 2 K3
    9) Define tree traversal. What are the different types of tree traversal Techniques? CO 2 K1
    10) List the applications of trees. CO 2 K1
    Answer ALL questions
    PART – B (5X13 =65 Marks)

    11) (a) Write an algorithm of insertion sort using following elements.


    50,10,78,40,30,02,04,15 (13) CO1 K2
    (OR)
    (b) Explain Merge Sort with example. Obtain Worst case and (13) CO1 K2
    Average case time complexity.

    12) (a) Show all passes to sort the values in ascending order using Quick (13) CO 1 K4
    Sort 25,57,48,37,82,92,86,33
    (OR)
    (b) Explain Collision handling Techniques with example. (13) CO1 K1

    13) (a) (i)Detail about hashing concepts & its functions (7) CO2 K2
    (ii)Sort and show the status after every pass using Selection Sort (6) CO2 K1
    (OR)
    (b) Explain about Heap Tree & Its Operations With Example. (13) CO3 K1
    14) (a) Define Binary Tree ADT. Discuss the types And Representation of (13) CO3 K6
    Binary Tree with following elements 100, 85, 45, 55, 110, 20, 70, 65
    (OR)
    (b) (i) Explain about Tree Traversal Technique (5) CO2 K5
    (ii)Discuss Multiway Search Tree with example. (8) CO3 K3

    15) (a) Implement AVL Tree using python to insert the following (13) CO3 K5
    elements 2, 1,4,5,9,3,6,7.
    (OR)
    (b) Explain Heap sort with algorithm for following numbers (13) CO3 K1
    48, 0,-1, 82, 108, 72, 54.

    PART – C (1X15=15 Marks)

    16 (a) Explain the Searching Techniques with algorithm and suitable (15) CO3 K2
    Example
    (OR)
    (b) What is Binary Search Tree. Draw the Binary Search Tree for the (15) CO2 K6
    following inputs 14,5,6,2,18,20,16,18,-1,21

    Checked by Approved by
    Mr.R.Dinesh Raj-HoD/CSE Principal

    Prepared by

    Mrs.C.Surya-AP/CSE

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy