9 - algorithm design + problem solving

Question 1

abstraction

Answer 1

the process of extracting essential inforrmation while ignoring what isnt relevant

Question 2

decomposition

Answer 2

the process of breaking a complex problem into smaller parts

Question 3

pattern recognition

Answer 3

the identification of parts of a problem that are similar and could use the same solution

Question 4

+ abstraction

Answer 4

+ time needed to develop programs is reduced
+ program is smaller in size so takes up less memory space + decreases download size
+ greater customer satisfaction as requirements met without extra features

Question 5

3 ways to write algorithms

Answer 5

• structured English
• pseudocode
• flowcharts

Question 6

4 basic constructs of algorithms

Answer 6

• assignment
• sequence
• selection
• iteration

Question 7

flow chart symbols

Answer 7

square - assignment/ sequence
diamond - selection/ decisions
parallelogram - input
oval - start/end

Question 8

identifier table

Answer 8

identifies every variable and describes what it stores and data types

Question 9

stepwise refinement

Answer 9

decomposition breaks problems down into smaller parts
these parts are written as a series of steps where each can be written in high level language

Question 10

what is an algorithm

Answer 10

a sequence of defined steps that can be carried out to perform a task

Question 11

variable

Answer 11

a storage location for data with an identifier

Question 12

rogue value

Answer 12

a value used to terminate a sequence of value - same data type but outside the expected range eg -1

Question 13

procedure

Answer 13

a sequence of steps that is given an identifier and can be called to perform a sub task

Question 14

function

Answer 14

procedure that returns a single value

Question 15

local vs global variable

Answer 15

variable accessible within the module vs accessible from all modules

Question 16

CASE pseudocode

Answer 16

CASE OF
1 :
2 :
3 :
OTHERSISE :
END CASE