Please enable JavaScript.

Coggle requires JavaScript to display documents.

Paper 2, Computational Thinking, Algorithms, etc. - Coggle Diagram

- - - - A method of writing algorithms that sits between normal language and programming language.
        
        There is no one way of writing pseudocode, so examples of it written by different people will often differ significantly.
        
        However, no matter the style, pseudocode is meant to be unambiguous, easy to read, and free of errors when converting into actual code.
        
        Generally, action words are capitalized, italicized, or written in bold
        
        Pseudocode is allowed to have vague keywords, though confusion may arise when converting extremely vague pseudocode
        
        Since it is meant to be easier to write than actual code is, pseudocode will often shorten certain words
        
        However, conditionals like else and if should be properly represented for ease of conversion
    - - Charts that lay out all of the possible progression processes for an algorithm
        
        Use different box types to indicate different command types
        
        Rectangle
        
        General instructions
        
        Diamond
        
        Used for decisions
        
        Generally yes/no decisions
        
        Parallelogram
        
        Shows inputs and outputs
        
        Used anytime something goes into or out of the algorithm
        
        Box within a box
        
        Links to other flow diagrams
        
        The least commonly used
        
        Box with rounded corners
        
        Used at the start and end of an algorithm
        
        Shows start/stop
        
        Arrow
        
        Connect boxes
        
        Show which instructions go next in the algorithm
  - - - The Process of breaking a task into smaller parts, allowing all of these parts to be completed individually, making the overall task less difficult
      - Allows humans to visualize a problem more easily, as they can see all the individual sub-problems in the task as well as how they connect to each other.
    - - The process of thinking in the way an algorithm does
      - Involves breaking a task or problem down into many smaller steps with certain steps being dependent on the results of others
      - Pseudocode and flow diagrams are useful tools in algorithmic thinking.
    - - The process of removing non-critical details in a problem
      - Certain details may make a problem more difficult or confusing to complete, removing them will make the task take much less time