Scribd Logo
Upload

Welcome to Scribd!

  • 10 views

    Sem3 2023-24

    Uploaded by

    Nachiket Panchal

    Copyright:

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

    Sem3 2023-24

    Uploaded by

    Nachiket Panchal
    10 views1 page

    Original Title

    202040301_Sem3_2023-24

    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
    10 views1 page

    Sem3 2023-24

    Uploaded by

    Nachiket Panchal

    Copyright:

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

    Enrollment No.

    ____________________

    ADIT / GCET / MBIT


    (CONSTITUENT INSTITUTION OF CVMU)
    BE – SEMESTER -3 INTERNAL EXAMINATION – OCTOBER 2023
    202040301 – DATA STRUCTURES
    Date: 06/10/2023 Time: 10:00 AM to 11:00 AM Maximum Marks: 20
    Instructions:
    1. Figures on the right indicate full marks.
    2. Make the suitable assumption if required, do specify the same.

    Q. 1 Answer the Following. (Each question carries one mark). [04]


    (i) List primitive data structures. CO1 R
    (ii) Mention various operations that can be performed on array. CO2 R
    (iii) Define recursion. CO2 R
    (iv) List a disadvantage of simple queue. CO2 U

    Q. 2 (A) (i) What do you mean by data structure? Explain its importance. [04] CO1 U
    (ii) Mention two advantages of arrays.
    (B) State the importance of Postfix expression. Convert the following Infix expression [04] CO2 N
    into Postfix form.
    Infix Expression: ( A – B ) * ( C / D ) – E $ ( F – G )
    OR
    (B) Explain the operations on Stack with overflow and underflow conditions. [04] CO2 U

    Q. 3 (A) Discuss the types of linked list. Write an algorithm/pseudocode to insert a node at the [04] CO2 A
    end of the linked list.
    (B) What is a priority queue? Mention types of priority queue. Give its applications. [04] CO2 U
    OR
    (B) Consider the circular queue given below. It has REAR = 8 and FRONT = 1. [04] CO2 E
    0 1 2 3 4 5 6 7 8 9
    11 65 34 25 87 56 65 43
    Perform the following operations on the queue and show the status of the queue
    after every operation:
    1) Delete one element from the queue
    2) Add 52 to the queue
    3) Delete two elements from the queue
    4) Add 67 to the queue

    * * * * * * * * ALL THE BEST * * * * * * * *

    You might also like