1 |
Which of the following is not a cornerstone of Computatonal Thingking? |
Decomposition
Pattern reongnition
Generalization and Abstraction
Probability calculation
|
2 |
What is Computational Thinking. |
Problem -solving skills and techniques
Solving problems using computers
Breaking down problems into smaller parts
Recognizing patterms in images
|
3 |
The loops which are never going to end are called. |
Finite loops
Infinite loops
Intermediate loops
Simple loops
|
4 |
The loops which have to be terminated are called. |
Infinite loops
Finite loops
Simple loops
INermediate loops
|
5 |
The loops which hae to be terminated are called. |
Infinite loops
Simple loops
Intermediate loops
Finite loops
|
6 |
The sequence where we repeat a specific set of instructions, again and again, is called. |
Condition
Sequence
Loop
All
|
7 |
The algorithm which goes through al possible solutions untill the required soultionin found is. |
Recursive Algorithm
Searchign algorithm
Brute force algorithm
Sortig algorithm
|
8 |
Set of instructions to solve a problem is called. |
Directions
Algorithm
Instructions
Design
|
9 |
Discover the principles that caue the patterns of a problem is called. |
Generalization
Design
pattern Recognition
Deconstruction
|
10 |
Breaking down a problem into sub-problems is called. |
Generalization
Doconstruction
Design
Pattern Recognition
|