Scribd Logo
Upload

Welcome to Scribd!

  • Modul Praktikum Minggu 9 Topic Duration Submitted Standard: TASK I. Tower of Hanoi

    Uploaded by

    judianto situmorang
    9 views2 pages
    The document describes three computational thinking tasks involving solving problems with limited resources: 1) Moving disks between towers in the Tower of Hanoi puzzle, requiring determining the minimum number of steps. 2) Filling a jug to 4 liters using only 3, 5, and 8 liter jugs, necessitating developing an algorithm to accomplish this with the fewest steps. 3) Mapping and finding the shortest path out of a room on a graph, which demands explaining how to verify the path found is indeed the shortest. Students are asked to provide their solutions and reasoning for each task.

    Original Description:

    Original Title

    P9

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes three computational thinking tasks involving solving problems with limited resources: 1) Moving disks between towers in the Tower of Hanoi puzzle, requiring determining the minimum number of steps. 2) Filling a jug to 4 liters using only 3, 5, and 8 liter jugs, necessitating developing an algorithm to accomplish this with the fewest steps. 3) Mapping and finding the shortest path out of a room on a graph, which demands explaining how to verify the path found is indeed the shortest. Students are asked to provide their solutions and reasoning for each task.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views2 pages

    Modul Praktikum Minggu 9 Topic Duration Submitted Standard: TASK I. Tower of Hanoi

    Uploaded by

    judianto situmorang
    The document describes three computational thinking tasks involving solving problems with limited resources: 1) Moving disks between towers in the Tower of Hanoi puzzle, requiring determining the minimum number of steps. 2) Filling a jug to 4 liters using only 3, 5, and 8 liter jugs, necessitating developing an algorithm to accomplish this with the fewest steps. 3) Mapping and finding the shortest path out of a room on a graph, which demands explaining how to verify the path found is indeed the shortest. Students are asked to provide their solutions and reasoning for each task.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Modul

    Praktikum
    Minggu 9

    Topic Solution of daily problem with Computational Thinking

    Duration 1 Minggu
    Submitted standard 1 file P9YYXXX.pdf (pdf file) Silahkan menggunakan latex atau
    word processor kemudian digenerate ke file .pdf)

    TASK I. Tower of hanoi

    1.1. Target: Move all stack on the 3rd tower


    1.2. You can move only 1 block at a time
    1.3. Never put larger on to smaller block
    1.4. Write down how many steps you need to get the result? write down your steps

    1.5. What algorithm you use to accomplish the task? Explain why?
    TASK II. Find the 4 liter water using 3, 5, and 8 liter of water Jug

    2.1. Target: Get 4 Liter of water


    2.2. You can fill out other empty jug to help you
    2.4. Write down how many steps you need to get the result? write down your
    steps
    2.5 What algorithm you use to accomplish the task? Explain why?
    TASK III. Draw the games on the graph form (Optional Task)
    3.4. Find the shortest path as a solution to exit the room.
    3.5 How you can judge that your answer is the shortest path explain?

    You might also like