Which device is primarily used to type text into a computer?
- Keyboard
- Monitor
- Printer
- Speaker
Answer and explanation
Keyboard
Keyboard
Subjects
Computer science
Choose questions individually, practise online, or create a worksheet with matching answers. Counts include generated variants, not only authored originals.
Make a worksheet4,089 question instances
Topics
Sample exercises
What is an algorithm?
- A broken computer
- Only a password
- An ordered set of steps to solve a problem
- A type of screen
Answer and explanation
An ordered set of steps to solve a problem
An ordered set of steps to solve a problem
Which instruction represents repetition?
- Stop immediately
- Repeat these steps five times
- Choose one colour
- Start once
Answer and explanation
Repeat these steps five times
Repeat these steps five times
A stranger asks for your password in a game chat. What is the safest response?
- Send half of it
- Do not share it; tell a trusted adult
- Post it for everyone
- Send it privately
Answer and explanation
Do not share it; tell a trusted adult
Do not share it; tell a trusted adult
Write an algorithm for arranging three books from shortest to tallest.
Answer and explanation
Compare heights, put the shortest first, then the shorter of the remaining two, then the tallest. Accept any precise method that sorts all three.
Compare heights, put the shortest first, then the shorter of the remaining two, then the tallest. Accept any precise method that sorts all three.
Give two ways to check whether an online claim is reliable.
Answer and explanation
Identify the source and date, examine evidence, compare with reliable independent sources, and distinguish facts from opinions. Credit two distinct checks.
Identify the source and date, examine evidence, compare with reliable independent sources, and distinguish facts from opinions. Credit two distinct checks.
Study notes
Zero-based array indexing
An index of zero refers to the first position, not the second.
Grades 6–9Nested loops
This product applies when the inner count is constant for each outer iteration.
Grades 8–12Bits and bytes
A bit is a binary digit; a byte contains eight bits.
Grades 6–10Uncompressed storage models
This simple model excludes metadata and compression.
Grades 8–11Compare compressed sizes
Use the same size units; file-size reduction alone does not prove quality is preserved.
Grades 6–10Pixel counts
Count the individual picture elements in a rectangular image.
Grades 5–9Trace a loop with a step
The upper limit is inclusive in the pseudocode here.
Grades 6–10Algorithms & logic · Formula sheet
Rules, conditions and small examples in one printable reference.
Grades 6–8Algorithms & logic · Formula sheet
Rules, conditions and small examples in one printable reference.
Grades 9–10Algorithms & logic · Formula sheet
Rules, conditions and small examples in one printable reference.
Grades 11–12Digital literacy · Formula sheet
Rules, conditions and small examples in one printable reference.
Grades 5–5Digital literacy · Formula sheet
Rules, conditions and small examples in one printable reference.
Grades 6–8Digital literacy · Formula sheet
Rules, conditions and small examples in one printable reference.
Grades 9–10Digital literacy · Formula sheet
Rules, conditions and small examples in one printable reference.
Grades 11–11Computing foundations
20 key concepts, retrieval questions and a learning checkpoint.
Grades 5–10Computing foundations · quick reference
Trace code using a table of variable values. Do not execute unknown code to answer a worksheet question.
Grades 5–10Advanced computing concepts
20 key concepts, retrieval questions and a learning checkpoint.
Grades 9–12Advanced computing concepts · quick reference
An algorithm’s complexity describes growth, not its exact runtime on every computer. Binary search requires an appropriate ordered collection.
Grades 9–12Algorithms without a computer
An algorithm is a clear sequence of instructions for a task.
Grades 3–6Algorithms without a computer · revision card
An algorithm is a clear sequence of instructions for a task.
Grades 3–6Python-style code tracing
Use a small table of variable values after each statement.
Grades 7–11Python-style code tracing · revision card
Use a small table of variable values after each statement.
Grades 7–11Digital information and responsible use
A polished page or a popular post is not proof that a claim is correct.
Grades 5–10Digital information and responsible use · revision card
A polished page or a popular post is not proof that a claim is correct.
Grades 5–10Python lists and sequence tracing
Python lists use zero-based indexing; these tasks use the displayed list only.
Grades 7–10Python lists and sequence tracing · Revision card
Python lists use zero-based indexing; these tasks use the displayed list only.
Grades 7–10Algorithm tracing and useful tests
These examples use plain pseudocode; inclusive bounds are stated explicitly.
Grades 6–10Algorithm tracing and useful tests · Revision card
These examples use plain pseudocode; inclusive bounds are stated explicitly.
Grades 6–10Digital information and source checks
A repost is not necessarily an independent source.
Grades 6–10Digital information and source checks · Revision card
A repost is not necessarily an independent source.
Grades 6–10Designing digital work for more users
Important information should not rely only on colour, sound or images.
Grades 7–12Designing digital work for more users · Revision card
Important information should not rely only on colour, sound or images.
Grades 7–12Trace algorithms step by step
Use explicit starting values and loop boundaries.
Grades 6–10Trace algorithms step by step · Revision sheet
Use explicit starting values and loop boundaries.
Grades 6–10Data quality and privacy-aware design
Collect only what a task needs and distinguish missing values from zero.
Grades 7–12Data quality and privacy-aware design · Revision sheet
Collect only what a task needs and distinguish missing values from zero.
Grades 7–12Relational data, SQL and safe queries
A relational table holds rows and columns with a defined schema. Keys identify rows or relationships, while constraints enforce some consistency rules.
UniversityRelational data, SQL and safe queries · revision notes
A relational table holds rows and columns with a defined schema. Keys identify rows or relationships, while constraints enforce some consistency rules.
UniversityAlgorithms, invariants and asymptotic costs
An algorithm should have a stated input contract, output goal and termination argument. A loop invariant describes what remains true at a defined point in each iteration.
UniversityAlgorithms, invariants and asymptotic costs · revision notes
An algorithm should have a stated input contract, output goal and termination argument. A loop invariant describes what remains true at a defined point in each iteration.
UniversityValues, variables and expressions
A concrete piece of data such as a number or string.
UniversityValues, variables and expressions · revision notes
A concrete piece of data such as a number or string.
UniversityConditionals and loops
A Boolean test used to choose whether a block runs.
UniversityConditionals and loops · revision notes
A Boolean test used to choose whether a block runs.
UniversityFunctions and decomposition
A reusable named block that can accept inputs and return a result.
UniversityFunctions and decomposition · revision notes
A reusable named block that can accept inputs and return a result.
UniversityLists, dictionaries and iteration
An ordered mutable collection addressed by position.
UniversityLists, dictionaries and iteration · revision notes
An ordered mutable collection addressed by position.
UniversityHTML structure and semantics
A structural unit of HTML represented by a tag and its content.
UniversityHTML structure and semantics · revision notes
A structural unit of HTML represented by a tag and its content.
UniversityCSS layout and cascade
A pattern that chooses which elements a CSS rule targets.
UniversityCSS layout and cascade · revision notes
A pattern that chooses which elements a CSS rule targets.
UniversityJavaScript and browser behaviour
A browser occurrence such as a click, input or key press.
UniversityJavaScript and browser behaviour · revision notes
A browser occurrence such as a click, input or key press.
UniversityAccessibility and performance
Text that identifies a control to assistive technology.
UniversityAccessibility and performance · revision notes
Text that identifies a control to assistive technology.
UniversityTables, rows and keys
A relation represented as rows with named columns.
UniversityTables, rows and keys · revision notes
A relation represented as rows with named columns.
UniversitySELECT, filtering and sorting
A query clause that specifies values to return.
UniversitySELECT, filtering and sorting · revision notes
A query clause that specifies values to return.
UniversityJoins and relationships
An operation combining rows according to a relationship condition.
UniversityJoins and relationships · revision notes
An operation combining rows according to a relationship condition.
UniversityTransactions and safe querying
A group of database operations treated as one logical unit.
UniversityTransactions and safe querying · revision notes
A group of database operations treated as one logical unit.
UniversityData quality and cleaning
An observation where a required measurement is absent.
UniversityData quality and cleaning · revision notes
An observation where a required measurement is absent.
UniversityVisualization and summaries
How observed values are spread across possible outcomes.
UniversityVisualization and summaries · revision notes
How observed values are spread across possible outcomes.
UniversityPrediction and evaluation
Data used to fit model parameters.
UniversityPrediction and evaluation · revision notes
Data used to fit model parameters.
UniversityInference and responsible interpretation
A statistical relationship that does not by itself establish causation.
UniversityInference and responsible interpretation · revision notes
A statistical relationship that does not by itself establish causation.
UniversityThreats, vulnerabilities and risk
Something valuable that needs protection.
UniversityThreats, vulnerabilities and risk · revision notes
Something valuable that needs protection.
UniversityAuthentication and access control
Verifying an asserted identity.
UniversityAuthentication and access control · revision notes
Verifying an asserted identity.
UniversityData protection and backups
Transforming data with a key so unauthorized readers cannot interpret it.
UniversityData protection and backups · revision notes
Transforming data with a key so unauthorized readers cannot interpret it.
UniversityPhishing, verification and incident response
A deceptive message designed to induce unsafe disclosure or action.
UniversityPhishing, verification and incident response · revision notes
A deceptive message designed to induce unsafe disclosure or action.
UniversityFormulas and cell references
An expression in a spreadsheet cell that calculates a result.
UniversityFormulas and cell references · revision notes
An expression in a spreadsheet cell that calculates a result.
UniversityFunctions and conditions
A function that adds numerical values in a range or list.
UniversityFunctions and conditions · revision notes
A function that adds numerical values in a range or list.
UniversityCleaning and validation
Reordering rows according to selected values while preserving row relationships.
UniversityCleaning and validation · revision notes
Reordering rows according to selected values while preserving row relationships.
UniversityCharts and summaries
A chart comparing magnitudes across categories.
UniversityCharts and summaries · revision notes
A chart comparing magnitudes across categories.
UniversityWorst-case comparisons in a perfect binary search
The array is sorted and balanced median choices are used. Count inspected elements, including the last one.
Grades 9–12Worst-case comparisons in a perfect binary search · formula reference
The array is sorted and balanced median choices are used. Count inspected elements, including the last one.
Grades 9–12Ideal payload transfer time
Assume no protocol overhead or contention. MB and Mbps use decimal prefixes, not binary mebibytes.
Grades 9–12Ideal payload transfer time · formula reference
Assume no protocol overhead or contention. MB and Mbps use decimal prefixes, not binary mebibytes.
Grades 9–12Related courses
Computer science4 lessons
Python programming foundations
Learn core Python concepts with paper-based reasoning and small code-reading tasks.
32 quiz questions · University
Computer science4 lessons
Web development foundations
Study HTML, CSS, JavaScript and accessible web structure without a paid bootcamp.
32 quiz questions · University
Computer science4 lessons
SQL and relational databases
Learn tables, queries, joins and data modelling with original exercises.
32 quiz questions · University
Computer science4 lessons
Data science foundations
Work through data cleaning, visualization, modelling and interpretation.
32 quiz questions · University
Computer science4 lessons
Cybersecurity foundations
Study defensive security, privacy and risk management without offensive exploitation instructions.
32 quiz questions · University
Computer science4 lessons
Spreadsheet skills
Learn formulas, references, cleaning and charts for practical study and office work.
32 quiz questions · University