sábado, 3 de diciembre de 2016

ALGORITHMS

ALGORITHMS

An algorithm is a series of instructions or ordered steps for performing an activity or resolving a problem.
   Algorithms have the following characteristics:
    • They contain specific instructions so there is no ambiguity.
    • They must end; in other words, they are finite.
    • All their steps are simple and ordered.
    PROJECT APROACH: The project aproach is a method of dealing with and resolving the practical problems affecting any society. It consists of ten stages and we can study it as an algorithm.

               Phases of the project approach

    1. Detect the problem we have: what do we need, what problem do we have, what conditions are there, if its all very clear it will be easier to solve the problem we have. 
                For example: you miss your friends while you are in your bedroom, and you want  to make a picture frame to see them. 

    2. Information and research:  we select all the information that we have looked for in the different ways that we could solve the problem.
                For example: each of the people of the group look in the internet for different ways of solving it.


    3. Search for possible solutions: think about different options, different objets or products and we study each option to see if its viavle.
                For example: bring to class the different options you have search for.

    4. Choose the solution: choose the best solution based on the criteria, (it has to be cheap, good, beautifull...etc).
                For example: as we have the diferent ideas, we should choose the one who follows all the conditions.

    5. Desing: we should make sketches, drawing sor plans about our choosen solution by freehand.
               For example: now that we have the main idea of doing our projec twe should draw it on a paper.  

    6. Prepare and plan the work: choose materials, techniques and tools that we are going to need.
              For example: in the table organize all the work for starting building your project.

    7. Build the product: this is the stage were you build, assemble and finish the project.
             For example: your group has to put the pieces of the object in the correct order for finish the project.  

    8. Check the results: check if the product works. If it works and finishes as its supouse to be your product is finished.
            For example: as you do it well and you don´t have to change anything you´v finished it. 

    9.  Presentation and assessment: present your work and have it assessted by the rest of your partners and teacher.
           For example: present your group project to the rest of the class and make the assessment criteria. 

    10. Write the project report. 

    PROGRAM: Is the translation of an algorithm into a programming language that ca be understood and processed by a computer.

    FLOWCHART: Is a chart used to represent algorithms, it´s used symbols connected by arrows to show the sequence of the actions. 
    The symbols used in flowcharts are:
    • Terminal: represents the beginning or end of the development of an algorithm.
    • Process: use to represent each of the actions needed to develop the algorithm.
    • Information input or output: used when information is needed or when we present data or results.
    • Flow line: tell us the order of the actions in the algorithm.    



    A) SEQUENTIAL ALGORITHM: a basic structure used to solve problems. The instructions of the algorithm are executedone after the otherin the same order as they appear.
          For example:
    1. Go to class
    2. Listen to the explanations
    3. Ask questions
    4. Study at home
    5. Do the exam  


    B) SELECTIVE ALGORITHM: have a series of instructions that are excuted depending on whether or not a condition is met.
     For example:
    1. Exam mark
    2. Workshop mark
    3. Calculate average exam and workshop mark
    4. Average aprox. 5  
    5. Fail or pass 
    C) ITERATIVE ALGORITHM: have a set of instructions that are repeated several times. These instructions are contained in loops that mark the beginning and end of the repetition.
                     For example:              
     
    1. Exam mark
    2. Workshop mark
    3. Calculate average exam and workshop mark
    4. Average aprox. 5  
    5.  pass or repeat exam and workshopmark
                                                                                                                       


    No hay comentarios:

    Publicar un comentario