Unit 01 - Principles of Computer Science Flashcards
What is Encryption?
Encryption is the process of encoding a message so that it can be read only by the sender and the intended recipient.
What is a do until loop in Pseudocode?
do
code
until
condition
What does the word NOT in Pseudocode do?
reverses the outcome of the expression
What is the Byte Scale?
bit, nibble, byte, kilobyte, mega, giga, tera, peta, exa, zetta, yotta
Multiple by 1024 to move up
What is the method of capturing data (Manual)?
Paper data capture form (read by OCR & OMR or typed in manually)
What is the purpose of operating systems when managing external devices?
Using device drivers to translate operating system instructions into those understood by specific models of hardware device
How are character sets used to represent text?
When character in the set has a corresponding binary value which is a set number of bits. These are stored in a sequence that represents a word etc.
What is a clock used for?
To synchronise the change of state of flip flop circuits.
What is the definition of a variable?
It is the named locations that store data in which the contents can be changed during program execution.
What is a local variable?
It is declared inside a function. They can only be accessed and used in that function.
Decomposition
Identifying and describing problems and processes.
Breaking down problems and processes into distinct steps.
Describing problems and processes as a set of structured steps.
Communicating the key features of problems and processes to others.
Pattern recognition
Identifying common elements or features in problems or systems.
Identifying and interpreting common differences between processes or problems.
Identifying individual elements within problems.
Describing patterns that have been identified.
Making predictions based on identified patterns.
Pattern generalisation and abstraction
Identifying information that is necessary to solve an identified problem.
Filtering out information that is not needed to solve an identified problem.
Representing parts of a problem or system in general terms by identifying:
variables
constants
key processes
repeated processes
inputs
outputs.
Algorithm design
Describing a step-by-step strategy to solve a problem.
Pattern Generalisation
B, A, A
Algorithms
C, J, C
M, N
Pattern Recognition
K, H
Decomposition
A, G
Structured English (pseudocode)
Produce, apply and interpret pseudocode statements to describe computing tasks or processes and
solve problems.
Interpreting pseudocode
Apply processes to calculate outcomes
evaluate the structure and logic of given code against given requirements
suggest improvements to logical structures and processes.
Developing pseudocode
Improve the effectiveness and efficiency of code
identify and fix errors within code.
Producing pseudocode – learners must be familiar with the listed terms and their application. Unfamiliar pseudocode will be given with definitions for application in the examination context:
Sequence
Structure:
Hierarchy
Indentation
Operations: BEGIN END INPUT OUTPUT PRINT READ WRITE
Decisions: IF THEN ELSE ELSEIF (ELIF) WHEN
Repetition: FOR REPEAT UNTIL WHILE WHILE NOT.
Programming paradigms
Use of standard structures and conventions to build and develop accurate, efficient and effective computer code to fulfil identified criteria and solve problems.
Handling data within a program
Selecting, applying, using and interpreting common data-handling techniques and structures
provided within programming languages to process data.
Defining and declaring constants and variables: alphanumeric strings Arrays Boolean Characters date/time floating point (real) Integers Objects Records Sets Strings.
Managing variables:
local and global variables
naming conventions.
