Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 10 views

    DS M1 QUestion Bank

    Uploaded by

    Nidhi H Baraker
    Module 1

    Copyright:

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

    DS M1 QUestion Bank

    Uploaded by

    Nidhi H Baraker
    10 views2 pages
    Module 1

    Original Title

    DS_M1_QUestion_bank

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Module 1

    Copyright:

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

    DS M1 QUestion Bank

    Uploaded by

    Nidhi H Baraker
    Module 1

    Copyright:

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

    Jyothy Charitable Trust®

    Jyothy Institute of Technology


    Tataguni, off Kanakapura road, Bengaluru-560082
    Approved by The All India Council for Technical Education (AICTE) - New Delhi;
    Affiliated to VisvesvarayaTechnological University(VTU), Belagavi;
    Department of Computer Science & Engineering
    Accredited by National Board of Accreditation (NBA) -New Delhi.

    EXHAUSTIVE QUESTION BANK

    Batch 2022 - 2026


    Year/Semester/Section 2nd/3rd/B
    BCS304 – Data Structures andApplications
    Course Code -Title

    Module No. -Title I – Intoduction to Data Structures

    Name of the Course Asst.


    Mrs. Prathibha KN Designation
    In charge Prof.

    QNo. Question COs RBT


    1 Define Data Structures. List and explain the different operations that can CO1 L1
    be performed on arrays.
    2 Define strings. List and explain five operations that can be performed on CO1 L1
    strings with example.
    3 List and describe the functions supported in C for dynamic memory CO1 L1
    allocation.
    4 Define pointers. List the advantages of pointers over array. CO1 L1
    5 Discuss the types of structures with appropriate examples. CO1 L2
    6 Differentiate the following a) Structure and Array b) Structure and CO1 L2
    Union.
    7 Define sparse matrix. Express the following matrix in triplet form and CO1 L2
    find its transpose.
    15 0 0 22
    0 11 3 0
    0 0 0 -6
    0 0 0 0
    91 0 0 0
    0 0 28 0
    8 Illustrate the KMP pattern matching algorithm and discuss the same to CO1 L2
    search the pattern “abcdabcy” in the text “abcxabcdabxabcdabcy”.

    9 Outline KMP algorithm and employ the same to find out the occurrence CO1 L3
    of the following pattern:
    P: ABCDABD
    S: ABC ABCDAB ABCDABCDABDE
    10 What is a polynomial? Design an algorithm to add two polynomials CO1 L3
    using ADT Polynomial(c = a + b)
    11 Define stack. Explain the different operations that can be performed on CO1 L3
    stack with suitable C functions and examples.
    12 Convert the following infix expression to postfix expression using CO1 L3
    stack. (A + ( B * C – ( D / E ^ F) * G ) * H
    13 Outline the algorithm for infix to postfix and apply the same to CO1 L4
    convert following infix expression to postfix expression.
    ((H*((((A+((B+C)*D))*F)*G)*E))+J)
    14 How to declare and initialize pointers? Explain with an example. CO1 L4
    15 Illustrate the representation of 2-D arrays in memory with suitable CO1 L4
    example.
    16. Implement Stack using Dynamic memory Allocation . CO1 L3

    17. Evaluate the following postfix expression by showing the C01 L2


    contents of the stack 5 4 6 + * 4 9 3 / +

    Course In charge DAEC HOD

    You might also like