COIS 102 LA HEURÍSTICA PRIMER TALLER

COIS 102 LA HEURÍSTICA PRIMER TALLER -...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
UNIVERSIDAD DEL TURABO INTRODUCCION AL PROCESAMIENTO DE DATOS COIS 102 TITULO DE ASIGNACION: PRINCIPIOS DE PROGRAMACION TALLER UNO FECHA: 11-06-07 OCTAVIO CADAVID PROFESOR : MARCELINO S ANDINO 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Heuristic Heuristic are developed tools to help in the resolution of many kinds of problems. Although scientific capacity of the humanity one seems to have reached a level that allows giving an answer practically to any challenge that considers, lamentably is not that one the reality. Indeed, if we thought about the real problems that usually they are of interest, for which the objective is to find solution that optimizes some type of criterion, for example: smaller cost under certain conditions, the situation is exactly the opposite one; only one small part of them can easily be solved. In being circumstances, the heuristics acquire a greater importance every time Algorithm An algorithm is a set ordered and finite of operations that allows to find the solution of a problem. That is to say, that an algorithm is a method to find the solution to any
Background image of page 2
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: problem. The algorithms are the object of study of algoritimia and its definition is formalized by the machine of turing. Its importance is in showing the way to carry out processes and to solve mathematical problems; like the mathematical functions, the algorithms receive an entrance they transform and it into an exit. Nevertheless, so that an algorithm can be considered like so, it must be defined, finite and efficient. By efficient it is understood that the instructions find the solution in the smaller possible time; finite it implies that it has a certain number of steps, that is to say, that finishes; and defined, that if it is followed the same process more in one go reaches always the same result. 2 Six Steps To Problem Solving 1. Research and gather information 2. Define the problem 3. Plan the solution 4. Execute the plan 5. Verify the solution 6. Develop a conclusion This information was provided by: www.google.com www.yahoo.com 3 4...
View Full Document

Page1 / 4

COIS 102 LA HEURÍSTICA PRIMER TALLER -...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online