ICT term 1 Question Bank Computational Thinking Flashcards
What is a loop?
Repeating a step or task in an algorithm or computer program is known as loop or iteration. We use loops to show where repetition happens in a computer program so that we do not need to write out the same instructions many times.
What is selection in Computational thinking?
Selection happens when you reach step in the algorithm where there are two or more possibilities.
What is decomposition in computational thinking?
Decomposition is to break down a problem into smaller parts. As the parts are smaller , they are easier to manage .You can solve small parts of the problem and then bring these parts together to solve the whole problem.
Describe what pseudocode is?
Pseudocode is a way to describe algorithms. Using Pseudocode can help you show your planning for a program and how you would solve a problem. Pseudocode can also help you see that there might be morehan one way to solve a problem .Pseudocode uses words instead of drawings to show your computational thinking.
Pseudocode is meant for us to read ,not for computer to follow.
Explain abstraction in algorithm?
An abstraction is taking away unnecessary details to help solve a problem. Simplifying a problem to see all possible solutions.
Define exhaustive search algorithm?
An exhaustive search algorithm tries every possible solution to find an answer to a problem.
Explain Bubble sort algorithm?
Bubble sort algorithm compares pairs of items on a list and swaps them into the correct order. The bubble sort algorithm will go though a list again and again until it makes no further changes to the list.
What are the advantage and disadvantage of a serial search?
Advantage of serial search algorithm items sorted in any order.
Disadvantage of serial search algorithm take a long time to search
define greedy algorithm?
Define Greedy algorithm?
Greedy algorithm looks for simple solutions to complicated problems with many steps.
