COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Removing all of the unimportant bits of a problem.
|
|
|
Breaking the problem down into manageable chunks.
|
|
|
A logical way of getting from the problem to the solution.
|
|
|
None of the above
|
Detailed explanation-1: -The power of computational thinking starts with decomposition, which is the process of breaking down complex problems into smaller, more manageable parts. With decomposition, problems that seem overwhelming at first become much more manageable.
Detailed explanation-2: -Decomposition is one of the four cornerstones of Computer Science. It involves breaking down a complex problem or system into smaller parts that are more manageable and easier to understand. The smaller parts can then be examined and solved, or designed individually, as they are simpler to work with.
Detailed explanation-3: -Examples of Decomposition in Computational Thinking To build shelves for a storage space, you practice decomposition by measuring the space, creating a blueprint or plan to determine the size of the shelves and the materials you need to accomplish the task.
Detailed explanation-4: -Dynamic programming is a really useful general technique for solving problems that involves breaking down problems into smaller overlapping sub-problems, storing the results computed from the sub-problems and reusing those results on larger chunks of the problem.