Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    Cpds CIA2 Question

    Uploaded by

    jesiya s

    Copyright:

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

    Cpds CIA2 Question

    Uploaded by

    jesiya s
    3 views1 page

    Original Title

    cpds CIA2 question

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

    Cpds CIA2 Question

    Uploaded by

    jesiya s

    Copyright:

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

    DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

    CONTINUES INTERNAL ASSESSMENT-II


    Course Code : CS3353 Date & Session : 19.11.2024
    Course Name : C Programming and Data Structures Duration : 3hrs
    Year/Sem./Branch : II/III/ECE/EEE Max. Marks : 50
    KNOWLEDGE LEVEL
    Level Remembering Understanding Applying Analyzing (K4) Evaluating Creating (K6)
    (K1) (K2) (K3) (K5)
    Q.Nos. 1,3 2,4,5 8 - - -
    Marks (X) 4 70 16 - - -
    COURSE OUTCOMES
    CO3 : Develop the functions to implement linear and non–linear data structure operations (K3) 18
    36
    CO4 :
    Make use of appropriate linear/non–linear data structure operations for solving a given problem.
    (K3)
    CO5 : Utilize sort and search algorithms for a given application (K3) 36
    WEIGHTAGE 90
    Part-A ( 05 x2 =10 Marks)
    1. Relate Stack with Queue. CO3 K1 (2)
    2. Compare Double hashing and Rehashing. CO4 K2 (2)
    3. Define Tree -Traversal and mention the types of traversal?Give an example. CO4 K1 (2)
    4. Explain Searching and mention its types. CO5 K2 (2)
    5. Infer Heap and list its advantages CO5 K2 (2)
    Part-B ( 02x16=32 Marks)
    6.A) (i)Identify the Tree Traversal techniques with best case analysis. CO4 K3 (8)
    (ii)Develop an expression tree for the expression (a+b*c)+((d*e+f)*g).Give the outputs (8)
    when you apply inorder, pre-order, postorder traversals.
    [OR]
    6. B) (i)Utilize the Open Addressing techniques and explain with an example. CO4 K3 (10)
    (ii)Build a binary search tree for the following numbers start from an empty Binary Search (6)
    Tree. 45, 26, 10, 60, 70, 30, 40. Delete keys 10, 60 & 45 one after the other and show the
    trees at each stage.
    7. A) (i)Apply the Quick sort Algorithm to sort the following numbers CO5 K3 (8)
    90, 77, 60, 99, 55, 88, 66.
    (ii)Make use of Insertion sort Algorithm and sort the sequence (8)
    13, 11, 74, 37, 85, 39, 22, 56, 25.

    [OR]
    Part-C ( 01x08=8 Marks)
    8.A) Develop the circular queue with max_size=5. CO3 K3 (8)
    [OR]
    8.B) Make use of Stack and its applications to construct an expression from postfix to infix CO3 K3 (8)
    abc-+de-fg-h+/*

    Prepared By Scrutinized by Verified by Approved By


    [ S.JesiyaShahul ] [ Dr.P.Murugan] [HOD/CSE] [PRINCIPAL]

    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