Scribd Logo
Upload

Welcome to Scribd!

  • 35 views

    T0026 Data Structures: Soal Praktikum

    Uploaded by

    Andre Laurent
    The document describes a case study for creating a program to manage player characters in a MMORPG using a binary search tree. The program would have four menus: 1) View all characters, 2) Add a new character, 3) Display character damage in inorder, preorder and postorder traversals, and 4) Exit. Adding a character would involve validating input and calculating damage based on the character's job and level, then inserting the character into the BST based on damage. Traversals would display damage or notify the user if the tree is empty. The exit option would clear the linked list and end the program. Screenshots of the main menu and sample menu options 1-3 are provided.

    Copyright:

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

    T0026 Data Structures: Soal Praktikum

    Uploaded by

    Andre Laurent
    35 views3 pages
    The document describes a case study for creating a program to manage player characters in a MMORPG using a binary search tree. The program would have four menus: 1) View all characters, 2) Add a new character, 3) Display character damage in inorder, preorder and postorder traversals, and 4) Exit. Adding a character would involve validating input and calculating damage based on the character's job and level, then inserting the character into the BST based on damage. Traversals would display damage or notify the user if the tree is empty. The exit option would clear the linked list and end the program. Screenshots of the main menu and sample menu options 1-3 are provided.

    Original Title

    C1-T0026-RZ01-07

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes a case study for creating a program to manage player characters in a MMORPG using a binary search tree. The program would have four menus: 1) View all characters, 2) Add a new character, 3) Display character damage in inorder, preorder and postorder traversals, and 4) Exit. Adding a character would involve validating input and calculating damage based on the character's job and level, then inserting the character into the BST based on damage. Traversals would display damage or notify the user if the tree is empty. The exit option would clear the linked list and end the program. Screenshots of the main menu and sample menu options 1-3 are provided.

    Copyright:

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

    T0026 Data Structures: Soal Praktikum

    Uploaded by

    Andre Laurent
    The document describes a case study for creating a program to manage player characters in a MMORPG using a binary search tree. The program would have four menus: 1) View all characters, 2) Add a new character, 3) Display character damage in inorder, preorder and postorder traversals, and 4) Exit. Adding a character would involve validating input and calculating damage based on the character's job and level, then inserting the character into the BST based on damage. Traversals would display damage or notify the user if the tree is empty. The exit option would clear the linked list and end the program. Screenshots of the main menu and sample menu options 1-3 are provided.

    Copyright:

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

    140717 FM-BINUS-AA-FPT-66/R6

    Soal Praktikum
    Practicum Case

    T0026
    Data Structures
    Teknik Informatika C1-T0026-RZ01
    Computer Science

    Periode Berlaku Semester Pendek 2016/2017 Revisi 00


    Valid on Compact Semester Year 2016/2017 Revision 00

    Learning Outcomes
     Demonstrate how to create any learned data structure
     Analyze the usage of data structure in application
    Topic
     Session 07 - Binary Search Tree
    Sub Topics
     Insert Binary Search Tree
     Searching Binary Search Tree
     Transversal Tree (Inorder, Preorder, Postorder)
     Delete Binary Search Tree (1 node)

    Soal
    Case

    Blue-Luna Online is a MMORPG that is so popular recently. There are many players playing that
    game. Mr. Ace as one of the Game Master of Blue-Luna Online wants to make an event of Player Wars.
    He needs a program that contains all the players in that game so he asks you as a skillful programmer to
    make the program using the binary search tree concept. Here are the descriptions of the program:
     Program consists of 4 menus:
    1. View All Characters
    2. Add New Character
    3. Inorder, Preorder, Postorder Character’s Damage
    4. Exit and Popall
     If user chooses View All Characters, then :
    - If there is no data in the tree, show the message “--- There is No Character in The Tree ---”
    - If data is already in the tree, show the player list (name, job, level, damage).
     If user chooses Add New Character, then:
    - Ask user to input character’s name. Validate that the length of player’s name must be
    between 3 and 20 characters and must not contain any space character.
    - Ask user to input character’s job. Validate that the job must be between “fighter”,
    “rogue”, and “mage”.

    Halaman : 1 dari 3
    Page 1 of 3
    140717 FM-BINUS-AA-FPT-66/R6

    - Ask user to input character’s level. Validate that the level must be between 1 and 105.
    - Then calculate the character’s damage with the following rules:
     If the character’s job is “fighter”, then:
    [Character’s damage] = [character’s level] + [random number (0~49)]
     If the character’s job is “rogue”, then :
    [Character’s damage] = [character’s level] + [random number (0~24)]
     If the character’s job is “mage”, then :
    [Character’s damage] = [character’s level] + [random number (0~74)]
    - If tree is still empty, then data will be inserted automatically.
    - The data is inserted into the tree using BST Concept based on the character’s damage.
    - If data has been successfully inputted, then show the message “--- Add New Character
    Success ---”
     If user chooses Inorder, Preorder, Postorder, then:
    - If there is no data in the tree, show the message “--- There is No Character in The Tree ---”
    - If data is already in the tree, show the character’s damage in in-order, pre-order, and post-order.
     If user chooses Exit, then:
    - Delete all data in the linked list.
    - Program ends.

    Please run the EXE file to see the sample program.

    Print Screen of Main Menu

    Print Screen of View All Characters (Menu ‘1’)

    Print Screen of Add New Character (Menu ‘2’)

    Print Screen of Inorder, Preorder, Postorder Menu (Menu ‘3’)

    Halaman : 2 dari 3
    Page 2 of 3
    140717 FM-BINUS-AA-FPT-66/R6

    Halaman : 3 dari 3
    Page 3 of 3

    You might also like