Module 1

Question 1

It is a sequence of unambiguous instructions for solving a problem, i.e., for obtaining a required output for any legitimate input in a finite amount of time.

Answer 1

Algorithm

Question 2

It is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output.

Answer 2

Algorithm

Question 3

It is a sequence of computational steps that transform the input into the output.

Answer 3

Algorithm

Question 4

What are the requirements of an algorithm

Answer 4

(FDCCE)
- Finiteness
- Definiteness
- Clearly specified input
- Clearly specified or expected output
- Effectiveness

Question 5

True or False. An algorithm may only be represented in one single form, a sequence of steps.

Answer 5

False
(An algorithm can be represented in various forms. Recipes, processes, methods, etc.)

Question 6

What are the steps involved in solving computational problems?

Answer 6

(PDSDCAIPD)
- Problem Definition
- Development of a Model
- Specification of an Algorithm
- Designing an Algorithm
- Checking the Correctness of an Algorithm
- Analysis of an Algorithm
- Implementation of an Algorithm
- Program Testing
- Documentation

Question 7

This step states that before you start to work on a solution the developer or/and programmer must be able to understand fully the problem statement.

Answer 7

Problem Definition

Question 8

How many elements do problem statements often have?

Answer 8

Three

Question 9

What are the three elements of problem statements?

Answer 9

-The problem
- The method of solving the problem
- The purpose

Question 10

It involves the definition of model objectives, conceptualization of the problem, translation into a computational model, and model testing, revision, and application.

Answer 10

Model Development

Question 11

It is an iterative process, in which many models are derived, tested, and built upon until a model fitting the desired criteria is built.

Answer 11

Model Development

Question 12

True or False. Subsequent modelling work may need to begin the search at a different place as the original model building began, rather than where it finished.

Answer 12

False
(Modelling work may need to begin at THE SAME PLACE)

Question 13

All algorithms must satisfy which criteria? (Enumerate all 5)

Answer 13

(IODFE)
- Input
- Output
- Definiteness
- Finiteness
- Effectiveness

Question 14

This algorithm criteria states that An algorithm has zero or more inputs, taken from a specified set of objects.

Answer 14

Input
(ZERO or more inputs)

Question 15

This algorithm criteria states that Each step must be precisely defined; Each instruction is clear and unambiguous.

Answer 15

Definiteness
(precisely defined, clear and unambiguous)

Question 15

This algorithm criteria states that The algorithm must terminate after a finite number of steps.

Answer 15

Finiteness
(finite number of steps)

Question 16

This algorithm criteria states that An algorithm has one or more outputs, which have a specified relation to the inputs.

Answer 16

Output
(ONE or more outputs)

Question 17

This algorithm criteria states that All operations to be performed must be sufficiently basic that they can be done exactly in finite length

Answer 17

Effectiveness
(finite length)

Question 18

In theoretical science, the _______ of an algorithm is asserted when it is said that the algorithm is correct with respect to a specification.

Answer 18

Correctness

Question 19

_________ correctness refers to the input-output behavior of the algorithm.

Answer 19

Functional
(input-output behavior)

Question 20

_________ correctness requires that if an answer is returned it will be correct.

Answer 20

Partial

Question 20

It is the determination of the amount of time and space resources required to execute it.

Answer 20

Analysis of algorithms
(determination of the amount of time and space)

Question 20

_________ correctness requires that if an answer is returned it will be correct and that the algorithm terminates.

Answer 20

Total
(algorithm must also terminate)

Question 21

A ___________ is a type of mathematical proof that plays a critical role in formal verification because total correctness of an algorithm depends on termination.

Answer 21

Termination proof

Question 22

It refers to the efficiency or running time of an algorithm is stated as a function relating the input length to the number of steps.

Answer 22

Time Complexity
(number of steps)

Question 23

It refers to the efficiency or running time of an algorithm is stated as a function relating the input length to the volume of memory.

Answer 23

Space Complexity
(volume of memory)

Question 24

It is a series of steps that you expect will arrive at a specific solution

Answer 24

Algorithms

Question 25

True or False. Writing a program is equal to expressing the code for the said program.

Answer 25

False
(Writing a program DOES NOT EQUAL expressing code)

Question 26

It is the process of executing a program with the intent of finding errors.

Answer 26

Program Testing
(intent of finding errors)

Question 27

A good test is one that has a decently low probability of finding an error.

Answer 27

False
(Has a HIGH probability of finding an error)

Question 28

True or False. Program testing can show the absence of errors and show if errors are present

Answer 28

False
(program testing CANNOT show the absence of errors)

Question 29

True or False. It is possible to write tests before the program.

Answer 29

True

Question 30

For a programmer reliable ____________ is always a must.

Answer 30

Documentation

Question 31

True or False. Successful documentation will make information easily accessible, provide a limited number of user entry points, help new users learn quickly, simplify the product and help cut support costs.

Question 32

The presence of _________ helps keep track of all aspects of an application and it improves on the quality of a software product.