stud
bud
Sign up
Log in
Home
Library
Explore
SAT
More
Computational Thinking Lesson 1 Flashcards | StudBud
Explore
/
Computational Thinking Lesson 1
Computational Thinking Lesson 1
10 terms
·
StudBud Administration
·
176 plays
Imported from external platform
Flashcards
10 cards
F
Practice quiz
P
Host live
L
Questions
10
Answers
1
Which computational thinking technique involves breaking a problem down into smaller parts?
Abstraction
Pattern Reccognition
a.Decomposition
Algorithm
2
Which of the following is NOT an example of computational thinking?
Writing the possible ways to spend your money
Discussing with your friends how much money you have before choosing
a.Letting the bossiest friend decide where you should all go
a.Considering the different options carefully before deciding best one
3
To create a successful computer program, how many computational thinking techniques are usually required?
2
5
4
1
4
What is computational thinking?
a.Giving instructions to a computer
a.Using a set of techniques and approaches to help to solve problems
a.Thinking like a computer - in binary
5
Which of the following is NOT a computational thinking technique?
a.Decomposition
a.Pattern recognition
a.Coding
Abstraction
6
What is a complex problem?
a.A problem that, at first, is not easy to understand
a.A problem that, at first, is not easy to solve
a.A problem that, at first, is not easy to solve or to understand
7
Which computational thinking technique involves filtering only the important information?
Abstraction
Patterm Recognition
Algorithm
Decomposition
8
Why do we need to think computationally?
a.To help us to think like a computer
a.To help us solve complex problems more easily
a.To help us to program
9
Which of the following is NOT an example of computational thinking?
a.Planning what to collect and where to exit to complete a video game level
a.Planning how to beat your enemies in a video game level
a.Accidentally completing a video game level
10
When is a computer most likely to be used when using computational thinking?
a.When writing algorithms
a. When programming a computer
a.During decomposition