3.3.6 High level programming paradigms

Description

Mind map for A2 Computing Master Mind Map *FINISHED*
Adam Cook
Mind Map by Adam Cook, updated more than 1 year ago
Adam Cook
Created by Adam Cook almost 8 years ago
14
0

Resource summary

3.3.6 High level programming paradigms
  1. Programming paradigms
    1. In a computing context it means ways of programming.
      1. Paradigm means an example or pattern.
        1. Different languages may use different paradigms.
          1. Some languages may be designed to use one or many paradigms.
          2. Low-level languages
            1. First languages created were these kinds of languages
              1. One to one relationship with machine code
              2. Procedural Languages
                1. Programmer states steps needed to execute program
                  1. Programmers decide the steps and order that the program needs to follow
                    1. Program divided into blocks of code called functions and procedures.
                      1. Procedures have their own variables that can not be accessed outside of them.
                        1. Logic of the program expressed via procedure calls.
                          1. Languages include: Pascal, C, Visual Basic
                          2. Object-Orientated
                            1. Programmer designs self-contained objects.
                              1. Objects contain both program routines and the data being processed.
                                1. Program is split into objects which can be used by other objects to build a more complex system.
                                  1. Objects are self-contained and simple and so are easier to program.
                                    1. Objects can be reused and inherited without having to rewrite code.
                                      1. Languages include: C++, Delphi, Java, Visual Basic
                                        1. Object has three main sections
                                          1. 1: Name: The name of the class
                                            1. 2: Data: Information that all objects of this type have (all students go to school, so school would be a data field inside of the class student).
                                              1. 3: Methods: Bits of code that allow you to access and modify the data inside of the object.
                                                1. Data inside of an object can only be accessed by using the methods provided inside of the object. This is referred to as data encapsulation. Data encapsulation makes it more difficult to write faulty code that overwrites data incorrectly.
                                              2. Inheritance
                                                1. One class can inherit the properties of another class. The employee class may inherit the person class, meaning employee objects does not have to rewrite code that deals with the name or age of a person.
                                                  1. If X is a class that is inherited by another class then it is referred to as a super class.
                                                    1. If X is a class that inherits from another class then it is referred to as being derived from the super class.
                                                    2. Unified Modeling Language
                                                      1. UML consists of a set of diagrams which are used to help plan and design the structure of a program using OOP.
                                                        1. There are several different diagrams that are a part of UML. We have to know 7 of these.
                                                          1. Class Diagrams
                                                              1. Name of the class
                                                                1. The facts (variables) that need to be known about any element belonging to the class and the data structure that will be used.
                                                                  1. The methods in the class that are used to access the facts (variables) inside of the class.
                                                                  2. Object Diagrams
                                                                        1. A specific student in the class student is referred to as an object. An object diagram therefore shows an individual students attributes
                                                                          1. This object diagrams refers to any member of the student class. It is referred to as an anonymous object
                                                                          2. Use Case Diagrams
                                                                              1. Use case diagrams show what is going into a system rather than how they work. The actors have control over the processes. These are generally more business oriented diagrams than programming related diagrams however they can help set the ground work.
                                                                              2. State Diagrams
                                                                                  1. State diagrams show how an object behaves through the various processes of a system. It starts with the initial circle to show the initial state. The arrows show the flow of activity from state to state. State transitions occur when a trigger occurs (such as the process find facts). The end of the system is shown by end points (a circle with a dot in) which are the red dots in the diagram above.
                                                                                  2. Sequence Diagrams
                                                                                      1. Sequence diagrams show how different classes interact with each other. At the top of the diagram are the classes. The dotted lines below the classes shows how long a class can be seen to be active, this is referred to as the lifeline of a class. The long thin boxes are where the are where the methods of the class have been activated to do something.
                                                                                      2. Activity Diagrams
                                                                                            1. Activity diagrams shows the activities needed to get an object to a particular state. In the exam the diagram will always have keys and so you don't have to remember the specifics of what symbols means what, you just have to be confident you can follow the logic.
                                                                                            2. Communication Diagrams
                                                                                                1. Communication diagrams show how classes interact with each other and the order that they interact with each other and the methods that they use to call each other.
                                                                                            3. Declarative
                                                                                              1. Program consists of a set of declarations.
                                                                                                1. Describes what computation should be performed and not how to do it.
                                                                                                  1. A language with clear correspondence to mathematical logic.
                                                                                                    1. Languages include: HTML, CSS, SVG
                                                                                                      1. Given a set of facts and a set of rules.
                                                                                                        1. Facts: Fruit(Cherry), Fruit(Strawberry), Vegetable(Parsnip), Vegetable(Carrot), Favourites(Strawberry), Favourites(Carrot)
                                                                                                          1. Rule: Fruit(X)
                                                                                                            1. Returns Cherry and Starwberry
                                                                                                            2. Rule: Fruit(X), Favourites(X)
                                                                                                              1. Returns Strawberry (as Cherry is not in favourites and Carrot is not in fruit)
                                                                                                                1. Example of Predicate Logic. In order for statement to be true it predicates both individual statements to be true.
                                                                                                            Show full summary Hide full summary

                                                                                                            Similar

                                                                                                            A level Computing Quiz
                                                                                                            Zacchaeus Snape
                                                                                                            Types and Components of Computer Systems
                                                                                                            Jess Peason
                                                                                                            Input Devices
                                                                                                            Jess Peason
                                                                                                            Output Devices
                                                                                                            Jess Peason
                                                                                                            Computing
                                                                                                            Kwame Oteng-Adusei
                                                                                                            Pack of playing cards answer
                                                                                                            Karl Taylor
                                                                                                            Code Challenge Flow Chart
                                                                                                            Charlotte Hilton
                                                                                                            Computing Hardware - CPU and Memory
                                                                                                            ollietablet123
                                                                                                            Computer Systems
                                                                                                            lisawinkler10
                                                                                                            Computer science quiz
                                                                                                            Ryan Barton
                                                                                                            Input, output and storage devices
                                                                                                            Mr A Esch