Week 1

Question 1

Criteria of algorithms?

Answer 1

1. Input: zero or more quantities are externally supplied
2. Output: at least one quantity produced
3. Definiteness: each instruction is clear and unambiguous
4. Finiteness: if we trace out the instructions of an algorithm, then for all cases the algorithm terminates after a finite number of steps
5. Effectiveness: every instruction must be very so that it can be carry out by a person only by pencil and paper

Question 2

Components of Pseudocode?

Answer 2

1. Variable
2. Iterative
3. Selection
4. Module

Question 3

Disadvantages of Recursive?

Answer 3

1. Memory allocation
2. Finite condition (avoid infinite loop)
3. Debugging technique
4. Understanding of scope variable

Question 4

Term of module in programming language?

Answer 4

1. procedure
2. sub
3. function

Question 5

communication with the caller dialing module?

Answer 5

1. using parameter
2. by value
3. by reference/location

Question 6

Disadvantages of Recursive algorithm?

Answer 6

1. memory allocation
2. finite condition (avoid infinite loop)
3. debugging technique
4. understanding of scope variable

Question 7

What is module?

Answer 7

several lines of algorithm that work for certain function can be group in a module

Question 8

Components of Pseudocode?

Answer 8

1. variable
2. iterative
3. selection
4. module

Question 9

basic steps of algorithm?

Answer 9

1. simplify problem
2. build mathematically solving plan
3. design an algorithm
4. test correctness of program
5. implement the algorithm to a programming language
6. documentation
7. analyze complexity of the program