Identify which statement describes algorithmic thinking

Identifying the steps involved in solving a problem

Define the term computational thinking

Developing an algorithm to solve a problem

Define the term decomposition within computational thinking

The breaking down of a problem into smaller problems

Define the term abstraction within computational thinking

Using symbols and removing unnecessary elements

Identify the description of a linear search

Elements do not need to be in order, check each item in turn

Identify the description of a binary search

split the list in order and repeat, Put the elements in order, compare to the middle value,

studbud

Algorithm revision Yr10

10 termsStudBud Administration121 plays

Flashcards10 cardsFPractice quizPHost liveL

Questions 10

Answers

1
Identify which statement describes algorithmic thinking
Identifying the steps involved in solving a problem
Thinking like a computer
Identifying what problems need to be solved
Writing binary numbers
2
Which of the following is not a component of computational thinking?
Abstraction
Algorithmic thinking
Decomposition
Typing
3
A binary search on the list: 3,5,9,10,23 How many comparisons to find the number 9?
0-1
2-3
4-5
It cant find the number 9
4
Define the term computational thinking
Making a computer use artificial intelligence
Developing an algorithm to solve a problem
Google is computational thinking
Using a computer
5
Define the term decomposition within computational thinking
The creation of music that can be played on a computer
The breaking down of a program until it no longer exists
The breaking down of a problem into smaller problems
The breaking down of waste to make compost
6
Identify the search algorithm
Binary
Denary
Next Item
Random
7
Define the term abstraction within computational thinking
Performing multiple calculations on a list of variables
Using symbols and removing unnecessary elements
Taking a real world problem and designing a computer program
Adding together numbers
8
Identify the description of a linear search
Elements don't need to be in order, compare the middle value
Elements do not need to be in order, check each item in turn
Put the elements in order, check each item in turn
Put the elements in order, compare to the middle value
9
Identify the description of a binary search
Put the elements in order, check each item in turn
split the list in order and repeat
Put the elements in order, compare to the middle value,
Elements do not need to be in order, check each item in turn
10
A linear search on the list: 12,6,8,1,3 How many comparisons to find the number 1?
3
1
2
4

Algorithm revision Yr10 Flashcards | StudBud

Algorithm revision Yr10

10 termsStudBud Administration121 plays

Flashcards10 cardsFPractice quizPHost liveL

Questions 10

Answers

1
Identify which statement describes algorithmic thinking
Identifying the steps involved in solving a problem
Thinking like a computer
Identifying what problems need to be solved
Writing binary numbers
2
Which of the following is not a component of computational thinking?
Abstraction
Algorithmic thinking
Decomposition
Typing
3
A binary search on the list: 3,5,9,10,23 How many comparisons to find the number 9?
0-1
2-3
4-5
It cant find the number 9
4
Define the term computational thinking
Making a computer use artificial intelligence
Developing an algorithm to solve a problem
Google is computational thinking
Using a computer
5
Define the term decomposition within computational thinking
The creation of music that can be played on a computer
The breaking down of a program until it no longer exists
The breaking down of a problem into smaller problems
The breaking down of waste to make compost
6
Identify the search algorithm
Binary
Denary
Next Item
Random
7
Define the term abstraction within computational thinking
Performing multiple calculations on a list of variables
Using symbols and removing unnecessary elements
Taking a real world problem and designing a computer program
Adding together numbers
8
Identify the description of a linear search
Elements don't need to be in order, compare the middle value
Elements do not need to be in order, check each item in turn
Put the elements in order, check each item in turn
Put the elements in order, compare to the middle value
9
Identify the description of a binary search
Put the elements in order, check each item in turn
split the list in order and repeat
Put the elements in order, compare to the middle value,
Elements do not need to be in order, check each item in turn
10
A linear search on the list: 12,6,8,1,3 How many comparisons to find the number 1?
3
1
2
4