Chapter 2

Question 1

Algorithm

Answer 1

An EFFECTIVE procedure for solving a problem
in a FINITE number of steps.

OR

A finite list of instructions on how to perform a task

Question 2

Properties of Algorithm

Answer 2

– The actions to be executed
– It must result in a finite series of actions.
– The order in which these actions are to be executed.
– The sequence terminates with a solution

Question 3

Algorithm can be represented by

Answer 3

Flowchart,
Pseudocode,
Decision Table,
N-S Diagram

Question 4

Flowchart

Answer 4

A GRAPHICAL REPRESENTATION of FINITE series of ACTIONS

OR

A graphical representation of an algorithm
or of a portion of an algorithm.

Question 5

Basic Structures

Answer 5

Basic unit of programming language

Question 6

Sequence (In order)

Answer 6

• Perform actions in order

* No branching or skipping any task

Question 7

Selection (decision)

Answer 7

• Ask a question, take one of two actions

* Dual-alternative or single-alternative

Question 8

Loop (Repetition)

Answer 8

• Repeat actions based on answer to a question

Question 9

Pseudocode

Answer 9

An artificial and informal language that helps programmers to develop algorithm.

OR

A convenient informal language yet user friendly that helps programmers to develop algorithm.

Question 10

Decision Tables

Answer 10

A precise yet compact way to model complicated logic.

Question 11

N-S Diagram

Answer 11

A diagrammatic approach to algorithm design

Question 12

Desk Checking

Answer 12

Process of testing can be done by execute the steps in

algorithm

Question 13

Selection structures

Answer 13

– Single selection
– Two selections
– Multi selections