Homework N°3

Unit 12.
Algorithms
Total Points: 32 pts.
I.-Get ready
Before you read the passage, talk about these questions. (4 pts)
1. What are some uses of algorithms?

Some of its uses so many times you can come up with; Solve decision problems and calculation
problems effectively.

2. What are the two desirable traits of a computer algorithm?

the taking of input values through a prescribed sequence and the output of the algorithm that
solves the problem.
II.- Read the textbook chapter. Then, choose the correct answer. (6 pts)

1. What is the passage mostly about?

A. a comparison of different types of algorithms
B. an overview of the properties of algorithms
C. instructions for programming algorithms
D. a history of the use of algorithms

2. Which ideas is NOT in the passage?

A. An algorithms is a finite sequence of steps
B. Algorithms should be both good and elegance
C. Algorithms are used for automated reasoning
D. Algorithms are used to create new functions.

3. Why were algorithms first used?

A. to perform data processing tasks
B. to solve the decision problem
C. to aid in computer engineering
D. to ensure that problems are decidable

III.- Answer the following questions. (6 pts)

1. What are algorithms used for in computer engineering?
to solve decision problems.

2. What does an algorithm determine?

a series of instructions that tell the computer how to use the information given to it in a prescribed way.

3. What do computer algorithms have to balance?

goodness and elegance.

IV.- Vocabulary. Match the words from (1-8) with the definitions (A-H)-(16 pts)
1.E ______ finite 5. H_____ determine
2.B _____ sequence 6.C _____ step by step
3. D______ elegance 7.F _____ calculation
4. G______ algorithm 8. A _____ effective method

A. a problem-solving process that always produces the correct answer.

B. following specific sequence of actions
C. the process of analyzing and solving a mathematical problem
D. a set of actions or numbers arranged in order.
E. having definite limits on its value
F. a set of precise rules for solving mathematical functions
G. the compactness of a computer program
H. to decide conclusively based on the available evidence.