Key term
Eduqas A-Level Computer Science A500QS
Data Structures: Arrays, Records and Hash Tables
Stacks, Queues, Linked Lists and Trees
Boolean Logic and Simplification
Algorithms, Pseudo-Code and Programming Constructs
Variables, Scope, Parameters and Identifiers
Recursion and Modular Programming
Sorting Algorithms
Searching and Shortest-Path Algorithms
Big O Notation and Algorithm Efficiency
Validation, Verification and Testing
Data Compression
Programming Paradigms and Computer Languages
Topic overviewProgramming paradigms and where each is usedProcedural programmingEvent-driven and visual programmingMark-up languagesObject-oriented programming: objects, classes and methodsAmbiguity in natural language and the standardisation of languagesBackus-Naur form and syntax diagramsHigh-level and low-level languages, and choosing one
Systems Analysis, Maintenance and Documentation
Topic overviewWaterfall, Agile and approaches to systems developmentThe feasibility study, budgets and time scalesMethods of investigationAbstraction, decomposition and data flow diagramsSelecting suitable hardware and softwareAcceptance testing and methods of changeoverPerfective, adaptive and corrective maintenanceBackup and recovery proceduresUser and maintenance documentation
System Design and Human-Computer Interaction
Software Engineering Tools and Translators
Topic overviewSoftware tools for the software engineering processSoftware packages in analysis, specification, design and testingIntegrated development environmentsDebugging toolsProgram version managementCompilers, interpreters and assemblersThe stages of compilationTranslation errors and execution errors
Computing, Society and the Law
Computer Architecture, the Processor and Assembly Language
Topic overviewHardware elements and how they are connectedVon Neumann architecture and the stored program conceptThe processor: control unit, ALU and registersTypes of memory: RAM, ROM and virtual memoryCache memory and locality of referenceThe fetch-execute cycle and its registersParallel processing and the limits to parallelisationAssembly language and executing a program
Input, Output and Secondary Storage
Topic overviewInput devices and how data is capturedOutput devices and how results are presentedChoosing input and output devices for a situationVoice input, dictation and voice print recognitionMagnetic, optical and solid state storageComparing secondary storage for a purposeDisc organisation, fragmentation and defragmentation
Networks, Protocols and the Internet
Topic overviewNetworks, LANs and WANsNetwork topologies and connection hardwareNetworking standards and the layered modelIP addressing, TCP and UDPApplication protocols: HTTP, FTP, SMTP, IMAP and DHCPHandshaking and establishing a connectionWireless hardware and wireless technologiesThe internet and connected mobile devices
Data Transmission and Network Performance
Topic overviewSerial and parallel transmissionSimplex, half duplex and full duplexMultiplexing and sharing a channelCircuit, message and packet switchingPackets, headers and packet contentsNetwork collisions and collision detectionRouting traffic on a networkCalculating transfer rates and lowest cost routes
Number Systems and Binary Arithmetic
Data Types, Characters and Floating Point
Topic overviewPrimitive data typesStorage requirements for each data typeASCII and standardised character setsUnicode and multilingual encodingFloating point form: mantissa and exponentConverting between real numbers and floating pointInteger and floating point comparedTruncation, rounding and accuracy
Files, Records and File Organisation
Topic overviewThe purpose of files in data processingFiles, records and fieldsFixed and variable length fields and recordsMaster files and transaction filesSerial and sequential file accessIndexed sequential access and multi-level indexesDirect access and hashing algorithmsOverflow handling and file reorganisationFile security, backups, generations and archiving
Databases, Normalisation and Entity Modelling
SQL, Big Data and Distributed Systems
Topic overviewQuery languages and the purpose of SQLCreating tables: CREATE TABLE, data types and keysRetrieving data with SELECT, FROM and WHEREComparison operators, IN, AND, OR and sub-queriesSorting, grouping and aggregate functionsInserting, updating, deleting and joining dataThe DBMS, the data dictionary and distributed databasesBig Data, data warehousing, data mining and predictive analytics
The Operating System and Its Modes
Topic overviewThe need for an operating system and the role of the kernelManaging peripherals, processes and memory protectionThe user interface and the layers between user and hardwareDirectory structures and file attributesUtility softwareBatch processing, real time control and real time transaction systemsTypes of operating system: single-user, multi-user, multi-tasking and multi-programmingDesigning an interface for different users and environments
Interrupts, Memory Management and Scheduling
Topic overviewWhat causes an interruptInterrupt handling and the interrupt service routineInterrupt priorities and how they are allocatedPartitioning main memoryMethods of data transfer between processor and devicesBuffers and double bufferingHigh level scheduling, processor and device allocationProcess states, time-slicing, polling and threading
Types of Software System
Data Security, Cryptography and Attack
Topic overviewOnline updating and the integrity of shared filesDangers of holding personal dataClerical procedures, access levels, passwords and write protectionCryptography: its purpose, and symmetric and asymmetric keysHashing, digital signatures and certificatesCaesar and Vernam ciphers and comparing cipher strengthBiometric technologies and their limitationsThreats, damage and contingency planningMalicious software, hacking and penetration testing
Boolean Logic and Simplification
Truth tables for combined Boolean expressions
- 3 things to know
- Component 1
Overview
Building the table for an expression with several operators: 2ⁿ rows for n inputs, listed in binary counting order, with an intermediate column for each part of the expression.
What you need to know
Answer each one before you reveal it.
Your recallNot started
Numbers
How many rows are needed for a truth table with four inputs?
Key term
Why are intermediate columns useful in a truth table?
Questions from this subtopic
Each one with the model answer underneath.
- 1
How is a truth table built for a compound expression?
Model answer
The table lists every input combination and then adds a column for each intermediate term. The final column holds the value of the whole expression.
- 2
How many rows are needed for a truth table with four inputs?
Model answer
Four inputs need 16 rows. The row count doubles for each extra input, following 2ⁿ.
- 3
Why are intermediate columns useful in a truth table?
Model answer
An intermediate column records the value of one part of the expression. Errors are far easier to find than in a single long calculation.
- 4
In what order are input combinations normally listed?
Model answer
Input combinations are listed as a binary count upwards from all zeros. Every combination then appears exactly once.
- 5
State the value of A AND NOT B when A = 1 and B = 0.
Model answer
The output is 1. The inverse of B is 1, and 1 AND 1 gives 1.
- 6
State the value of NOT (A OR B) when A = 0 and B = 1.
Model answer
The output is 0. A OR B gives 1, and the inversion turns that into 0.
Other ways to work this
The same content, four other ways.
What is inside Levo
Six ways to work the same material.
Every question in Boolean Logic and Simplification, on a schedule.
Attempt a question from memory, write the correct version, then attempt it again. Levo records the jump between your first attempt and your last, and brings each question back on the day you are due to forget it.
Or £46 a year, about £3.83 a month. Cancel anytime.