SLR08 ALGORITHMS

Question 1

What is an Algorithm?

Answer 1

A specific sequence of steps that can be followed to complete a task

Question 2

What is abstraction?

Answer 2

Removing the unnecessary details and filtering the necessary ones.
It is a method of computational thinking.

Question 3

What is decomposition?

Answer 3

Breaking a complex problem down into smaller tasks.
It is a method of computational thinking.
To make problems easier to solve, can divide the work for each person in a group, program components developed can easily be used in other programs.

Question 4

What is an example of algorithmic thinking?

Answer 4

The way of getting a solution by identifying the individual steps needed. Creating a set of rules, an algorithm that if followed precisely leads to an answer.
E.g learning multiplication. Following these rules can get the answer to a problem.

Question 5

Which two ways would you do to describe algorithms?

Answer 5

Pseudo code and flow diagrams

Question 6

How would we visually see if a program works without running it?

Answer 6

We could use trace tables which works as a yes/no trace table to see each and every outcome.

Question 7

What is linear search?

Answer 7

From the beginning of a data set, each item is checked in turn to see if it is the one it searches for.

• doesn’t require any order
• Any type of storage device
• efficient in smaller sets
• inefficient in large data sets

Question 8

What is binary search?

Answer 8

It is to calculate a mid-point in a data set.
If the item is to be found higher or lower. It will set the mid point in that range until it is found.
Requires order
More efficient on average.