0% found this document useful (0 votes)
28 views5 pages

Assignment Unit 4.1

ADAD ASDSD

Uploaded by

Ximena Guerra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
28 views5 pages

Assignment Unit 4.1

ADAD ASDSD

Uploaded by

Ximena Guerra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

ASSIGNMENT UNIT 4 (WEEK 7)

PRESENT:
VALERIA SOFIA PRADO ACEVEDO
CÓDIGO:
1082833239

PRESENTA A:
MIGUEL ANGEL PEREZ

UNIVERSIDAD NACIONAL ABIERTA Y A DISTANCIA


COURSE: INTRODUCTION TO PROGRAMMING
27/10/2024
Develop the following Exam based on the following questions:

1. The fundamental characteristics that every algorithm must meet are:

a) An algorithm must be precise and indicate the order of execution of each step.

b) The algorithms have three different parts: input, process and output.

c) An algorithm must be well defined, that is, if its execution is followed twice, the same

logical sequence must be obtained.

d) All the previous options.

2. The types of algorithms can be:

a) According to the types of data.

b) According to the expected result.

c) According to its system of signs, functions and strategy.

d) None of the above options.

3. An algorithm can be defined as:

a) Algorithm is a set of instructions that specify the sequence of operations to be performed,

in order, to solve a specific system or class of problem.


b) An algorithm is the application of logical steps, not sequential or methodically applied to

solve a problem in question.

c) An algorithm is called a set that is neither ordered nor structured, which allows a task to

be carried out.

d) An algorithm is a sequence of operations that are not very detailed and ambiguous that

lead to solving problems.

4. The most important advantages of an algorithm can be:

a) They usually require prior and above all technical knowledge.

b) Modifications to modules are more difficult.

c) The problem is more easily understood by dividing it into simpler parts called modules.

d) It allows blind confidence in a logical method to solve a problem.

5. The usual methods to represent an algorithm are:

a) Flow diagram.

b) Formulas and pseudocode language.

c) N-S diagram (Nassi-Schneiderman).

d) All the previous options.


SOLUTION

The fundamental characteristics that every algorithm must meet are:

d) All the previous options.

Each characteristic mentioned is essential for defining a proper algorithm: precision and

execution order, division into input-process-output, and a well-defined nature.

The types of algorithms can be:

a) According to the types of data.

b) According to the expected result.

c) According to its system of signs, functions and strategy.

While none of these options explicitly encompasses all possible categorizations, the first

three options represent common ways to classify algorithms.

An algorithm can be defined as:

a) Algorithm is a set of instructions that specify the sequence of operations to be performed,

in order, to solve a specific system or class of problem.

This definition accurately captures the essence of what an algorithm is, emphasizing its

ordered nature and problem-solving purpose.


The most important advantages of an algorithm can be:

c) The problem is more easily understood by dividing it into simpler parts called modules.

This reflects a key benefit of using algorithms: they simplify complex problems, making

them more manageable and understandable. The other options highlight drawbacks rather

than advantages.

The usual methods to represent an algorithm are:

d) All the previous options.

Flow diagrams, formulas, pseudocode, and N-S diagrams are all valid representations of

algorithms, each serving different purposes and audiences.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy