Flashcards
Computational Thinking, Algorithms, Programming Fundamentals
Cards in this deck (25)
- 14 CornerstonesDecomposition
Pattern recognition
Abstraction
Algorithms - 2DecompositionBreaking down a complex problem or system into smaller, more manageable parts
- 3Pattern RecognitionLooking for similarities among and within problems
- 4AbstractionFocusing on the important information only, ignoring irrelevant detail
- 5AlgorithmsDeveloping a step-by-step solution to the problem, or the rules to follow to solve the problem
- 64 Cornerstones in Practisedentify inputs, processes and outputs for a problem
Make a structure diagram: problem at the top, identify key components, break down even further
Write algorithm in flowchart, pseudocode or reference language: identify common errors, trace tables - 7VariablesA value stored in memory that can change while the program is running:
Integer
Character
String
Real (float)
Boolean - 8IntegerWhole number
Positive/negative
Use only when arithmetic on the data is required
USE: total = total + score - 9CharacterA single alphanumeric
Use for menu or list choices
USE: choice = input (“Enter your choice from the menu:”) - 10StringMultiple alphanumeric characters
Use for words and telephone numbers
Default data type for inputs
USE: forename = “Craig” - 11Real (float)Number with a decimal part
Sometimes called a float
USE: cost = total + vat - 12BooleanValue that is true/false
In its simplest form, 1 or 0
USE: giving a final decision – go/no go scenario - 13ConstantsA value that does not change while the program is running
Assigned when the program is designed - 14Inputs & OutputsInput: a value is read from an input device eg. Keyboard
Output: data generated by the computer and displayed to the user - 15AssignmentsGiving a variable or constants a value
- 16Programming ConstructsSequences
Selection (branching)
Iteration (looping) - 17SequencesExecuting one instruction after the other
The most basic of programming
USE: solving smaller, simpler problems and minimal steps, good for blocking out the steps towards outcome - 18Selection (branching)A program that can have more than one potential outcome normally based on a condition
If and Else
USE: solving problems that require a choice, breaking down problems into sub-routines, allows 2 or more sequences to “appear” like they are running simultaneously - 19Iteration (looping)Loop/while (for loops)
USE: problem solving repetitive issues, repeats sequences of code without having it all typed out, saves data space and keeps coding visually neat
For loop is an iteration that will loop for a set amount of times - 20Arithmetic OperatorsAdding [+]
Subtracting [-]
Multiplying [*]
Dividing [/]
Finding something to the power of [**]
Integer division [//]
Remainder division [%] - 21Comparison OperatorsEqual to [==]
Not equal to [!=]
Less than [<]
Less than or equal to [<=]
Greater than [>]
Greater than or equal to [>=] - 22Logic GatesEach Boolean operator has its own logic gate
These logic gates take a binary input, apply the Boolean operation to give a binary output
Logic diagrams are often drawn to show logic gates and circuits - 23NOT GatesNOT gates take a single input and gives a single output.
The output will always be the opposite value to the input.
NOT gate notation: ¬A - 24AND GatesAND gates will take two inputs and give one output.
Both inputs need the binary value to 1 to give an output to 1.
If one or both the inputs are binary value 0, the output is also 0.
AND gate notation: A ∧ V - 25OR GatesOR gates take two inputs ang give one output, just like the AND gate.
However, the OR gate only requires one input to be binary value 1 to output 1.
If both inputs are binary value 0, this gate gives 0.
OR gate notation: A V B
Information
- Description
- GCSE Computing Flashcards on Computational Thinking, Algorithms, Programming Fundamentals, created by Samndeep _B on 24/02/2021.
- Created by
- Samndeep _B
- Views
- 36
- Rating