Computing - Mind Map

Description

GCSE Computing Mind Map on Computing - Mind Map, created by Charlotte Hilton on 09/16/2016.
Charlotte Hilton
Mind Map by Charlotte Hilton, updated more than 1 year ago
Charlotte Hilton
Created by Charlotte Hilton over 9 years ago
4
0

Resource summary

Computing - Mind Map
  1. Flow Diagrams
    1. Rectangles present a process
      1. Diamonds present decisions that the program will make (Iteration)
        1. The parallelogram represents Data, this is inputs and outputs.
          1. The oval shape is to represent that terminator, the start and finish of the program.
          2. Python commands and other useless codey stuff
            1. Print ("Hello Again") will print what ever is in the speech marks to the user
              1. 'While' will create a loop that will finish after a condition if met, this is why it is a condition loop
                1. Always make sure to add : at the end of any orange commands etc in your code
                2. Stuff about variables
                  1. CamelCase Is when an identifier may contain capital letters that are not only used on the firtst letter, like FirstName or LastName (May user underscores as well eg: last_name)
                    1. Variables hold VALUES
                      1. Always make sure identifiers are accuratley named
                      2. Sorts
                        1. Merge Sorts
                          1. 1. If there is only one item in the list then stop 2. Divide the list in two parts. 3. Recursively divide these lists until the size f each becomes one 4. Recursively merge the lists with the items in the correct numerical order
                            1. When splitting an odd number
                          2. Searches
                            1. Linear Search
                              1. A linear search is a simple, sequential search. It starts at the beginning of the list and moves through the items, one by one, until it finds a matching value or reaches the end without finding one.
                              2. Binary Search
                                1. The binary search algorithm searches an ordered list to find an item by looking at the middle (median) item and comparing it with the search value.
                                2. Linear VS Binary
                                  1. How efficient are the algorithms? Suppose we have a sorted list of 100 items. For a linear search, the best case would be for the search item to be the first item of the list and so require only one comparison. The worst case would be for the item to be at the end of the list and so it would have to examine all of them and 100 comparisons would be needed. For a binary search, the best case would be for the search item to be the middle item of the list. The worst case would be for the item to be the last possible division, i.e. the median items selected could be: 51, 26, 13, 7, 4, 2, 1. Therefore in the worst case, the binary search would find the search item after only seven comparisons.
                                3. Data Type Stuff
                                  1. Opposite to a variable is a constant
                                    1. Integer is a whole number from 0 to infinity
                                      1. A Float is a number with numbers on either side of the decimal point
                                        1. A Real number is also a decimal but can contain values such as root 2 and integers
                                          1. String is a collection of letters
                                            1. Character is one singular letter or symbol
                                              1. Boolean is True or False
                                              Show full summary Hide full summary

                                              Similar

                                              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
                                              GCSE Computing - 4 - Representation of data in computer systems
                                              lilymate