2.2 Programming V1

Variables: Inputs, Outputs and Assignments
1. Variable - Changes throughout the program
2. Constant - Fixed for the duration of the program
  1. Normally in CAPITAL letters
    1. In capitals to simplify debugging and are less likely to generate mistakes as they don'tchange during runtime
3. RAM is divided in memory locations with long hexadecimal (but really binary) addresses
4. A grid of memory locations (or cells) can hold values
5. Inputs
  1. Programs would be useless without inputs as they can't interact with the outside world and always produce the same results
Selection
1. Allows a computer to "think" - make decisions
2. Changes the flow of a program, depending on a set of conditions, it is used for validation, calculation and making sense of a user's choices
3. Nested Selection
  1. Sometimes, we can only evaluate a condition if some pre-condition is met. We would need two selection statements, one inside the other
  2. The "outside" selection is the pre-condition, while the "inside" selection is the conditon
  3. There is no limit on how many selection statements we can nest
Iteration
1. For Counter (Counter-controlled)
  1. The loop for when we know in advance how many times we want to loop back to the start, so we keep count against the number of repetitions that are required using a counter
2. While Loop (Condition-controlled)
  1. Loops until the condition is met/changes
  2. Better for user interfaces
3. Repetition of a process
Operators
1. Represents the operations that are performed on the data
2. Arithmetic Operators
  1. + - Addition
  2. - - Subtraction
  3. * - Multiplication
  4. / - Division
  5. MOD - Modulus (Remainder) e.g.12 MOD 5 = 2
  6. DIV - Ouotient e.g. 17 DIV 5 = 3
  7. ^ - Exponentiation (To the power of)
3. Comparison Operators
  1. == - Equal to
  2. != - Not equal to
  3. < - Less than
  4. > - Greater than
  5. <= - Less than or equal to
  6. >= - Greater than or equal to
4. Logical Operators (Only used in Booleans)
  1. AND - Two conditions must be met for the statement to be true
  2. OR - At least one condition must be met for the statement to be true
  3. NOT - Inverts the results e.g. NOT(A and B) will only be false when both A and B are true
5. String Operators
  1. .upper - UPPERCASE
  2. .lower - lowercase
  3. .length - Number of characters in a string (including spaces)
  4. .substring (x,y) - Part of a string
Sequencing
1. Allows a programmer to solve complex tasks through a number of simple steps
2. Benefits
  1. Each line follows the next
  2. Create simple programs very quickly
  3. Easy to follow for a small program
  4. Fundamental prinicipal of a prgram
    1. Starts at the top, finishes at the bottom
3. Disadvantages
  1. Not at all efficient
  2. Becomes very difficult to follow with large problems
  3. Extremely hard to maintain
SQL (Standard Query Language)
1. Progranmming languague used to work with databases
2. Can be run from a special window in a database package
3. SELECT - SQL Keyword
  1. Accomplishes searching and reading simultaneously, separates keywords from names and criteria
  2. Nested SELECT
    1. Multi-stage filtering e.g. finding all pupils in a set with the first select and then just retrieve those who get over 80 in results
    2. Particularly useful in multi-table databases
Arrays
1. An ordered collection of related data where each element is accessible by a number, known as an index
  1. Advantages
    1. Good for ease of iterating through an array - allows us to manipulate multiple times of data with very few lines of code,replacing may separate variables
    2. Non-sequential nature - can jump between non-neighbouring elements instantly without having to browse through the whole array
2. Usually have fixed sizes and occupy a fixed (static) amount of memory
3. Begins with 0
Sub Programs
1. Can be used to save time and simplify the code. Main types of sub programs are procedures and functions
2. When you want your program to repeat in different places, you only need to call the name of the subprogram, saving time & simplifying the code by avoiding repetition of code
3. Procedures are sets of instructions stored under one name (identifier) e.g. Prodecure name () -> 'Coding' -> End Prodecure
4. Functions are similar to procedures but always return a value to the main program

Nächster

2.2 Programming V1

Beschreibung

Zusammenfassung der Ressource

ähnlicher Inhalt

	Erstellt von 2402 2003 vor fast 6 Jahre