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
Data Structures: Arrays, Records and Hash Tables
- 7 subtopics
- 21 things to know
- Component 1
What Data Structures: Arrays, Records and Hash Tables covers
Data Structures: Arrays, Records and Hash Tables is examined in Component 1, Programming and System Development. It covers one-dimensional arrays and indexing, two- and three-dimensional arrays, Manipulating arrays: insertion, deletion and searching, records and fields, arrays of records and record manipulation, hash tables, hashing and collisions and choosing and justifying a data structure.
The 7 subtopics
Each one has its own page.
- One-dimensional arrays and indexingIndex in an array, why an array is described as a random access structure and traversing an array.Open →
- Two- and three-dimensional arraysTwo-dimensional array, three-dimensional array and row-major order.Open →
- Manipulating arrays: insertion, deletion and searchingFlag value used for when deleting from an array, how the largest value in an array is found and initialising an array.Open →
- Records and fieldsTerm field, what happens when one field of a record is updated and record used in a school system.Open →
- Arrays of records and record manipulationArray of records and updating a record held in an array.Open →
- Hash tables, hashing and collisionsHash table, term hashing algorithm and term collision.Open →
- Choosing and justifying a data structureThe questions that settle it — how the data is reached, whether the size is known, what order items must leave in — worked through for stacks, queues, arrays, linked lists and hash tables.Open →
What you need to know
Answer each one before you reveal it.
Your recallNot started
Key term
Compare the two ways a hash table deals with a collision.
Key term
What is an array?
Key term
What is a two-dimensional array?
Key term
Describe how a new value is inserted into the middle of an ordered array.
Key term
What is an array of records?
Key term
What questions decide which data structure suits a problem?
Key term
Why must every element of an array share the same data type?
Numbers
How many elements does a two-dimensional array of 10 rows and 20 columns hold?
Key term
Why is insertion into an array an expensive operation?
Key term
What is a record?
Key term
How is one field of one record inside an array referenced?
Key term
What is a hash table?
Process
Which structure suits data that must be processed last in, first out?
Key term
What is an index in an array?
Key term
What is a three-dimensional array?
Key term
Describe how an element is deleted from the middle of an array.
Key term
How does a record differ from an array?
Key term
Describe how a new record is added to an unordered array of records.
Key term
Define the term hashing algorithm.
Process
Which structure suits data that must be processed in order of arrival?
Take Data Structures: Arrays, Records and Hash Tables further
The same content, four other ways.
Commonly confused
Pairs that lose marks when they are blurred together.
Array vs Record
Array: holding one data type and being reached by index. Record: holding several data types and being reached by field name.
Index vs Element
Index: the position number. Element: the value stored at that position.
Open addressing vs Chaining
Open addressing: putting the clashing record in another slot of the table. Chaining: hanging it on a linked list at the original index.
Questions from this topic
Each one with the model answer underneath.
- 1
What is an array?
Model answer
An array is an ordered set of data items of the same data type stored under one identifier. Each item is reached by its index.
- 2
Why must every element of an array share the same data type?
Model answer
A shared data type gives every element the same size in memory. The address of an element can then be calculated from its index.
- 3
What is an index in an array?
Model answer
An index is the position number that identifies one element of an array. The index is written in brackets after the identifier.
- 4
State the number of elements in an array declared with indices 0 to 9.
Model answer
The array holds ten elements. Index 0 counts as the first of them.
- 5
What does it mean to say an array is static?
Model answer
A static array has its size fixed when the program is written. The number of elements cannot change while the program runs.
- 6
Give one advantage of using an array rather than a set of separate variables.
Model answer
An array lets a loop process every value with one line of code. One identifier replaces many separate variable names.
What is inside Levo
Six ways to work the same material.
Data Structures: Arrays, Records and Hash Tables revision questions
- What does Data Structures: Arrays, Records and Hash Tables cover in Eduqas A-Level Computer Science?
- 7 subtopics: one-dimensional arrays and indexing, two- and three-dimensional arrays, manipulating arrays: insertion, deletion and searching, records and fields, arrays of records and record manipulation, hash tables, hashing and collisions and choosing and justifying a data structure. Each one has its own page with questions and model answers.
- How is Data Structures: Arrays, Records and Hash Tables organised?
- By the Eduqas A500QS specification, subtopic by subtopic, so it matches the order you are taught it in.
Every question in Data Structures: Arrays, Records and Hash Tables, 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.