Section 2: problem solving and theory of computation

Question 1

Chapter 7:

• stages of software development:
• Analysis; the req_______ and ____ must be est_______, the _____ of the _____ are con______.
• Design; ___ str________ will be sp_______, ________, user int_____ and ______ will be designed.
• Implementation; the pro_______ code is wr______.
• Testing; the whole sy_____ must be ____ for _____, using selected ___ da__, covering, no_____, bou______ and err_______ data.
• Evaluation; the system is ev_______ according to a given cri_____.

Answer 1

Chapter 7:

• stages of software development:
• Analysis; the requirements and goals must be established, the needs of the user are considered.
• Design; data structured will be specified, algorithm, user interface and reports will be designed.
• Implementation; the program code is written.
• Testing; the whole system must be tested for errors, using selected test data, covering, normal, boundary and erroneous data.
• Evaluation; the system is evaluated according to a given criteria.

Question 2

Chapter 7:

• Strategies to solve problems;
• Exhaustive search; a __ and _____ method, which means all po______ com_______ are ____ until the _____ one is fo____. time consuming.
• Divide and conquer; far more eff_______ than exhaustive search, like bobble search.

Answer 2

Chapter 7:

• Strategies to solve problems;
• Exhaustive search; a try and error method, which means all possible combinations are tried until the right one is found. time consuming.
• Divide and conquer; far more effective than exhaustive search, like bobble search.

Question 3

Chapter 8:

• the structural approach; ____ to im______ the cl______ and mai________ of the program.
• block structural language; a sec_______ of ___ made from ___ or more sta______, keeps sub______ ind_______ of the pr______ use of par_______.
• hierarchy table; a ____ used to re_______ the str_________ of a pr_______, showing how the ______ _____ to one another. does __ show det______ program str______.

Answer 3

Chapter 8:

• the structural approach; aims to improve the clarity and maintainability of the program.
• block structural language; a section of code made from one or more statements, keeps subroutines independent of the program use of parameters.
• hierarchy table; a tool used to represent the structure of a program, showing how the modules relate to one another. does not show detailed program structure.

Question 4

Chapter 10:

• testing; to __ and un_____ undetected ____.
• Normal data; ___ within the ex_____ r_____.
• Boundary data; ___ that is j___ at the li____ of the ex_____ r____ or just ___ it.
• Erroneous data; ___ that is ou_____ of the ex______ r____ or is the wr____ ____ type.
• Dry-running; a tec_______ use to locate err__ in a pr_____, performed by foll______ the ____ of the pr_____ like a com______ would and uses a t___ table.

Answer 4

Chapter 10:

• testing; to try and uncover undetected errors.
• Normal data; data within the expected range.
• Boundary data; data that is just at the limit of the expected range or just over it.
• Erroneous; data that is outside of the expected range or is the wrong data type.
• Dry-running; a technique use to locate errors in a program, performed by following the logic of the program like a computer would and uses a trace table.

Question 5

Chapter 11:

• Abstraction; a repr_________ arrived at by re________ unn_______ details.
• Functional abstraction; this is when the com_________ me_____ of a f______, will not be sh____ to a ___.
• Data abstraction; the de_____ of how ___ is actually rep_______ is hi____.
• Information hidden; this is when ___ is __ di_____ acc_______ and can only be acc_______ through de_____ pr______.

Answer 5

Chapter 11:

• Abstraction; a representation arrived at by removing unnecessary details.
• Functional abstraction; this is when the computational method of a function, will not be shown to a user.
• Data abstraction; the details of how data is actually represented is hidden.
• Information hidden; this is when data is not directly accessible and can only be accessed through defined procedures.

Question 6

Chapter 11:

• Problem abstraction; involves the re______ of de_____ until the pr______ is rep_______ in a way that is pos______ to solve.
• Decomposition; the br______ down of a co_______ pr_______ into a number of __-pr_____.
• Composition; to co______ proc______ to form a com_______ pr_______.

Answer 6

Chapter 11:

• Problem abstraction; involves the removing of details until the problem is represented in a way that is possible to solve.
• Decomposition; the breaking down of a complex problem into a number of sub-problem.
• Composition; to combine procedures to form a compound procedure.

Question 7

Chapter 12:

• finite state machine; a ____ of comp______ used to de___ com____ pr______ and seq_____ ___.
• state transition table; an alt________ rep_________ of a ___, this _____ the cur_____ state and the ___ state for each in___.

Answer 7

Chapter 12:

• finite state machine; a model of computation used to design computer programs and sequential logic.
• state transition table; an alternative representation of a FSM, this shows the current state and the next state for each input.