BOLIVARIAN REPUBLIC OF VENEZUELA

NATIONAL EXPERIMENTAL UNIVERSITY 'SIMON RODRIGUEZ'

Nucleus: Barcelona Edo-Anzoátegui

CAREER: HUMAN RESOURCES MANAGEMENT

Introduction to Data Processing

Unit 4

Problem solving
through computers.

Enio Pérez PARTICIPANT:

Brother Eduardo Bolívar

C.I 28.686.541

BARCELONA JUNE 09 OF 2021

 Index

Introduction
Concept of Algorithms...........................................................................................4
Parts of an algorithm
Types of algorithms...................................................................................................4
Characteristics of algorithms..............................................................................5
Flowcharts and decision tables....................................................................5
Symbols used in flowcharts..........................................................6
Decision tables.....................................................................................................7
Programming. Programming languages.............................................................8
Methodology of diagramming in the approach and solution of problems
any type
Types of programming languages.................................................................9
Examples of programming languages.......................................................9
Steps for the development of a program............................................................10
Conclusion
Bibliography...............................................................................................................13
 Introduction
Problem solving, using a computer as a tool,
requires the ability to express to the machine what
must be carried out. That is, when it comes to a computer, they cannot
ambiguous instructions should be used. It is essential to have a clear understanding before each order.

the only interpretation of what must be executed. A machine does not possess the
capacity of human decision-making to resolve unforeseen situations. If to
giving an order to the computer results in an unforeseen situation, it will be
It is necessary to abort that task and restart the entire procedure again.

Considering that an algorithm is a method to solve problems, a

once analyzed, it is necessary to design a 'step by step' that indicates
clearly how to work. To carry out a certain process, it must be
supply the computer with a formula for solving a problem
(algorithm), whose design must be independent of the computer that solves it
the problem. Once the flowchart or the resolution algorithm of the
the problems are defined, we move on to the coding phase of the program in
any language In general, any activity of daily life can be
describe through algorithms. To start getting familiar with them.
 Concept of Algorithms.
An algorithm is a sequence of sequential instructions, thanks to which they can
carry out certain processes and respond to specific needs or
decisions. These are ordered and finite sets of steps that allow us to
to solve a problem or make a decision.

Parts of an algorithm

Every algorithm must consist of the following parts:

Input or entry. The input of the data that the algorithm needs to
operate.

ProcessIt is about the formal logical operation that the algorithm

will undertake with what is received from the input.

Output or result: The results obtained from the process on the input, a
once the execution of the algorithm is completed.

Types of algorithms

There are four types of algorithms in computer science:

Computational algorithms. An algorithm whose resolution depends on the

calculation, which can be developed by a calculator or computer without
difficulties.

Non-computational algorithms: Those that do not require the

processes of a computer to be resolved, or whose steps are exclusive to the
resolution by a human being

Qualitative algorithms: It is an algorithm whose resolution does not

Numerical calculations intervene, but logical and/or formal sequences.
 Quantitative algorithms: Quite the opposite, it is an algorithm that depends
of mathematical calculations to arrive at its resolution.

Characteristics of algorithms

Algorithms have the following characteristics:

Sequential: The algorithms operate in sequence, one must be processed at a time.

the time.

Accurate: The algorithms must be precise in their approach to the subject, it is

to say, they cannot be ambiguous or subjective.

Ordered: Algorithms must be arranged in the precise sequence and

exactly so that its reading makes sense and the problem is resolved.

Finite: Every sequence of algorithms must have a determined end, no

it can be prolonged to infinity.

Concretes: Every algorithm must provide a result based on the

functions it fulfills.

Defined: The same algorithm before the same input elements

must always yield the same results.

Flowcharts and decision tables.

The flowchart or also activity diagram, is a way to

graphically represent an algorithm or a process of some nature, to
through a series of structured and linked steps that allow for
review as a whole.

The graphic representation of these processes uses, in the flowcharts,

a specific series of geometric figures that represent each step
punctual of the process that is being evaluated. These defined forms of
in advance connect with each other through arrows and lines that mark the
direction of the flow and establish the course of the process, as if it were a map
will try.

There are four types of flowcharts based on the mode of their representation:

Horizontal: It goes from right to left, according to the reading order.

Vertical: Goes from top to bottom, like an ordered list.

Panoramic: They allow you to see the entire process on a single sheet, using the

vertical model and the horizontal.

Architectural: Represents a work itinerary or a work area.

Symbols used in flowcharts.

Start/End: This is used to represent the beginning or the end of an algorithm.
It can also represent a scheduled stop or interruption.
necessary to carry out in a program.

Process: This is used for a specific process, it is the one that is used.
commonly to represent an instruction, or any type of operation that
origin a change of value.

Input/Output: This symbol is used to represent an input or output.

of information, to be processed or recorded through a peripheral.

Decision: This is used for decision making, ramifications, for the

indication of logical operations or comparisons between data.
Connector: This is used to link any two parts of a diagram.
through an output connector and an input connector. This forms a link
on the same page of the diagram.

Connector off page: This is used to link two parts of a diagram

but they should not be on the same page.

Program flow: This is used to indicate the sequence of the diagram

flow, that is, to indicate the direction of operations within it.

Printed information output: This is used to represent the output of

information via the printer.

Show information on screen: This is used to represent the output or

to display the information through the monitor or screen.

Decision tables.

A decision table is an input of planned rule logic, in

table format, which is composed of conditions, represented in the
column and row headers, and actions, represented as points of
intersection of the conditional cases of the table. Decision tables are
especially suitable for business rules that have multiple conditions.
Adding another condition is as easy as adding another row or column.

Just like the if/then rule set, the decision table is

controlled by the interaction of conditions and actions. The main difference
It is based on the fact that in a decision table, the action is decided through more than
a condition, and more than one action can be associated with each set
conditions. If the conditions are met, the action or actions are carried out.
corresponding.
 Programming. Programming languages.
It is a program intended for the construction of otherssoftware programs. His
the name is due to the fact that it encompasses a formal language that is designed to

organize algorithms and logical processes that will then be carried out by a
computer or information system, thus allowing to control its behavior
physical, logical and its communication with the human user.

Methodology of layout in the planning and solution of

problems of any kind.
It is necessary to establish input, process, and output specifications in the
In the first stage we find input or initial information, which will serve for the
analysis of the problem.

The second stage or phase is to analyze the problem, at this stage it is advisable
divide or segregate the necessary and identified tasks that will help with the solution
of the given problem. In this way, they will be simplified and more understandable.
for its development, it is always recommended to start with the tasks or activities that are more

from the simplest to the most complex. In this phase, the input information is transformed
received.

The third stage in algorithm programming consists of the implementation and

development put in place of it, here the information and final result is obtained
resulting from the previous stages.

It is necessary to follow a series of systematic steps for the development to have

a good, optimal, and effective result.
 Types of programming language.
Low-level languages: These are programming languages that are
designed for specific hardware and therefore cannot migrate or
exporting to otherscomputersThey make the most out of the system
for which they were designed, but do not apply to any others.

High-level languages: These are programming languages that

they aspire to be a more universal language, so they can be used
regardless of the hardware architecture, that is to say, in various types of
systems. There are general-purpose and specific-purpose ones.

Medium-level languages: This term is not always accepted, which

proposes programming languages that are situated at a midpoint between the
previous two: it allows high-level operations and at the same time local management of
the architecture of the system.

Another way of classification is often the following:

Imperative languages: Less flexible, given the sequentiality in which

they build their instructions, these languages program through commands
conditionals and a block of commands to which they return once carried out the
function.

Functional languages Also called procedural, these

programming languages operate through functions that are invoked according to the input
received, which in turn are the result of other functions.

Examples of programming languages

Some of the most well-known programming languages are:

BASIC: Its name comes from the acronym for Beginner ’s All-
Symbolic Instruction Code (SIC) symbolic of instructions
general purpose for beginners), and it is a family of imperative languages of
high level, first appeared in 1964. Its most current version is Visual
Basic .NET.

COBOL: Its name is an acronym for Common Business-

Business-Oriented Language (a common language oriented towards business) and it is about a

universal programming language created in 1959, primarily oriented towards the

management information technology, that is to say, business.

FORTRAN: Its name comes from The IBM Mathematical Formula

Translation System (The mathematical formula translation system from IBM), and
It is a high-level, general-purpose programming language and of type
imperative, designed for scientific and engineering applications.

Java: A general-purpose programming language, oriented to

objects, whose spirit is summarized in the acronym WORA: Written Once, Run
Anywhere, that is: Written once, it works anywhere. The idea was
design a universal language using syntax derived from C languages and
C++, but using fewer low-level utilities than either of the two.

Steps for the development of a program.

A software application (or set of programs) is developed, as we have
commented, with the aim of solving a specific problem. To do this,
you should take into account the so-called life cycle, composed of the stages that are
they must follow sequentially and orderly. These stages are:

Analysis

Specification phase of the needs that our must satisfy

application and the approach to cover them.
Design

Once the needs have been identified, in the design phase they must be detailed
every single one of the elements we will use: physical resources (characteristic
of the computer, peripherals, etc.) and logical (operating system, compiler,
tools of utility, etc.)

3. Encoding

As seen in a previous section, the task here is to translate into a

programming language the solution obtained in the design phase.

4. Exploitation

To deploy our application or program, it must be implemented in the system.

computer we are using, that is, installing it to later
run it and check the results it offers us.

5. Maintenance

This final stage is fundamentally related to the idea of improving the

program developed, correcting errors and providing ideas that make it
more efficient. Thus, it can sometimes lead to the restart of the life cycle.
 Conclusion

A computer will provide a solution to certain tasks, always and

when instructed. These instructions must follow a logical sequence to the
What are called algorithms, they must be sequential and precise.
ordered, finite, concrete.

In algorithm design, programming languages are used according to

the specific function that they wish to execute can be of high, medium,
low, functional or imperative.

Specific codes are used to transcribe these instructions, the most

known are: BASIC, Fortran, COBOL, Java and through flow charts and
decision tables and the computer programming shape.

The steps for programming include analyzing what is

wants the computer to execute until its maintenance, defining its cycle of
life.
 Bibliography

[Link]. (n.d.). Algorithm in computer science. [Link], Available

In computer science, an algorithm is a set of rules or instructions that are followed to solve a specific problem or perform a task.
Ethics, an algorithm is a problem or to take
a decision.

Dismerlin. (2020). Computational Algorithms and Programming Languages.

[Link] , Available
[Link]
[Link].

IEDA. (n.d.). Stages of developing a computer program.

[Link] , Available
URL is not accessible for translation.
an_2016091412_9100538/4_stages_of_preparation_of_a_information_program
[Link]

RootWeb. (2018). What is an algorithm?[Link]

Available en: what is a
[Link].