the quantities, characters, or symbols on which operations are performed by a computer,
2 of 17
How do humans represent an algorithm?
As a set of instructions, as a flowchart, as computer code
3 of 17
What are the four main parts of Computational Thinking?
Algorithmic thinking, Abstraction, Pattern Recognition and Decomposition
4 of 17
Give an example of Pattern Recognition
Realising that a group of objects all begin with the letter B, e.g. Ball, Bat, Banana, Bobble hat.
5 of 17
What is abstraction?
It is filtering out – essentially, ignoring - the characteristics that we don't need in order to concentrate on those that we do.
6 of 17
What is decomposition?
It involves breaking down a complex problem or system into smaller parts that are more manageable and easier to understand.
7 of 17
Which is quicker if yo uare trying to sort 100 numbers into ascending order, Bogo Sort or Bucket Sort? Give a reasons why.
Bucket Sort, because Bogo Sort is random and so could take a very long time.
8 of 17
What is a pass in a Sort?
It is when you work through the data from beginning to end once, this may need to be done several times to completely sort the data, especially if there is a lot of it.
9 of 17
After one pass what would these numbers look like if you were doing a bubble sort? 4 3 2 7 10 8
3 2 4 7 8 10
10 of 17
Give an example of a linear sort
Knocking on every door of a street to find your friend starting at Number 1 until you find your friend.
11 of 17
1-10, 11-20, 21-30, 31-40 What kind of sort would use these groupings?
A Bucket Sort
12 of 17
Describe how a bubble sort works.
Pairs of data are compared and sorted into order,often with the lowest value appearing at the top of a list like a bubble rising to the surface of a drink.
13 of 17
What is a Searching Algorithm?
It is used to find a specific piece of data from a list. e.g. all of the Davids in Year Group.
14 of 17
How many checks (questions) would it take to find the number 20 in this list? 5 10 15 20 25
4.
15 of 17
What can be a disadvantage of a linear search? Give an example.
It can take a long time, e.g. trying to find house number 90 in a street with 100 houses if you start at number 1.
16 of 17
Does it matter if the order of an algorithm is changed? Give an example to explain
Yes, e.g. If you had 1. Got to a house 2. Is anyone home 3. If no, go to next house 4. Knock on the door, would not work.
17 of 17
Other cards in this set
Card 2
Front
What is data?
Back
the quantities, characters, or symbols on which operations are performed by a computer,
Card 3
Front
How do humans represent an algorithm?
Back
Card 4
Front
What are the four main parts of Computational Thinking?
Comments
No comments have yet been made