Pemodelan Untuk Komputasi : Computational Thinking dan Contoh Soal ( Bahasa Inggris )
Computational Thinking ( CT )
Computational thinking is the thought processes involved in formulating a problem and expressing its solution(s) in such a way that a computer—human or machine—can effectively carry out.
CT is thinking inspired by an understanding of:
The core concepts of CT to be:
- Computers and information technologies
- The advantages
- Limitations
- Problems they bring.
- Core Concepts of CT
The core concepts of CT to be:
- logical thinking
- algorithmic thinking
- decomposition
- generalization and pattern recognition
- modelling
- abstraction
- evaluation.
Discussion
Give an example of how you think people in each of the following occupations think computationally:
- mathematician;
- scientist;
- engineer;
- linguist.
Think of everyday activities in which you participate that involve computational thinking!
Examples and Exercises
Here are the goal scorers:
- minute 1: Anna
- minute 10: Dick
- minute 35: Bernard
- minute 47: Smithy
- minute 73: Backy
- minute 89: Richard
Example: When Ben uses the magic roller to paint over the painting on the left, he gets the painting on the right.
What will the painting below look like after using the magic roller?
3.Beatrix is trying to rearrange her shelf. She has two rules:
- Rectangular items must not be next to each other.
- Circular items must not be next to rectangular items.
Which one of these shelves has followed her rules correctly?
4. Two teams of 15 players are shown below, with numbers printed on their jerseys. The players of the first team are ordered by jersey number. The players of the second team are ordered by player height.
Team 1’s jersey numbers are: 1, 4, 5, 7, 9, 14, 15, 17, 18, 19, 21, 22, 23, 25, 26
Team 2’s jersey numbers are: 8, 28, 12, 3, 24, 16, 23, 19, 14, 2, 11, 29, 27, 6, 13
How many jersey numbers are used in team 1 that are also used in team 2?
5.To arrange a dinner party Sara the beaver needs to talk to five friends: Alicia, Beat, Caroline, David and Emil. Sara can talk to Emil right away. However, to talk to her other friends, there are a few points to consider:
- Before she talks to David, she must first talk to Alicia.
- Before she talks to Beat, she must first talk to Emil.
- Before she talks to Caroline, she must first talk to Beat and David.
- Before she talks to Alicia, she must first talk to Beat and Emil.
6. Barbara has been given two stamps. With one she can produce a little flower, with the other a little sun. Being a clever girl, she thinks of a way to write her own name by using the code below:
So Barbara” becomes:
What is the code of these names of her friends?
- ABBY
- BARRY
7. Beaver Bert has a long strip of coloured paper for a party. The strip has three different colours (yellow, red, blue) in a regularly repeating pattern. Bert's friend, James, has cut out a section of the paper, as shown in the diagram below.
James says that he will give back the missing piece of paper if Bert can correctly guess the size of the piece cut out.
How many coloured squares does the missing piece of paper have? 31 32 33 or 34?
8. Combining Card A and Card B, you get Card C:
How many black cells will Card F have after combining Card D and Card E?
9. Agents Boris and Bertha communicate using secret messages. Boris wants to send Bertha the secret message: MEETBILLYBEAVERAT6
He writes each character in a 4 column grid from left to right and row by row starting from the top. He puts an X in any unused spaces.
Then he creates the secret message by reading the characters from top to bottom and column by column starting from the left: MBYVTEIBE6ELERXTLAAX
Bertha then uses the same method to reply to Boris. The secret message she sends him is: OIERKLTEILH!WBEX
What message does Bertha send back?
10. Kiki and Wiwi are playing L-Game on a 4x4 board. They take turns placing L-shaped pieces so that:
- every piece placed by Kiki is oriented as shown below,
- every piece placed by Wiwi is oriented as shown below,
- every piece is placed entirely on the board, and
- no two pieces overlap.
Pieces cannot be moved after they are placed. A player loses the game when it is their turn but it is not possible to place a piece according to the rules above.
Kiki has nine possible first moves. In how many of them is she guaranteed to win no matter how pieces are placed in following turns? 0 1 2 or 3?
Posting Komentar