Questions: Computer Science Essentials: practice exam B
New numbers every time.
About this practice exam
- Abstraction: what to leave outIdentify, 1 mark, Plus
- Binary search: the most comparisonsState, 1 mark, Plus
- Which list can binary search use?Identify, 1 mark, Plus
- Why binary search needs a sorted listExplain, 1 mark, Plus
- Bubble sort: which statement is true?Identify, 1 mark, Plus
- Bubble sort: swaps in a passState, 1 mark, Plus
- Which technique is this?Identify, 1 mark, Plus
- Computational thinking wordsIdentify, 1 mark, Plus
- Efficiency: which statement is true?Identify, 1 mark, Plus
- Flowchart symbolsState, 1 mark, Plus
- Insertion sort: items movedState, 1 mark, Plus
- Input, process, outputIdentify, 1 mark, Plus
- Linear search: comparisonsState, 1 mark, Plus
- What does this program output?State, 1 mark, Plus
- Linear or binary search?Choose, 1 mark, Plus
- Which sorting algorithm?Identify, 1 mark, Plus
- Which sort is it?Identify, 1 mark, Plus
- Circuit: the output, 2 inputsState, 1 mark, Plus
- Circuit: the output, 3 inputsState, 1 mark, Plus
- Boolean logic in codeState, 1 mark, Plus
- Equivalent expressionsIdentify, 1 mark, Plus
- Expression: the output, 2 inputsState, 1 mark, Plus
- Expression: the output, 3 inputsState, 1 mark, Plus
- Logic gates: factsIdentify, 1 mark, Plus
- Truth tables and circuits: factsIdentify, 1 mark, Plus
- Which gate has this truth table?Identify, 1 mark, Plus
- Output of one gateState, 1 mark, Plus
- How many gates?State, 1 mark, Plus
- Which expression matches the truth table? (2 inputs)Identify, 1 mark, Plus
- Which expression matches the truth table? (3 inputs)Identify, 1 mark, Plus
- Find the missing gateIdentify, 1 mark, Plus
- NAND and NORIdentify, 1 mark, Plus
- Logic notationIdentify, 1 mark, Plus
- How many rows?State, 1 mark, Plus
- Choose the circuit for a systemIdentify, 1 mark, Plus
- Does the system switch on?State, 1 mark, Plus
- Gate symbolsIdentify, 1 mark, Plus
- Two gates in a rowState, 1 mark, Plus
- Which inputs give Q = 1?Identify, 1 mark, Plus
- Circuit: the output, 3 inputsState, 1 mark, Plus
- Binary search: first item and comparisonsState, 2 marks, Plus
- Binary search: the items comparedWrite down, 2 marks, Plus
- Binary search on wordsWrite down, 2 marks, Plus
- Bubble sort: the first passWrite down, 2 marks, Plus
- Bubble sort into descending orderWrite down, 2 marks, Plus
- Bubble sort: a later passWrite down, 2 marks, Plus
- Bubble sort: when is it sorted?State, 2 marks, Plus
- Bubble sort on wordsWrite down, 2 marks, Plus
- Insertion sort: after some passesWrite down, 2 marks, Plus
- Merge sort: the first splitWrite down, 2 marks, Plus
- Merge two sorted listsWrite down, 2 marks, Plus
- Follow an algorithm written as stepsCalculate, 2 marks, Plus
- Reading a structure diagramState, 2 marks, Plus
- Adding to a structure diagramIdentify, 2 marks, Plus
- Worst cases for searchingState, 2 marks, Plus
- Write the expression for a circuit, 2 inputsWrite, 2 marks, Plus
- Write the expression for a circuit, 3 inputsWrite, 2 marks, Plus
- Truth table for a circuit, 2 inputsComplete, 2 marks, Plus
- How many rows give Q = 1?State, 2 marks, Plus
- Explain XORExplain, 2 marks, Plus
- Truth table for an expression, 2 inputsComplete, 2 marks, Plus
- Truth table of one gateComplete, 2 marks, Plus
- Truth table for a real systemComplete, 2 marks, Plus
- Simplify an expressionSimplify, 2 marks, Plus
- Expression: one row step by stepComplete, 2 marks, Plus
- Write an expression from a truth tableWrite, 2 marks, Plus
- Write the expression for a circuit, 3 inputsWrite, 2 marks, Plus
- Find and fix the bugIdentify, 2 marks, Plus
- Trace tables and subroutines: ideasIdentify, 2 marks, Plus
- Follow a flowchart with decisionsState, 2 marks, Plus
- Complete a flowchart: the decisionComplete, 2 marks, Plus
- Complete a flowchart: a missing boxComplete, 2 marks, Plus
- Which flowchart symbol?Identify, 2 marks, Plus
- Spot the wrong symbolIdentify, 2 marks, Plus
- How many times does a nested loop run?Calculate, 2 marks, Plus
- Following function callsCalculate, 2 marks, Plus
- Searching for an item that is not thereState, 3 marks, Plus
- Complete a binary searchComplete, 3 marks, Plus
- Bubble sort: complete the tableComplete, 3 marks, Plus
- Bubble sort: passes, swaps and comparisonsState, 3 marks, Plus
- Comparisons as the list growsComplete, 3 marks, Plus
- Insertion sort: complete the tableComplete, 3 marks, Plus
- Merge sort: merging back upWrite down, 3 marks, Plus
- Truth table for a circuit, 3 inputsComplete, 3 marks, Plus
- Truth table for an expression, 3 inputsComplete, 3 marks, Plus
- Write an expression for a real systemWrite, 3 marks, Plus
- Truth table for an expression, 3 inputsComplete, 3 marks, Plus
- An array changed by a loopComplete, 3 marks, Plus
- Follow a flowchart with a loopCalculate, 3 marks, Plus
- Output of nested loopsState, 3 marks, Plus
- What does the function return?Calculate, 3 marks, Plus
- Explain a binary searchExplain, 4 marks, Plus
- Describe a merge sortDescribe, 4 marks, Plus
- Search timeCalculate, 4 marks, Plus
- Trace a linear searchComplete, 4 marks, Plus
- Trace table: a while loop over an arrayComplete, 4 marks, Plus
- Binary arithmetic: factsIdentify, 1 mark, Plus
- Binary to denaryConvert, 1 mark, Plus
- Binary to hexadecimalConvert, 1 mark, Plus
- Bits needed for some valuesCalculate, 1 mark, Plus
- Character sets: factsIdentify, 1 mark, Plus
- Colour depth and coloursCalculate, 1 mark, Plus
- Compression: factsIdentify, 1 mark, Plus
- Denary to binaryConvert, 1 mark, Plus
- Bases and units: factsIdentify, 1 mark, Plus
- Hexadecimal to binaryConvert, 1 mark, Plus
- Images: factsIdentify, 1 mark, Plus
- Binary units: kibibytes and mebibytesCalculate, 1 mark, Plus
- Compare values in different basesIdentify, 1 mark, Plus
- Limits of a fixed number of bitsIdentify, 1 mark, Plus
- Largest number in n bitsState, 1 mark, Plus
- Decimal and binary prefixesIdentify, 1 mark, Plus
- Decode run length encodingWrite down, 1 mark, Plus
- Sound: factsIdentify, 1 mark, Plus
- Two's complement: which is negative?Identify, 1 mark, Plus
- Units of dataCalculate, 1 mark, Plus
- Binary additionCalculate, 2 marks, Plus
- Adding three binary numbersCalculate, 2 marks, Plus
- Character codes in binaryConvert, 2 marks, Plus
- Arithmetic right shift on two's complementCalculate, 2 marks, Plus
- 16-bit binary to hexadecimalConvert, 2 marks, Plus
- A black and white bitmapWrite down, 2 marks, Plus
- Denary to hexadecimalConvert, 2 marks, Plus
- Denary to two's complementConvert, 2 marks, Plus
- Hex colour codesCalculate, 2 marks, Plus
- Hexadecimal to denaryConvert, 2 marks, Plus
- Decode a Huffman codeWrite down, 2 marks, Plus
- Image size backwardsCalculate, 2 marks, Plus
- Image file sizeCalculate, 2 marks, Plus
- Image size in kibibytesCalculate, 2 marks, Plus
- Binary addition with overflowCalculate, 2 marks, Plus
- Sample intervalCalculate, 2 marks, Plus
- Binary shiftsCalculate, 2 marks, Plus
- Shifts that lose bitsCalculate, 2 marks, Plus
- Sound file sizeCalculate, 2 marks, Plus
- Sound: how long is the recording?Calculate, 2 marks, Plus
- Adding two's complement numbersCalculate, 2 marks, Plus
- Overflow in two's complementCalculate, 2 marks, Plus
- Two's complement rangeState, 2 marks, Plus
- Two's complement to denaryConvert, 2 marks, Plus
- Storing textCalculate, 2 marks, Plus
- Huffman codingCalculate, 3 marks, Plus
- Run length encodingWrite down, 3 marks, Plus
- Subtraction with two's complementCalculate, 3 marks, Plus
- Assembly language: factsIdentify, 1 mark, Plus
- Assembly: the missing instructionIdentify, 1 mark, Plus
- AssemblersIdentify, 1 mark, Plus
- Compiler or interpreter?Identify, 1 mark, Plus
- What happens when you compileIdentify, 1 mark, Plus
- How many instructions?State, 1 mark, Plus
- Find the syntax errorIdentify, 1 mark, Plus
- Syntax or logic error? (code)Identify, 1 mark, Plus
- Syntax, logic or run-time error?Identify, 1 mark, Plus
- IDE featuresIdentify, 1 mark, Plus
- Why use an IDE?Identify, 1 mark, Plus
- Output before an interpreter stopsWrite down, 1 mark, Plus
- High-level and low-level languagesIdentify, 1 mark, Plus
- Libraries and reuseIdentify, 1 mark, Plus
- Bits needed for the opcodeCalculate, 1 mark, Plus
- Portability and translationIdentify, 1 mark, Plus
- Run-time errorsIdentify, 1 mark, Plus
- Translators: factsIdentify, 1 mark, Plus
- Which translator?Identify, 1 mark, Plus
- Which kind of code is this?Identify, 1 mark, Plus
- Clock speedCalculate, 1 mark, Plus
- Cloud storageIdentify, 1 mark, Plus
- Parts of the CPUIdentify, 1 mark, Plus
- Time for one clock cycleCalculate, 1 mark, Plus
- Embedded systemsIdentify, 1 mark, Plus
- The fetch-execute cycle in orderComplete, 1 mark, Plus
- File and user managementIdentify, 1 mark, Plus
- The boot process and cacheIdentify, 1 mark, Plus
- Hardware or software?Identify, 1 mark, Plus
- Hertz, megahertz and gigahertzConvert, 1 mark, Plus
- Magnetic, optical or solid state?Identify, 1 mark, Plus
- Fetch-execute: the missing instructionIdentify, 1 mark, Plus
- Operating system functionsIdentify, 1 mark, Plus
- Which job of the operating system?Identify, 1 mark, Plus
- What affects CPU performance?Identify, 1 mark, Plus
- RAM and ROMIdentify, 1 mark, Plus
- RegistersState, 1 mark, Plus
- Audit trails and code reviewsIdentify, 1 mark, Plus
- Making software robustIdentify, 1 mark, Plus
- System or application software?Identify, 1 mark, Plus
- Storage characteristicsIdentify, 1 mark, Plus
- Choosing storageIdentify, 1 mark, Plus
- User interfacesIdentify, 1 mark, Plus
- Utility softwareIdentify, 1 mark, Plus
- Virtual memoryIdentify, 1 mark, Plus
- Assembly: the accumulator after each lineComplete, 2 marks, Plus
- Run an assembly programState, 2 marks, Plus
- Decode a machine code instructionWrite down, 2 marks, Plus
- Why assembly for embedded systems?Explain, 2 marks, Plus
- Write an instruction in machine codeWrite down, 2 marks, Plus
- Explain why translation is neededExplain, 2 marks, Plus
- Decode a hexadecimal instructionWrite down, 2 marks, Plus
- Machine code in hexadecimalWrite down, 2 marks, Plus
- Compiler or interpreter tableComplete, 2 marks, Plus
- Fetch-execute: the ACC after each instructionComplete, 2 marks, Plus
- The address busCalculate, 2 marks, Plus
- How many files fit?Calculate, 2 marks, Plus
- Fetch-execute: during a fetchState, 2 marks, Plus
- Instructions per secondCalculate, 2 marks, Plus
- Fetch-execute: MAR and MDR during executeState, 2 marks, Plus
- What fits in RAM?Calculate, 2 marks, Plus
- How long does a task take?Calculate, 2 marks, Plus
- Copying timeCalculate, 2 marks, Plus
- How much virtual memory?Calculate, 2 marks, Plus
- Decode a short machine code programWrite down, 3 marks, Plus
- Where does each translator stop?State, 3 marks, Plus
- Explain how an IDE helpsExplain, 3 marks, Plus
- Assemble a short programComplete, 3 marks, Plus
- Run a machine code programState, 3 marks, Plus
- Opcodes and addressesCalculate, 3 marks, Plus
- Use a trace to find a logic errorState, 3 marks, Plus
- Choose translators for a teamComplete, 3 marks, Plus
- Fetch-execute: the accumulatorState, 3 marks, Plus
- BackupsCalculate, 3 marks, Plus
- Which CPU is faster for this task?Calculate, 3 marks, Plus
- Sharing work between coresCalculate, 3 marks, Plus
- Cost per gigabyteCalculate, 3 marks, Plus
- Explain audit trails and code reviewsExplain, 3 marks, Plus
- Why more RAM helpsExplain, 3 marks, Plus
- Hard disk or SSD: reading timeCalculate, 3 marks, Plus
- High-level against low-levelCompare, 4 marks, Plus
- How the OS handles memory and multitaskingExplain, 4 marks, Plus
- Fetch-execute: register tableComplete, 4 marks, Plus
- What kind of address is this?Identify, 1 mark, Plus
- IP and MAC addressesIdentify, 1 mark, Plus
- Bus topologyIdentify, 1 mark, Plus
- Choosing network hardwareIdentify, 1 mark, Plus
- Client-server and peer-to-peerIdentify, 1 mark, Plus
- Visiting a website, in orderComplete, 1 mark, Plus
- Email protocolsIdentify, 1 mark, Plus
- Ethernet, Wi-Fi and WLANsIdentify, 1 mark, Plus
- Network hardwareIdentify, 1 mark, Plus
- What is in a packet?Identify, 1 mark, Plus
- The internet, DNS and hostingIdentify, 1 mark, Plus
- How many addresses?Calculate, 1 mark, Plus
- A valid IPv4 addressIdentify, 1 mark, Plus
- LAN or WAN?Identify, 1 mark, Plus
- Which TCP/IP layer?Identify, 1 mark, Plus
- Layers: why use them?Identify, 1 mark, Plus
- A valid MAC addressIdentify, 1 mark, Plus
- Keeping a network secureIdentify, 1 mark, Plus
- Ethical hacking, access control and physical securityIdentify, 1 mark, Plus
- Choose a network security methodIdentify, 1 mark, Plus
- How many packets?Calculate, 1 mark, Plus
- Packet switchingIdentify, 1 mark, Plus
- PANs and BluetoothIdentify, 1 mark, Plus
- What affects network performance?Identify, 1 mark, Plus
- Which protocol?Identify, 1 mark, Plus
- Putting packets back in orderWrite down, 1 mark, Plus
- Standards and encryptionIdentify, 1 mark, Plus
- Star and mesh topologiesIdentify, 1 mark, Plus
- Counting connectionsCalculate, 1 mark, Plus
- Bits per secondConvert, 1 mark, Plus
- Wi-FiIdentify, 1 mark, Plus
- Wired or wireless?Identify, 1 mark, Plus
- Counting cables in a busCalculate, 2 marks, Plus
- An IP address in binaryConvert, 2 marks, Plus
- A MAC address pair in binaryConvert, 2 marks, Plus
- Packet headersCalculate, 2 marks, Plus
- How much data in a time?Calculate, 2 marks, Plus
- Transfer timeCalculate, 2 marks, Plus
- Transfer times tableComplete, 2 marks, Plus
- Compare two connectionsCalculate, 3 marks, Plus
- Latency plus transfer timeCalculate, 3 marks, Plus
- Sharing bandwidthCalculate, 3 marks, Plus
- StreamingCalculate, 3 marks, Plus
- AccessibilityIdentify, 1 mark, Plus
- Artificial intelligence and decisionsIdentify, 1 mark, Plus
- AI and robots: which issue?Identify, 1 mark, Plus
- Artificial intelligence, machine learning and robotsIdentify, 1 mark, Plus
- Computer Misuse Act offencesIdentify, 1 mark, Plus
- The Computer Misuse ActIdentify, 1 mark, Plus
- Is this use of someone else's work allowed?Identify, 1 mark, Plus
- Copyright and licencesIdentify, 1 mark, Plus
- Cultural and social issuesIdentify, 1 mark, Plus
- Data protectionIdentify, 1 mark, Plus
- Environmental impactsIdentify, 1 mark, Plus
- Ethical issuesIdentify, 1 mark, Plus
- Greener computingIdentify, 1 mark, Plus
- Copyright and patentsIdentify, 1 mark, Plus
- Trademarks and licensingIdentify, 1 mark, Plus
- Copyright, patent, trademark or licence?Identify, 1 mark, Plus
- Open source or proprietary for this user?Identify, 1 mark, Plus
- Is it personal data?Identify, 1 mark, Plus
- Which data protection principle is broken?Identify, 1 mark, Plus
- PrivacyIdentify, 1 mark, Plus
- Privacy and the security servicesIdentify, 1 mark, Plus
- Data subject rightsIdentify, 1 mark, Plus
- Who is affected?Identify, 1 mark, Plus
- Monitoring and surveillanceIdentify, 1 mark, Plus
- Issues raised by new technologiesIdentify, 1 mark, Plus
- Technology and wellbeingIdentify, 1 mark, Plus
- Which law is broken?Identify, 1 mark, Plus
- User access levelsIdentify, 1 mark, Plus
- Anti-malware and backupsIdentify, 1 mark, Plus
- Which attack is this?Identify, 1 mark, Plus
- Attacks: factsIdentify, 1 mark, Plus
- Biometrics and physical securityIdentify, 1 mark, Plus
- Caesar cipher: find the keyCalculate, 1 mark, Plus
- Email confirmations, CAPTCHA and automatic updatesIdentify, 1 mark, Plus
- Encryption: factsIdentify, 1 mark, Plus
- One more characterCalculate, 1 mark, Plus
- Kinds of authentication factorIdentify, 1 mark, Plus
- Firewall rulesIdentify, 1 mark, Plus
- Interception and networksIdentify, 1 mark, Plus
- Types of malwareIdentify, 1 mark, Plus
- What did the malware do?Identify, 1 mark, Plus
- Insider or external penetration test?Identify, 1 mark, Plus
- Spotting a phishing emailIdentify, 1 mark, Plus
- Which password meets the policy?Identify, 1 mark, Plus
- Security policiesIdentify, 1 mark, Plus
- Match a threat to a defenceIdentify, 1 mark, Plus
- Protecting a systemIdentify, 1 mark, Plus
- Social engineeringIdentify, 1 mark, Plus
- Defending against social engineeringIdentify, 1 mark, Plus
- Which input is suspicious?Identify, 1 mark, Plus
- Threats: factsIdentify, 1 mark, Plus
- How systems are left openIdentify, 1 mark, Plus
- Carbon emissionsCalculate, 2 marks, Plus
- The yearly cost of a deviceCalculate, 2 marks, Plus
- Energy used by a deviceCalculate, 2 marks, Plus
- E-waste recycledCalculate, 2 marks, Plus
- Saving energy by switching offCalculate, 2 marks, Plus
- Running a server roomCalculate, 2 marks, Plus
- Standby powerCalculate, 2 marks, Plus
- Breaking a Caesar cipherCalculate, 2 marks, Plus
- Caesar cipher: decryptWrite down, 2 marks, Plus
- Caesar cipher: encryptWrite down, 2 marks, Plus
- Caesar cipher: two wordsWrite down, 2 marks, Plus
- Caesar cipher: wrapping roundWrite down, 2 marks, Plus
- How many possible passwords?Calculate, 2 marks, Plus
- Codes made of letters and digitsCalculate, 2 marks, Plus
- Guesses needed per secondCalculate, 2 marks, Plus
- Account lockoutCalculate, 2 marks, Plus
- A password check in codeState, 2 marks, Plus
- SQL injectionWrite down, 2 marks, Plus
- Password strength tableComplete, 2 marks, Plus
- Spot the weak pointIdentify, 2 marks, Plus
- Computer Misuse Act: match the offencesComplete, 3 marks, Plus
- The cost of electricityCalculate, 3 marks, Plus
- Explain the digital divideExplain, 3 marks, Plus
- Energy tableComplete, 3 marks, Plus
- Explain the problem of e-wasteExplain, 3 marks, Plus
- Match situations to lawsComplete, 3 marks, Plus
- Keeping a device for longerCalculate, 3 marks, Plus
- How long would a brute force attack take?Calculate, 3 marks, Plus
- Explain two-factor authenticationExplain, 3 marks, Plus
- Explain penetration testingExplain, 3 marks, Plus
- Explain how phishing worksExplain, 3 marks, Plus
- Explain data protection dutiesExplain, 4 marks, Plus
- Open source or proprietary?Compare, 4 marks, Plus
- Explain SQL injection and how to stop itExplain, 4 marks, Plus
- Explain weak points and how to close themExplain, 4 marks, Plus
- Complete the return lineComplete, 2 marks, Plus
- Fix the comparisons at the limitsFix, 2 marks, Plus
- Fix input that was never convertedFix, 2 marks, Plus
- Fix a loop that runs the wrong number of timesFix, 2 marks, Plus
- Fix two syntax errorsFix, 2 marks, Plus
- A function that returns a valueWrite, 2 marks, Plus
- A function using DIV and MODWrite, 2 marks, Plus
- Slice the ends of a stringWrite, 2 marks, Plus
- Read one field from a recordWrite, 2 marks, Plus
- Initials from a nameWrite, 2 marks, Plus
- A length checkWrite, 2 marks, Plus
- A range checkWrite, 2 marks, Plus
- Total or mean of a listWrite, 2 marks, Plus
- Fix the indexes in a 2D listFix, 3 marks, Plus
- Complete nested loops over a 2D listComplete, 3 marks, Plus
- Replace a fixed value with a parameterAmend, 3 marks, Plus
- Complete a main program that calls subroutinesComplete, 3 marks, Plus
- Fix a running total and a countFix, 3 marks, Plus
- Fix a check that uses AND where it needs ORFix, 3 marks, Plus
- Fix a return in the wrong placeFix, 3 marks, Plus
- Complete a procedure that prints a lineComplete, 3 marks, Plus
- Select records from a listComplete, 3 marks, Plus
- Records ready to write to a fileComplete, 3 marks, Plus
- Build a code from parts of stringsComplete, 3 marks, Plus
- Amend a function that counts charactersAmend, 3 marks, Plus
- Tidy the capitals in a stringComplete, 3 marks, Plus
- Complete a function with the math libraryComplete, 3 marks, Plus
- Complete a validation subroutineComplete, 3 marks, Plus
- Check a login against stored listsWrite, 3 marks, Plus
- Count items meeting a conditionWrite, 3 marks, Plus
- Count characters in a stringWrite, 3 marks, Plus
- Select recordsWrite, 3 marks, Plus
- A type check on textWrite, 3 marks, Plus
- Largest or smallest of threeWrite, 3 marks, Plus
- A function with a loopWrite, 3 marks, Plus
- Records ready to write to a fileWrite, 3 marks, Plus
- Largest or smallest in a listWrite, 3 marks, Plus
- Reverse a string or test a palindromeWrite, 3 marks, Plus
- Total a row or column of a 2D listWrite, 3 marks, Plus
- A linear searchWrite, 3 marks, Plus
- A function with selectionWrite, 3 marks, Plus
- Build a usernameWrite, 3 marks, Plus
- Where a counter lands in a gridComplete, 4 marks, Plus
- Extend a program with a new subroutineExtend, 4 marks, Plus
- Find a value in a 2D listComplete, 4 marks, Plus
- Check a username and password against stored listsComplete, 4 marks, Plus
- Complete the lines inside a loopComplete, 4 marks, Plus
- Fill the numbered gaps in a programComplete, 4 marks, Plus
- Fix a syntax, a runtime and a logic errorFix, 4 marks, Plus
- Turn file lines into recordsComplete, 4 marks, Plus
- Sort records with a bubble sortComplete, 4 marks, Plus
- Total a field across recordsComplete, 4 marks, Plus
- Fix and extend a Caesar cipherFix, 4 marks, Plus
- Finish a format check on an email addressComplete, 4 marks, Plus
- A type and length check on a codeComplete, 4 marks, Plus
- Amend a program to re-ask until validAmend, 4 marks, Plus
- Compare the columns or rows of a 2D listWrite, 4 marks, Plus
- The best record in a fileWrite, 4 marks, Plus
- A function on factorsWrite, 4 marks, Plus
- A format checkWrite, 4 marks, Plus
- Search a 2D gridWrite, 4 marks, Plus
- Total from recordsWrite, 4 marks, Plus
- Parallel listsWrite, 4 marks, Plus
- Read records until a rogue valueWrite, 4 marks, Plus
- Validate input in a loopWrite, 4 marks, Plus
- A password strength checkWrite, 4 marks, Plus
- Work through the words in a sentenceWrite, 4 marks, Plus
- Extend a login to three attemptsExtend, 5 marks, Plus
- Extend a report on recordsExtend, 5 marks, Plus
- Write two subroutines for a main programWrite, 5 marks, Plus
- A Caesar cipher with ord and chrWrite, 5 marks, Plus
- An authentication routineWrite, 5 marks, Plus
- Two functions, one calling the otherWrite, 5 marks, Plus
- Update a recordWrite, 5 marks, Plus
- A longer task: new accounts (13 marks)Develop, 13 marks, Plus
- A longer task: a sports club (15 marks)Develop, 15 marks, Plus
- A longer task: a league table (15 marks)Develop, 15 marks, Plus
AQA, Pearson Edexcel and OCR are registered trade marks of their owners. Brainlag Learn is independent: it is not affiliated with or endorsed by any exam board, and every question on it is original.