cs 4.1.

Question 1

algorithm

Answer 1

sequence of steps, than can be followed to complete task, it always terminates

Question 2

sequence

Answer 2

instructions that follow on from one another

Question 3

abstraction

Answer 3

process of omitting unnecessary details

Question 4

representational abstraction

Answer 4

removing unnecessary details from the problem

Question 5

Abstraction by generalisation

Answer 5

simplifying a problem by grouping together common characteristics to filter out details we don’t need

Question 6

information hiding

Answer 6

process of hiding all details of an object that do not contribute to essential characteristics.

Question 7

procedural abstraction

Answer 7

result of abstracting away the actual values used in a particular computation
e.g. Area = width x height

Question 8

functional abstraction

Answer 8

supply the number order, type of inputs required to get output , results in just a function
RectangleArea = Area()

Question 9

data abstraction

Answer 9

specific data of how data is actually represented are abstracted away, allowing new kinds of data structured to be created from previously defined data structures.

Question 10

problem abstraction

Answer 10

details removed from a problem until it is represented in a way that it is solvable, because it is similar to a problem already solved

Question 11

decomposition

Answer 11

problem is divided into series of smaller sub-problems, smaller problems can be solves or further divided until all parts can be solves

Question 12

composition

Answer 12

solutions developed by plugging in pre-existing components that already work
combining appropriate procedures to form compound procedure

Question 13

automation

Answer 13

process of putting abstractions of real world phenomena into action to solve problems.