Scribd Logo
Upload

Welcome to Scribd!

  • 147 views

    DataStructureMay2022 NEP

    Uploaded by

    Sushmitha M N
    The document contains questions related to data structures and algorithms. It covers topics like algorithm complexity analysis, abstract data types, stacks, binary search trees, graphs, collision resolution in hashing, sparse matrices, queues, recursion, sorting algorithms like insertion sort, trees, linked lists, hash tables, and binary search trees. Students need to answer questions on these topics that involve explaining concepts, providing examples, writing algorithms and code snippets.

    Copyright:

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

    DataStructureMay2022 NEP

    Uploaded by

    Sushmitha M N
    147 views2 pages
    The document contains questions related to data structures and algorithms. It covers topics like algorithm complexity analysis, abstract data types, stacks, binary search trees, graphs, collision resolution in hashing, sparse matrices, queues, recursion, sorting algorithms like insertion sort, trees, linked lists, hash tables, and binary search trees. Students need to answer questions on these topics that involve explaining concepts, providing examples, writing algorithms and code snippets.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains questions related to data structures and algorithms. It covers topics like algorithm complexity analysis, abstract data types, stacks, binary search trees, graphs, collision resolution in hashing, sparse matrices, queues, recursion, sorting algorithms like insertion sort, trees, linked lists, hash tables, and binary search trees. Students need to answer questions on these topics that involve explaining concepts, providing examples, writing algorithms and code snippets.

    Copyright:

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

    DataStructureMay2022 NEP

    Uploaded by

    Sushmitha M N
    The document contains questions related to data structures and algorithms. It covers topics like algorithm complexity analysis, abstract data types, stacks, binary search trees, graphs, collision resolution in hashing, sparse matrices, queues, recursion, sorting algorithms like insertion sort, trees, linked lists, hash tables, and binary search trees. Students need to answer questions on these topics that involve explaining concepts, providing examples, writing algorithms and code snippets.

    Copyright:

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

    rllililil lril lil ililtililtilil tilt

    L6
    I Semester B.C.A. Degree Examination, May 2022
    (NEP - 2021-22 and Onwards)
    COMPUTER SCIENCE
    Paper - 1.3 : Data Structures
    Time :2Tz Hours Max. Marks : 60
    lnstruction : Answer all Sections.
    PART -A
    l. Answer any 4 of the following : (4x2=8)
    1) How to measure the complexity of an algorithm ?
    2) What is an Abstract Data type ? Give an example.
    3) Explain overflow and underftow conditions in stack. '
    4) What is a Binary Search Tree ? Give an example.
    , 5) Mention any two types of Graphs.
    6) What do you mean by Chaining in Collision Resolution ?

    . PART_B

    ll. Answer any 4 of the following : (4x5=20)


    7) Define sparse matrix. Write a C program to check whether given matrix is
    SPARSE or NOT.
    B) write an algorithm for ENQUEUE and DEQUEUE operations.
    9) What is Recursion ? Write a program to print Fibonacci series using
    Recursive funotion.
    10) write Pre-order, ln-order, Post-order, Traversar for the given Tree.

    P.T.O.
    NP - 164 ilililril ililtil ltfl ililIilil lil

    11) Write an Algorithm for lnsertion sort. Give the analysis for lnsertion sort.
    12) Write a note on.
    a) Adjacency Matrix
    b) Adjacency list.
    PART _ C

    lll. Answer any 4 of the following : (4x8=32).

    13) a) Explain different Asymptotic Notations. 5

    b) Write an algorithm to insert an element into an array. 3

    1 ) a) Mention and explain the types of linked lists in brief. 4


    b) Explain Towers of Hanoi problem with an algorithm" 4

    15) a) Convert the following infix notation expression to postfix notation. 5


    (a+blc.d) -f+e
    b) Explain underflow and overflow with respect to Queues. 3

    16) Explain heap sort method for the given set of elements. 8

    18 32 14 I 45 06 55 16

    17) a) Define Hashing. Explain Hash Table and Hash function with
    an example. 6
    b) List any two Probing Methods. 2

    'lB) Construct birlgry tree. Given inorder and Post order traversals. I
    lnorder :6 + 2. 319 "/" 2
    Post order : 62 + 392 o/" I *

    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