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

Welcome to Scribd!

  • 63 views

    Struktur Data 12 Juli

    Uploaded by

    Ajeng Suci Ananda
    This document contains instructions for a final exam on data structures. It includes 5 questions testing students' understanding of concepts like 2-3 trees, AVL trees, heaps, minimum spanning trees, and binary search trees. Students are asked to provide detailed explanations and code for tasks like inserting, searching, and deleting nodes from different data structures. They are also asked to create a video demonstration of a binary search tree-based student attendance application. The exam aims to evaluate students' comprehension of data structures and their applications in different problem domains.

    Copyright:

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

    Struktur Data 12 Juli

    Uploaded by

    Ajeng Suci Ananda
    63 views3 pages
    This document contains instructions for a final exam on data structures. It includes 5 questions testing students' understanding of concepts like 2-3 trees, AVL trees, heaps, minimum spanning trees, and binary search trees. Students are asked to provide detailed explanations and code for tasks like inserting, searching, and deleting nodes from different data structures. They are also asked to create a video demonstration of a binary search tree-based student attendance application. The exam aims to evaluate students' comprehension of data structures and their applications in different problem domains.

    Original Description:

    Soal Struktur Data Binus

    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 instructions for a final exam on data structures. It includes 5 questions testing students' understanding of concepts like 2-3 trees, AVL trees, heaps, minimum spanning trees, and binary search trees. Students are asked to provide detailed explanations and code for tasks like inserting, searching, and deleting nodes from different data structures. They are also asked to create a video demonstration of a binary search tree-based student attendance application. The exam aims to evaluate students' comprehension of data structures and their applications in different problem domains.

    Copyright:

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

    Struktur Data 12 Juli

    Uploaded by

    Ajeng Suci Ananda
    This document contains instructions for a final exam on data structures. It includes 5 questions testing students' understanding of concepts like 2-3 trees, AVL trees, heaps, minimum spanning trees, and binary search trees. Students are asked to provide detailed explanations and code for tasks like inserting, searching, and deleting nodes from different data structures. They are also asked to create a video demonstration of a binary search tree-based student attendance application. The exam aims to evaluate students' comprehension of data structures and their applications in different problem domains.

    Copyright:

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

    FM-BINUS-AA-FPU-78/V2R0

    BINUS University

    Academic Career: Class Program:


    Undergraduate / Master / Doctoral *) International/Regular/Smart Program/Global Class*)

     Mid Exam  Final Exam Term : Odd/Even/Short *)


     Short Term Exam  Others Exam : _____________

     Kemanggisan  Alam Sutera  Bekasi Academic Year :


     Senayan  Bandung  Malang 2021 / 2022

    Faculty / Dept. : School of Computer Science / Computer Deadline Day / Date : Tuesday / July 12th, 2022
    Science Time : 13:00

    Code - Course : COMP6458031 – Data Structures Class : LA75,LB75,LC75,LD75


    Lecturer : Teams Exam Type : Online

    ) Strikethrough the unnecessary items
    The penalty for CHEATING is DROP OUT!!!

    LO1 Explain the concept of data structure and its usage in application
    LO2 Apply data structure in application
    LO3 Illustrate the usage of data structure in application
    Instructions
    1. Write your answer on .pdf format. Name the file based on the following format:
    UTS_NIM_NAMA.pdf (example: UTS_21031212121_AdiMulyadi.pdf).
    2. Maximum file size 20MB.

    Essay– Answer the following question clearly!


    1. (LO1 – 15 point)
    a. Explain about the form of 2-3 Tree!
    b. Insert: 65, 44, 23, 19, 87, 90, 15, 18, 22, 77 into an empty 2-3 Tree, then search the 90
    from the 2-3 Tree, last, Delete the 44, 18 and 22 from the 2-3 Tree! Provide the detail
    of each process!

    2. (LO3 – 20 point)
    Set A

    Verified by,

    [Boby Siswanto] (D5918) and sent to Department/Program on June 9th, 2022


    Page 1 of 3
    FM-BINUS-AA-FPU-78/V2R0
    In the tree above, do the insert process on the key below using the rules from the AVL tree:
    (Show the result for each key process)
    a. 4, 3, 2, 13, 15, 14, 16, 23, 22, 25, 9, 10, 32, 37, 42, 7
    Furthermore, from the Tree that is formed from the results of the insert key process, it is
    continued to delete several keys, namely:
    b. 8, 12, 2, 18, 15, 22, 9, 17, 11, 25

    Set B

    In the RBT Tree perform the insert process with the key:
    a. 3, 6, 4, 16, 19, 18, 22, 10, 17, 9, 13, 12, 28, 25, 31, 27.
    Furthermore, from the RBT Tree which is formed from the results of the insert key process,
    it is continued to delete several keys, namely:
    b. 2, 11, 7, 14, 15, 8, 10, 12, 5, 16

    Note: Based on your student ID:


    If your two last digit is added and the result is odd, please work on set A
    If your two last digit is added and the result is even, please work on set B

    3. (LO1 – 15 point)
    Based on your student ID:
    If your last digit is odd, please work on Max-heap
    If your last digit is even, please work on Min-heap

    Please insert the following data into your Heap:


    16, 20, 5, 8, 25, 10, 1, 40, 60, 12, 50, 45
    And do 3 times delete. Provide the detail of each process!

    4. (LO3 – 20 point)
    Check your last digit of student’s ID, below is your task:
    Last digit Minimum Spanning Tree Algorithm Shortest Path
    1,8,7 Prims with B as starting point A to J
    2,9,0 Prims with D as starting point A to H
    3,6 Prims with C as starting point D to H
    4,5 Kruskal B to J

    Transform the following graph into MST form based on the requested algorithm, find the
    MST weight and find the shortest part!
    Verified by,

    [Boby Siswanto] (D5918) and sent to Department/Program on June 9th, 2022


    Page 2 of 3
    FM-BINUS-AA-FPU-78/V2R0

    5. (LO2 – 30 point)
    Make a student attendance application for Data Structure class. This application should
    utilize Binary Search Tree (BST) to store the student data. The stored data consist of Student
    ID (NIM), the name of the student and the time of attendance with the 'key' is the student
    ID. Create a menu consisting of:
    a. Input student attendance. In this menu, the Student ID and Name are inputted with
    the time of attendance being inputted automatically based on the time of data input.
    b. Show student attendance. In this menu, all the present students are shown.
    c. Search student. In this menu, we will look for a student presence based on their
    Student ID. If found, show the name and the time of attendance. If not, then give a
    message that the student was not present.

    Make a video containing an explanation of the source code and a demo of the application
    with maximum of 3 minutes. (If you exceed the time, points will be deducted), provide a
    video link and source code link on the answer sheet.

    -------ooo000ooo------

    Verified by,

    [Boby Siswanto] (D5918) and sent to Department/Program on June 9th, 2022


    Page 3 of 3

    You might also like