Computational Thinking
: computational thinking (CT) is a problem-solving process that includes four key processes:
: computational thinking invovles a variety of skills and dispositions: confidence in dealing with complexity; persistence in working with difficult problems; tolerance for ambiguity; the ability to deal with open-ended problems; the ability to communicate and work with others to achieve a common goal
Source: http://csta.acm.org/Curriculum/sub/CurrFiles/472.11CTTeacherResources_2ed-SP-vF.pdf
- decomposition - breaking the problem down into smaller, more easily-solvable problems
- pattern recognition - noting patterns of sequences and possibly repetitions in the problem solution
- abstraction - generalizing the problem so that its solution applies to many cases and situations
- algorithmic design - creation of a computational solution that takes input, performs a process on the input, and provides useful output
: computational thinking invovles a variety of skills and dispositions: confidence in dealing with complexity; persistence in working with difficult problems; tolerance for ambiguity; the ability to deal with open-ended problems; the ability to communicate and work with others to achieve a common goal
Source: http://csta.acm.org/Curriculum/sub/CurrFiles/472.11CTTeacherResources_2ed-SP-vF.pdf
VIDEOS - INTRODUCTORY CONCEPTS
These videos give a simple overview of the four computational thinking processes as applied in a mapping context.
These videos give a simple overview of the four computational thinking processes as applied in a mapping context.
|
|
VIDEOS - SORTING
A common computational task is sorting. Sorting is a way of organizing data logically. For example, arranging numbers in increasing order, or putting words into alphabetical order as in a dictionary. There are many different methods of sorting data. The time and quantity of processing is takes to complete each sort is called its "order of complexity." The order of complexity of a sort depends on the type of sort, how many data items you have, and (sometimes) how jumbled or unorganized the data is before sorting. These two videos give a general overview of sorting algorithms.
|
|
VIDEOS - SEARCHING
Another common computational task is searching. Searching is a way of finding data logically. For example, finding the location of a number in a list of numbers, or finding the most relevant webpages on a subject of interest, such as "lions." There are different methods of searching data Two common methods of searching data are linear search and binary search (the video below left addresses these). The time and processing power it takes to search through data depends on factors such as the size of list and whether the data is sorted. The video below right addresses one of the most complicated search processes done daily: using Google to search the web for information.
|
|
INSTRUCTIONAL GUIDES - INTRODUCTORY PROJECTS IN SCRATCH
Naughty Monkey in Scratch
(game with mouse click)
|
Cat and Dog Chase in Scratch
(capture game with key control)
|
UFO Flyover in Scratch
(side scrolling animation)
|
Cast Your Ballot in Scratch
(voting machine simulation)
|
Drawing Toy in Scratch
(color art toy)
|
Name Announce in Scratch
(simple text handling toy)
|
|
Paddle Bounce in Scratch
(simple ping pong paddle game)
|
Mystic Sheep in Scratch
(binary search number guess game)
|
Computation of Binary Search Complexity
|
Bucket Sort in Scratch
(two bucket sort algorithm)
|
Smellephant Scratch
(collection game, includes new block)
|
Bubble Sort in Scratch
|
Steps to Abstracting Bubble Sort
|
Swim Shark Reef in Scratch
|
|
INTRODUCTION TO UI/AUI AND MAKEY MAKEY
User Interfaces and Alternative User Interfaces
|