Scribd Logo
Upload

Welcome to Scribd!

  • 66 views

    Level: K1 Knowledge K2 Understand K3 Apply K4 Analyse K5 Evaluate K6 Create

    Uploaded by

    Soma Sundaram
    This document contains details of an exam for a Data Structures course including course outcomes, exam structure, and exam questions. The exam has 3 parts - Part A contains 10 multiple choice questions worth 2 marks each mapping to various course outcomes and knowledge levels. Part B contains 5 questions worth 13 marks each, testing higher order thinking skills. Part C has 1 question worth 15 marks to construct different tree structures like B+ tree and AVL tree. The exam evaluates students on their knowledge, understanding, application, analysis, evaluation and creation of concepts taught in the course related to tree and graph structures.

    Copyright:

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

    Level: K1 Knowledge K2 Understand K3 Apply K4 Analyse K5 Evaluate K6 Create

    Uploaded by

    Soma Sundaram
    66 views2 pages
    This document contains details of an exam for a Data Structures course including course outcomes, exam structure, and exam questions. The exam has 3 parts - Part A contains 10 multiple choice questions worth 2 marks each mapping to various course outcomes and knowledge levels. Part B contains 5 questions worth 13 marks each, testing higher order thinking skills. Part C has 1 question worth 15 marks to construct different tree structures like B+ tree and AVL tree. The exam evaluates students on their knowledge, understanding, application, analysis, evaluation and creation of concepts taught in the course related to tree and graph structures.

    Original Title

    DS-TERMINAL-QP-2

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains details of an exam for a Data Structures course including course outcomes, exam structure, and exam questions. The exam has 3 parts - Part A contains 10 multiple choice questions worth 2 marks each mapping to various course outcomes and knowledge levels. Part B contains 5 questions worth 13 marks each, testing higher order thinking skills. Part C has 1 question worth 15 marks to construct different tree structures like B+ tree and AVL tree. The exam evaluates students on their knowledge, understanding, application, analysis, evaluation and creation of concepts taught in the course related to tree and graph structures.

    Copyright:

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

    Level: K1 Knowledge K2 Understand K3 Apply K4 Analyse K5 Evaluate K6 Create

    Uploaded by

    Soma Sundaram
    This document contains details of an exam for a Data Structures course including course outcomes, exam structure, and exam questions. The exam has 3 parts - Part A contains 10 multiple choice questions worth 2 marks each mapping to various course outcomes and knowledge levels. Part B contains 5 questions worth 13 marks each, testing higher order thinking skills. Part C has 1 question worth 15 marks to construct different tree structures like B+ tree and AVL tree. The exam evaluates students on their knowledge, understanding, application, analysis, evaluation and creation of concepts taught in the course related to tree and graph structures.

    Copyright:

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

    K.

    RAMAKRISHNAN COLLEGE OF TECHNOLOGY


    SAMAYAPURAM, TRICHY – 621 112.
    DEPARTMENT OF CSE
    YEAR/SEM II/III SECTION EXAM TERMINAL TEST
    SUBJECT CODE & NAME:CS8391- DATA STRUCTURES
    Course Outcomes:
    CO3 : To apply tree structures
    CO4 : To apply graph structures

    Level K1 K2 K3 K4 K5 K6
    KNOWLEDGE UNDERSTAND APPLY ANALYSE EVALUATE CREATE Total
    Mark 6 10 2 60 13 9 100
    Allotment

    PART-A (10*2=20) Marks Mapping


    1. Define Binary Tree. 2 CO-3/K-1
    2. What is complete binary tree? 2 CO-3/K-2
    3. Distinguish BT and BST. 2 CO-3/K-4
    4. Define Tree with an example. 2 CO-3/K-2
    5. Justify B tree is less efficient when compared with B+ tree. 2 CO-3/K-3
    6. What are the applications of tree? 2 CO-3/K-4
    7. Differentiate directed graph and undirected graph. 2 CO-4/K-4
    8. Define in degree and out degree. 2 CO-4/K-2
    9. List conditions of Euler circuit 2 CO-4/K-1
    10. Draw the Graph for 4 vertices and 6 Edges with un directed 2 CO-4/K-1
    graph and also find the adjacency of each node.

    PART-B(5*13=65)
    11. a) Explain the tree traversal Techniques with suitable 13 CO-3/K-6
    example.
    (OR)
    b)i) Write about binary heap and construct the binary Min 5 CO-3/K-1
    heap 6,3,2,1,10,9,5,8,11,12,13,4,7 .
    ii) Write a procedure to delete the element from Min 8 CO-3/K-1
    heap.
    12. a) Show the result of inserting 2,5,4,6,7,9,8,3,1,10,18 13 CO-3/K-1
    into binary search tree and also Write the routine for
    insertion of binary search tree.

    (OR)
    b) Explain about expression tree. 13 CO-3/K-4
    13. a) Construct B Tree of order 5 by inserting the following 13 CO-3/K-4
    elements :
    3,14,7,1,8,5,11,17,13,6,23,12,20,26,4,16,18,24,25,29
    (OR)
    b) Construct an AVL tree by inserting the following 13 CO-3/K-5
    elements in the given order 2,5,4,6,7,9,8,3,1,10. And
    also Write the routine for insertion of an AVL tree
    14. a) i) Define Graph. Explain any 5 basic terminologies 13 CO-4/K-4
    used in Graph.
    ii) Explain in detail about Representation of with
    suitable example.
    (OR)
    b) State and explain topological sort with suitable 13 CO-4/K-4
    example.
    15. a) Explain in detail about BFS with suitable example. 13 CO-4/K-4

    (OR)
    b) Explain in detail about DFS with suitable example. 13 CO-4/K-2
    PART-C(1*15=15)
    16 a) Construct B+ Tree to insert the following elements 15 CO-3/K-4
    with order 3. Elements: 5,2,13,3,45,72,4,6,9,22
    (OR)
    b) Construct AVL Tree for following elements 15 CO-3/K-4
    15,18,20,21,28,23,30,26

    Assessment link : https://forms.gle/gP3esd883Zf9cJkR8

    STAFF INCHARGE NBA CO-ORDINATOR HOD

    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