Algorithms

Algorithms

1. Is a step by step procedure for solving a problem or accomplishing some end.

2. Characteristics

   • Finiteness
   • Uniqueness
   • Input
   • Precision
   • Output

3. Media Design

   • Programming
     • Operating System
       • Computer: Mac, Windows, Solaris, etc.
       • Mobile: Android, iOS, BlackBerry, etc.
     • Programming Languages
       • High-Level Language
       • Natural Language
       • Low-Level Language
       • Machine Language
     • Application
       • Word Processors (Word, Pages, etc.), Image Editors (Paint, Photoshop, etc.), Communication (Whatsapp, Skype, Facebook.).
     • Is a process used to créate software programms.
     • Programmers: People who use programming languages to create software applications.
     • Programming Languages: Consist of a vocabulary and a set of rules called syntax.
       • Compilers and Interpreters: Source code, [binary] code, High-Level Language, Compiler, Executable Program, Interpreter.
     • The Program Development Life Cycle
       • Phase1:Defining the problem, Phase 2: Designing the program, Phase 3: Coding the program, Phase 4: Testing and debugging the program, Phase 5: Documenting the program, Phase 6: Implementing and maintaining the program.
   • Computational Algorithms
     • Application Software: Office, Goggle Chrome, Photoshop, etc.
     • System Software: Windows, Linux, Android, etc.
     • Programming Software: Programming languages that allow us to develop application software.
     • Identifiers: Are the names given to variables, constants, or functions that manipulate the algorithm or the program.
       • The rules for defining an identifier are: 1.Must be significant, 2. You can use letters, digits or underscore, 3. You can not match words of the programming language, ex: do, while, variable, for, if, etc.
   • Flow Diagram: Is a graphical representation of an algorithm. To design them, symbols or figures are used, representing the steps of the algorithm joined by arrows representing the execution flow.
     • Symbols: Start, Input Data, Processes and Operations, Output Data, Conditional, Connectors, End.
     • Flow Diagram
   • Sequential Structures
     • It follows a consecutive order.
   • Conditional Structures
     • Compare a variable against another value, according to the result of this comparison, a further course of action within theprogram.
       • 2 Tipes of Conditional: Simples: (Yes-Then-But) Actions are executed or other does not, or as a certain condition. Nested: When the banch is true or false in a conditional structure is another conditional estructure.
   • Raptor
     • Is a visual programming development environment based in flowcharts. A flowchart is a collection of connected graphic symbols, where each symbol represents a specific type of instruction to be executed.
       • Structure: 1. You begin at the start symbol. 2. It stops executing when the end symbol is reached. 3. Input: Allow the user to enter data. Each data value is stored in a variable. 4. Processing (assigment): Change the value of a variable using some type of mathematical calculation. 5. Processing (call): Execute a group of instructions defined in the named procedure. 6.Output: Display the value of a variable.

Imágenes y archivos del mapa