Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    Mca Winter 2021

    Uploaded by

    tilaksondagar411

    Copyright:

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

    Mca Winter 2021

    Uploaded by

    tilaksondagar411
    5 views1 page

    Original Title

    629401-MCA-WINTER-2021

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

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

    Mca Winter 2021

    Uploaded by

    tilaksondagar411

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 1

    Seat No.: ________ Enrolment No.

    ______________

    GUJARAT TECHNOLOGICAL UNIVERSITY


    MCA – SEMESTER -II EXAMINATION –WINTER-2021

    Subject Code: 629401 Date: 29/12/2021


    Subject Name: Data Structures
    Time: 02:30 PM TO 05:00 PM Total Marks: 70
    Instructions:

    1. Attempt all questions.


    2. Make Suitable assumptions wherever necessary.
    3. Figures to the right indicate full marks.

    Q.1 (a) Answer the following questions. 07


    1. Define data structure.
    2. Is Queue a priority queue? Justify?
    3. Mention variations of the queue data structure.
    4. Give two applications of graphs?
    5. List operations performed on a stack.
    6. What is the complexity of binary search algorithm?
    7. Write two simple hash functions?
    (b) Discuss various methods to resolve hash collision with suitable examples. 07
    Q.2 (a) Explain the data structure classification. 07
    (b) Explain Selection sort with algorithm. 07
    OR
    (b) Different between Linear Data Structures vs Linear Data Structures. 07
    Q.3 (a) What is Tree Node? List the BST Basic Operations and discuss it. 07
    (b) Explain Operations on data structure with operation. 07

    OR
    Q.3 (a) Describe the concept of Linear Data Structures with array Basic Operations. 07

    (b) Explain Doubly Linked List with basic operations. 07

    Q.4 (a) Explain Load Factor and Rehashing in Hashing works. 07


    (b) Discuss between Bubble sort and Insertion sort in details. 07
    OR
    Q.4 (a) Enlist and briefly explain various application of stack. 07
    (b) Discuss various rehashing techniques. 07
    Q.5 (a) Write an algorithm to perform various operations (insert, delete and display) for 07
    simple queue.
    (b) Differentiate between Stack and Queue. 07
    OR
    Q.5 (a) What is binary tree traversal? What are the various traversal methods? Explain 07
    any two with suitable example.
    (b) List advantages and disadvantages of Breadth First Search and Depth First 07
    Search.

    *************

    You might also like