Kiribati · 6 units · controlled beta
Computing and networking: addressing, routing, services, security and controlled troubleshooting
Complete DASKEREL teaching support with precise concepts, transparent reasoning, guided practice, authentic evidence and accessible alternatives.
Subject specification
Computing, software, networks, data and AI: knowledge, formulae and assessment
Required knowledge strands
- data representation, hardware, operating systems and networks
- algorithms, programming, testing and software design
- data modelling, databases, analytics and AI evaluation
- cybersecurity, privacy, accessibility and responsible systems
Formulae and reasoning frames
- Data rate = data transferred ÷ time
- Storage size = number of items × bits per item
- Availability = uptime ÷ total time × 100%
- Precision = true positives ÷ predicted positives
- Recall = true positives ÷ actual positives
- F1 = 2 × precision × recall ÷ (precision + recall)
- Mean latency = total observed latency ÷ number of observations
Assessment objectives
- explain computing concepts
- apply algorithms and build solutions
- analyse, test and evaluate digital systems
Command words: trace · write · calculate · explain · test · evaluate
Practical and portfolio evidence
- versioned source or design
- test table
- logs
- data card
- security, accessibility and limitation review
Misconceptions explicitly tested: encryption removes the need for access control · a high model accuracy proves fairness and fitness for use · successful execution proves that software is correct
Curriculum and examination-board control
DASKEREL core complete · examination mapping pending
The subject teaching core, formulae, practice and assessment objectives are available. A named examination board or curriculum authority, specification version, jurisdiction, language and assessment format must be verified before board-alignment is claimed.
Country and level beta mapping
Kiribati · Technical and vocational upper-secondary completion
Country-specific national, subnational or awarding-body model; the competent body and legal scope remain a beta research task.
Assessment route: The exact certificate, board, subject code, examination year and assessment format must be recorded before alignment is claimed.
Authority or board candidates
- Kiribati: competent national or subnational curriculum authority — exact legal name to be verified
- Kiribati: competent examination, qualifications or technical-award body — exact route to be verified
Academic review required: DASKEREL provides independent beta teaching and assessment support. This record does not claim government, board, university or awarding-body approval, recognition, accreditation or equivalence.
Beta subject-topic matrix (14 subjects)
Applied mathematics
Topics: number, ratio, proportion and financial arithmetic · algebra, functions, sequences and graphs · geometry, measure, trigonometry and vectors · probability, statistics, modelling and proof
Formulae/reasoning: Percentage change = (new value − original value) ÷ original value × 100% · Gradient = change in y ÷ change in x · Pythagoras: a² + b² = c² for a right-angled triangle · Trigonometry: sin θ = opposite ÷ hypotenuse; cos θ = adjacent ÷ hypotenuse; tan θ = opposite ÷ adjacent · Circle: circumference C = 2πr and area A = πr² · Mean = Σx ÷ n; probability = favourable outcomes ÷ equally likely outcomes
Comparison: DASKEREL beta drafted; current official specification comparison and academic review required.
Applied physics
Topics: measurement, motion, forces and momentum · work, energy, power and thermal systems · electricity, circuits, fields and electromagnetism · waves, radiation, matter and space
Formulae/reasoning: Speed v = distance s ÷ time t · Acceleration a = change in velocity Δv ÷ time Δt · Resultant force F = ma · Momentum p = mv · Work W = Fs and power P = E ÷ t · Potential difference V = IR; electrical power P = VI; energy E = Pt · Density ρ = m ÷ V; pressure p = F ÷ A · Wave speed v = fλ · Efficiency = useful output ÷ total input × 100%
Comparison: DASKEREL beta drafted; current official specification comparison and academic review required.
Applied chemistry
Topics: atomic structure, periodicity, bonding and properties · quantitative chemistry and chemical equations · energetics, rates, equilibrium, acids and redox · organic, analytical, materials and environmental chemistry
Formulae/reasoning: Amount n = mass m ÷ molar mass M · Concentration c = n ÷ V, with V in dm³ · Dilution c₁V₁ = c₂V₂ when solute amount is conserved · Percentage yield = actual yield ÷ theoretical yield × 100% · Atom economy = desired product formula mass ÷ total reactant formula mass × 100% · Gas amount n = gas volume ÷ molar gas volume under stated conditions · Rf = distance travelled by substance ÷ distance travelled by solvent front
Comparison: DASKEREL beta drafted; current official specification comparison and academic review required.
Technical drawing and CAD
Topics: design requirements, drawings, tolerances and materials · forces, motion, energy and power transmission · electrical, electronic, control and measurement systems · manufacture, construction, maintenance, safety and quality
Formulae/reasoning: Scale factor = drawing length ÷ actual length · Moment M = force F × perpendicular distance d · Stress σ = force F ÷ cross-sectional area A · Work W = Fs and power P = W ÷ t · Ohm’s law V = IR and electrical power P = VI · Efficiency = useful output ÷ total input × 100% · Factor of safety = failure load ÷ allowable working load
Comparison: DASKEREL beta drafted; current official specification comparison and academic review required.
Electrical and electronic systems
Topics: design requirements, drawings, tolerances and materials · forces, motion, energy and power transmission · electrical, electronic, control and measurement systems · manufacture, construction, maintenance, safety and quality
Formulae/reasoning: Scale factor = drawing length ÷ actual length · Moment M = force F × perpendicular distance d · Stress σ = force F ÷ cross-sectional area A · Work W = Fs and power P = W ÷ t · Ohm’s law V = IR and electrical power P = VI · Efficiency = useful output ÷ total input × 100% · Factor of safety = failure load ÷ allowable working load
Comparison: DASKEREL beta drafted; current official specification comparison and academic review required.
Mechanical systems and maintenance
Topics: design requirements, drawings, tolerances and materials · forces, motion, energy and power transmission · electrical, electronic, control and measurement systems · manufacture, construction, maintenance, safety and quality
Formulae/reasoning: Scale factor = drawing length ÷ actual length · Moment M = force F × perpendicular distance d · Stress σ = force F ÷ cross-sectional area A · Work W = Fs and power P = W ÷ t · Ohm’s law V = IR and electrical power P = VI · Efficiency = useful output ÷ total input × 100% · Factor of safety = failure load ÷ allowable working load
Comparison: DASKEREL beta drafted; current official specification comparison and academic review required.
Construction and civil technology
Topics: design requirements, drawings, tolerances and materials · forces, motion, energy and power transmission · electrical, electronic, control and measurement systems · manufacture, construction, maintenance, safety and quality
Formulae/reasoning: Scale factor = drawing length ÷ actual length · Moment M = force F × perpendicular distance d · Stress σ = force F ÷ cross-sectional area A · Work W = Fs and power P = W ÷ t · Ohm’s law V = IR and electrical power P = VI · Efficiency = useful output ÷ total input × 100% · Factor of safety = failure load ÷ allowable working load
Comparison: DASKEREL beta drafted; current official specification comparison and academic review required.
Computing and networking
Topics: data representation, hardware, operating systems and networks · algorithms, programming, testing and software design · data modelling, databases, analytics and AI evaluation · cybersecurity, privacy, accessibility and responsible systems
Formulae/reasoning: Data rate = data transferred ÷ time · Storage size = number of items × bits per item · Availability = uptime ÷ total time × 100% · Precision = true positives ÷ predicted positives · Recall = true positives ÷ actual positives · F1 = 2 × precision × recall ÷ (precision + recall) · Mean latency = total observed latency ÷ number of observations
Comparison: DASKEREL beta drafted; current official specification comparison and academic review required.
Business administration
Topics: stakeholders, enterprise, objectives and business models · markets, demand, supply, elasticity and economic context · operations, people, quality, finance and risk · strategy, marketing, innovation, sustainability and performance
Formulae/reasoning: Revenue = price × quantity · Profit = revenue − total cost · Market share = business sales ÷ total market sales × 100% · Percentage change = change ÷ original × 100% · Labour productivity = output ÷ labour input · Capacity utilisation = actual output ÷ maximum output × 100% · Price elasticity of demand = % change in quantity demanded ÷ % change in price
Comparison: DASKEREL beta drafted; current official specification comparison and academic review required.
Accounting and finance
Topics: source documents, double entry, ledgers and trial balance · adjustments, financial statements and cash flow · costing, budgeting, variance and decision support · controls, audit evidence, ethics and reporting quality
Formulae/reasoning: Assets = liabilities + owner equity · Profit = revenue − total expenses · Gross margin = gross profit ÷ revenue × 100% · Current ratio = current assets ÷ current liabilities · Receivables days = trade receivables ÷ credit revenue × period days · Contribution = selling price − variable cost · Break-even units = fixed cost ÷ contribution per unit · Simple interest I = Prt
Comparison: DASKEREL beta drafted; current official specification comparison and academic review required.
Agriculture and environmental technology
Topics: place, scale, space, population and development · physical processes, hazards, climate and ecosystems · resources, agriculture, cities, economies and inequality · fieldwork, maps, geospatial evidence and sustainable decisions
Formulae/reasoning: Population density = population ÷ area · Rate of change = change ÷ time · Percentage change = change ÷ original × 100% · Mean = Σx ÷ n and range = maximum − minimum · Irrigation volume = area × water depth · Gross margin = output value − specified variable costs
Comparison: DASKEREL beta drafted; current official specification comparison and academic review required.
Hospitality and service operations
Topics: stakeholders, enterprise, objectives and business models · markets, demand, supply, elasticity and economic context · operations, people, quality, finance and risk · strategy, marketing, innovation, sustainability and performance
Formulae/reasoning: Revenue = price × quantity · Profit = revenue − total cost · Market share = business sales ÷ total market sales × 100% · Percentage change = change ÷ original × 100% · Labour productivity = output ÷ labour input · Capacity utilisation = actual output ÷ maximum output × 100% · Price elasticity of demand = % change in quantity demanded ÷ % change in price
Comparison: DASKEREL beta drafted; current official specification comparison and academic review required.
Health and social-care foundations
Topics: cells, organisation, transport and bioenergetics · inheritance, variation, evolution and biotechnology · homeostasis, infection, health and populations · ecology, cycles, biodiversity and human impact
Formulae/reasoning: Magnification = image size ÷ actual size · Percentage change = change ÷ original × 100% · Rate = change in quantity ÷ time · Population density = number of organisms ÷ sampled area or volume · Risk rate = events ÷ population at risk over a stated period · Surface-area-to-volume ratio = surface area ÷ volume
Comparison: DASKEREL beta drafted; current official specification comparison and academic review required.
Safety, quality and project practice
Topics: questions, theory, literature and conceptual frameworks · quantitative, qualitative and mixed methods · sampling, validity, reliability, reflexivity and ethics · analysis, argument, peer review, impact and defence
Formulae/reasoning: Response rate = completed responses ÷ eligible invitations × 100% · Mean = Σx ÷ n; proportion = category count ÷ total · Effect estimate = outcome in comparison groups under a stated design · Claim strength is limited by design, measurement, sample and uncertainty
Comparison: DASKEREL beta drafted; current official specification comparison and academic review required.
Assessment and practical-requirement matrix
DASKEREL beta format: 210 minutes · 14 constructed-response tasks · 140 marks.
Timed, original constructed-response tasks using scenarios, supplied evidence, calculations or reasoned judgements; no answer-option guessing.
Task-specific criteria, transparent workings, evidence quality, limitations and justified conclusions; official grade boundaries are not inferred.
- Applied mathematics: annotated working · graph with scale and units · error analysis · alternative method · model limitation statement
- Applied physics: labelled diagram · raw and processed data · uncertainty record · graph and gradient · risk-controlled method
- Applied chemistry: equation and mole map · calculation with units · risk and waste controls · repeat measurements · conditional conclusion
- Technical drawing and CAD: controlled drawing · calculation sheet · simulation or supervised test · hazard analysis · inspection and revision record
- Electrical and electronic systems: controlled drawing · calculation sheet · simulation or supervised test · hazard analysis · inspection and revision record
- Mechanical systems and maintenance: controlled drawing · calculation sheet · simulation or supervised test · hazard analysis · inspection and revision record
- Construction and civil technology: controlled drawing · calculation sheet · simulation or supervised test · hazard analysis · inspection and revision record
- Computing and networking: versioned source or design · test table · logs · data card · security, accessibility and limitation review
- Business administration: stakeholder map · calculation table · option appraisal · sensitivity analysis · conditional recommendation
- Accounting and finance: source register · journal and ledger trail · reconciliation · statement workings · control and reviewer checklist
- Agriculture and environmental technology: annotated map · sampling plan · data table and graph · stakeholder comparison · sustainability appraisal
- Hospitality and service operations: stakeholder map · calculation table · option appraisal · sensitivity analysis · conditional recommendation
- Health and social-care foundations: method and variables · sampling rationale · raw observations · calculation and graph · ethical and uncertainty statement
- Safety, quality and project practice: protocol · source and decision log · ethical review · analysis trail · limitations and defence record
Official sources and source dates
No current official specification is recorded for this country and level. Authority identification, official URL, version, effective year and scope remain required before comparison or public alignment claims.
Evidence required for a public alignment claim
- Official authority or awarding-body name, jurisdiction and legal competence
- Current specification, programme or standard URL, publication date, version and effective examination year
- Subject-by-subject and topic-by-topic coverage matrix, including prerequisites and exclusions
- Assessment objectives, command words, paper structure, duration, marks, grading and permitted resources
- Required practicals, coursework, fieldwork, projects, oral work, prescribed texts and safety constraints
- Accessible assessment and reasonable-adjustment rules from the competent authority
- Original DASKEREL mock paper, mark scheme, moderation record and anti-guessing quality review
- Named academically competent reviewer, conflicts declaration, decision, review date and change log
Lesson record and offline copy
kiribati:senior-secondary-technical:computing-and-networking · Record opened 2026-10-29
- Content origin
- DASKEREL original beta
- Content owner
- DASKEREL
- Reuse rights
- Internal rights review pending
- DASKEREL internal lesson review
- Pending
- Country or level reference records
- 0
- Academic reviewer
- Not recorded; review required
- Language reviewer
- Not recorded; review required
This lesson needs a country-specific terminology and language review before local alignment is claimed.
Use your browser's print dialog to save this page for offline reading. Check the record date when you return online; saved copies do not update automatically.
Formulae, models and reasoning frames
Define every symbol, preserve units, state assumptions and check whether the relationship applies before substitution. Non-quantitative subjects use an equivalent evidence-and-reasoning frame rather than a decorative equation.
- Data rate = data transferred ÷ time
- Storage size = number of items × bits per item
- Availability = uptime ÷ total time × 100%
- Precision = true positives ÷ predicted positives
- Recall = true positives ÷ actual positives
- F1 = 2 × precision × recall ÷ (precision + recall)
- Mean latency = total observed latency ÷ number of observations
Unit 1 · Foundations and precise vocabulary
70 minutes
Build a connected foundation in computing and networking before attempting assessment tasks.
Study notes
- Study system components, data flows, algorithms, representations, failure modes, security controls and accessibility requirements.
- Build a connected map of these Computing, software, networks, data and AI strands: data representation, hardware, operating systems and networks; algorithms, programming, testing and software design; data modelling, databases, analytics and AI evaluation; cybersecurity, privacy, accessibility and responsible systems.
- Create a glossary that defines each term in context and tests this misconception: encryption removes the need for access control
- Connect the new ideas to prerequisite knowledge, then identify any gap that must be repaired before progression.
Worked application
Deconstruct the lesson’s worked model using the first strand, “data representation, hardware, operating systems and networks”. Label every concept, assumption and decision, then explain why each step belongs to computing, data and digital systems.
Guided practice
- Complete the relevant part of the guided practice for computing and networking; label the command word, selected strand and assessment objective, then annotate every reasoning step.
- Create a second computing and networking example with different data, audience or constraints, use an appropriate formula or reasoning frame, and solve it independently.
- Use the quality criteria to self-assess, obtain feedback where available, and submit a revised version with a change log.
Mastery checks
- Can you explain the central computing and networking idea without relying on the worked wording?
- Can you define and apply “Data rate = data transferred ÷ time” or explain why a different reasoning frame is required?
- Can you detect and correct this misconception: encryption removes the need for access control?
- Can you identify the evidence, assumptions, limitations and a plausible alternative?
- Can you transfer the method to a new case and justify every important choice?
Portfolio evidence: Produce a controlled network-design and verification pack for a simulated training centre. Include an accessible topology description, VLAN and subnet plan, IPv4 calculations, an IPv6 allocation concept, gateway and routing table, DHCP and DNS flow, least-privilege policy matrix, authorised test plan, fault tree, log and configuration evidence, revision history, individual administrative roles, backup and rollback plan, unresolved risks and a conditional release decision. Use only supplied evidence or an authorised sandbox; do not scan, intercept or change a live network. For this unit, retain the attempt, feedback, corrections, source record and a short reflection on the next improvement.
Unit 2 · Methods, procedures and transparent reasoning
70 minutes
Learn a repeatable computing and networking method and know when it is appropriate.
Study notes
- Use this discipline sequence: decompose the problem, define inputs and expected outputs, build in an authorised sandbox, test normal and failure cases, and preserve a rollback path.
- Apply these subject methods: decompose the problem and define acceptance criteria; trace an algorithm using representative and boundary inputs; test expected, invalid, failure and recovery paths; document data provenance, bias, security and human-review boundaries.
- Use and define the required relationships where relevant: Data rate = data transferred ÷ time; Storage size = number of items × bits per item; Availability = uptime ÷ total time × 100%; Precision = true positives ÷ predicted positives; Recall = true positives ÷ actual positives; F1 = 2 × precision × recall ÷ (precision + recall); Mean latency = total observed latency ÷ number of observations.
- Separate information supplied by the task from assumptions introduced by the learner.
- Keep units, citations, definitions, intermediate working and rejected alternatives visible so another person can audit the reasoning.
Worked application
Rework the model with one changed assumption. Select and define an appropriate relationship or reasoning frame from “Data rate = data transferred ÷ time”, predict the consequence before calculating or redrafting, and reconcile the prediction with the result.
Guided practice
- Complete the relevant part of the guided practice for computing and networking; label the command word, selected strand and assessment objective, then annotate every reasoning step.
- Create a second computing and networking example with different data, audience or constraints, use an appropriate formula or reasoning frame, and solve it independently.
- Use the quality criteria to self-assess, obtain feedback where available, and submit a revised version with a change log.
Mastery checks
- Can you explain the central computing and networking idea without relying on the worked wording?
- Can you define and apply “Storage size = number of items × bits per item” or explain why a different reasoning frame is required?
- Can you detect and correct this misconception: a high model accuracy proves fairness and fitness for use?
- Can you identify the evidence, assumptions, limitations and a plausible alternative?
- Can you transfer the method to a new case and justify every important choice?
Portfolio evidence: Produce a controlled network-design and verification pack for a simulated training centre. Include an accessible topology description, VLAN and subnet plan, IPv4 calculations, an IPv6 allocation concept, gateway and routing table, DHCP and DNS flow, least-privilege policy matrix, authorised test plan, fault tree, log and configuration evidence, revision history, individual administrative roles, backup and rollback plan, unresolved risks and a conditional release decision. Use only supplied evidence or an authorised sandbox; do not scan, intercept or change a live network. For this unit, retain the attempt, feedback, corrections, source record and a short reflection on the next improvement.
Unit 3 · Guided and independent practice
70 minutes
Move from supported examples to unfamiliar computing and networking problems.
Study notes
- Complete one imitative task, one task with changed data or context, and one unfamiliar transfer task.
- Practise the command words explicitly: trace, write, calculate, explain, test, evaluate.
- Check performance against these objectives: explain computing concepts; apply algorithms and build solutions; analyse, test and evaluate digital systems.
- After each attempt, classify errors as knowledge, method, evidence, calculation, communication or checking errors.
- Revise the response from feedback and record exactly which change improved the evidence.
Worked application
Compare two plausible responses to the same computing and networking problem. Use the relevant command word and assessment objective to identify the stronger reasoning, then repair the weaker response without copying the stronger wording.
Guided practice
- Complete the relevant part of the guided practice for computing and networking; label the command word, selected strand and assessment objective, then annotate every reasoning step.
- Create a second computing and networking example with different data, audience or constraints, use an appropriate formula or reasoning frame, and solve it independently.
- Use the quality criteria to self-assess, obtain feedback where available, and submit a revised version with a change log.
Mastery checks
- Can you explain the central computing and networking idea without relying on the worked wording?
- Can you define and apply “Availability = uptime ÷ total time × 100%” or explain why a different reasoning frame is required?
- Can you detect and correct this misconception: successful execution proves that software is correct?
- Can you identify the evidence, assumptions, limitations and a plausible alternative?
- Can you transfer the method to a new case and justify every important choice?
Portfolio evidence: Produce a controlled network-design and verification pack for a simulated training centre. Include an accessible topology description, VLAN and subnet plan, IPv4 calculations, an IPv6 allocation concept, gateway and routing table, DHCP and DNS flow, least-privilege policy matrix, authorised test plan, fault tree, log and configuration evidence, revision history, individual administrative roles, backup and rollback plan, unresolved risks and a conditional release decision. Use only supplied evidence or an authorised sandbox; do not scan, intercept or change a live network. For this unit, retain the attempt, feedback, corrections, source record and a short reflection on the next improvement.
Unit 4 · Applied case and decision-making
70 minutes
Apply computing and networking to a realistic but controlled context.
Study notes
- Use an authorised, privacy-preserving digital service or simulation with explicit users, risks and acceptance criteria.
- Produce appropriate practical or source evidence: versioned source or design; test table; logs; data card; security, accessibility and limitation review.
- Map stakeholders, constraints, benefits, risks and information that remains missing.
- Judge the result using correctness, traceability, security, privacy, accessibility, maintainability and evidence of testing rather than appearance alone.
Worked application
Prepare a decision table with at least two defensible options, weighted or reasoned criteria, a sensitivity check and a conditional recommendation grounded in “versioned source or design”.
Guided practice
- Complete the relevant part of the guided practice for computing and networking; label the command word, selected strand and assessment objective, then annotate every reasoning step.
- Create a second computing and networking example with different data, audience or constraints, use an appropriate formula or reasoning frame, and solve it independently.
- Use the quality criteria to self-assess, obtain feedback where available, and submit a revised version with a change log.
Mastery checks
- Can you explain the central computing and networking idea without relying on the worked wording?
- Can you define and apply “Precision = true positives ÷ predicted positives” or explain why a different reasoning frame is required?
- Can you detect and correct this misconception: encryption removes the need for access control?
- Can you identify the evidence, assumptions, limitations and a plausible alternative?
- Can you transfer the method to a new case and justify every important choice?
Portfolio evidence: Produce a controlled network-design and verification pack for a simulated training centre. Include an accessible topology description, VLAN and subnet plan, IPv4 calculations, an IPv6 allocation concept, gateway and routing table, DHCP and DNS flow, least-privilege policy matrix, authorised test plan, fault tree, log and configuration evidence, revision history, individual administrative roles, backup and rollback plan, unresolved risks and a conditional release decision. Use only supplied evidence or an authorised sandbox; do not scan, intercept or change a live network. For this unit, retain the attempt, feedback, corrections, source record and a short reflection on the next improvement.
Unit 5 · Evidence, challenge and quality assurance
70 minutes
Test whether a computing and networking conclusion survives scrutiny.
Study notes
- Use versioned designs, test cases, logs, datasets, screenshots with text alternatives, configuration records and defect histories.
- Actively test these known misconceptions: encryption removes the need for access control; a high model accuracy proves fairness and fitness for use; successful execution proves that software is correct.
- Distinguish observation, source statement, inference, calculation, value judgement and authorised decision.
- Challenge the conclusion with the strongest alternative explanation and state what new evidence could overturn it.
Worked application
Audit a deliberately flawed response that includes “a high model accuracy proves fairness and fitness for use”, a source problem, a hidden assumption, a method error and an overconfident conclusion; correct each fault and document its effect.
Guided practice
- Complete the relevant part of the guided practice for computing and networking; label the command word, selected strand and assessment objective, then annotate every reasoning step.
- Create a second computing and networking example with different data, audience or constraints, use an appropriate formula or reasoning frame, and solve it independently.
- Use the quality criteria to self-assess, obtain feedback where available, and submit a revised version with a change log.
Mastery checks
- Can you explain the central computing and networking idea without relying on the worked wording?
- Can you define and apply “Recall = true positives ÷ actual positives” or explain why a different reasoning frame is required?
- Can you detect and correct this misconception: a high model accuracy proves fairness and fitness for use?
- Can you identify the evidence, assumptions, limitations and a plausible alternative?
- Can you transfer the method to a new case and justify every important choice?
Portfolio evidence: Produce a controlled network-design and verification pack for a simulated training centre. Include an accessible topology description, VLAN and subnet plan, IPv4 calculations, an IPv6 allocation concept, gateway and routing table, DHCP and DNS flow, least-privilege policy matrix, authorised test plan, fault tree, log and configuration evidence, revision history, individual administrative roles, backup and rollback plan, unresolved risks and a conditional release decision. Use only supplied evidence or an authorised sandbox; do not scan, intercept or change a live network. For this unit, retain the attempt, feedback, corrections, source record and a short reflection on the next improvement.
Unit 6 · Synthesis, portfolio and progression
90 minutes
Demonstrate durable computing and networking mastery through an original artefact.
Study notes
- Plan an artefact for a named audience and assessment purpose, with milestones for research, first attempt, feedback, revision and final verification.
- Show coverage of all four subject strands: data representation, hardware, operating systems and networks; algorithms, programming, testing and software design; data modelling, databases, analytics and AI evaluation; cybersecurity, privacy, accessibility and responsible systems.
- Include a concise explanation for a non-specialist and a technical appendix that preserves the full reasoning.
- Apply this boundary before release: No activity authorises access to another person’s account, production system, confidential data or network without explicit permission.
Worked application
Defend the final recommendation against two questions using “analyse, test and evaluate digital systems”, acknowledge one genuine limitation and identify the next learning step rather than claiming complete certainty.
Guided practice
- Complete the relevant part of the guided practice for computing and networking; label the command word, selected strand and assessment objective, then annotate every reasoning step.
- Create a second computing and networking example with different data, audience or constraints, use an appropriate formula or reasoning frame, and solve it independently.
- Use the quality criteria to self-assess, obtain feedback where available, and submit a revised version with a change log.
Mastery checks
- Can you explain the central computing and networking idea without relying on the worked wording?
- Can you define and apply “F1 = 2 × precision × recall ÷ (precision + recall)” or explain why a different reasoning frame is required?
- Can you detect and correct this misconception: successful execution proves that software is correct?
- Can you identify the evidence, assumptions, limitations and a plausible alternative?
- Can you transfer the method to a new case and justify every important choice?
Portfolio evidence: Produce a controlled network-design and verification pack for a simulated training centre. Include an accessible topology description, VLAN and subnet plan, IPv4 calculations, an IPv6 allocation concept, gateway and routing table, DHCP and DNS flow, least-privilege policy matrix, authorised test plan, fault tree, log and configuration evidence, revision history, individual administrative roles, backup and rollback plan, unresolved risks and a conditional release decision. Use only supplied evidence or an authorised sandbox; do not scan, intercept or change a live network. For this unit, retain the attempt, feedback, corrections, source record and a short reflection on the next improvement.
Personal mastery workspace
Diagnose, retain and transfer this learning
Do not enter personal or sensitive information. Signed-in records sync securely; guest records remain in this tab.
Adaptive next action
Repair prerequisites, vocabulary and foundation practice. Use the model only after a first attempt.
Suggested interval: 1 day(s) · repair
Low confidence or retrieval below 50% requires prerequisite repair before delay.
Loading your learning record…
Practice this subject hands-on
Trace a fictional local or outside route before using a provider-approved networking lab. The model does not configure a real device.
Open the hands-on practice hubHands-on network route simulator
Predict and trace a route through this fictional network. This is a teaching model with invented devices. It does not connect to, scan or configure a real network.
Laptop → switch → printer
Tablet → access point → switch → router → provider → web service
Your choices and notes stay in this browser page session. This activity is practice, not a verified practical assessment.
Continue with a free network simulator labFull teaching lesson materials
Study the explanations before attempting the worked model, practise with changed contexts, then use the checks and evidence task to demonstrate independent understanding. These are substantive DASKEREL teaching materials; national-board alignment remains a separate evidence and academic-review decision.
Topic-by-topic teaching chapters
Subject chapter
Chapter 1 · data representation, hardware, operating systems and networks
Teaching explanation
- Define the key ideas inside “data representation, hardware, operating systems and networks”, give an example and a non-example, and connect them to the previous chapter rather than learning isolated vocabulary.
- Use this subject method: decompose the problem and define acceptance criteria. Explain why it is appropriate, which assumptions it introduces and which evidence would show that it has failed.
- Apply “Mean data rate = bits transferred ÷ seconds elapsed”. Define every term, preserve units or authority, and interpret the result in the original computing and networking context.
- Produce versioned source or design, then separate raw evidence, processing, inference and judgement so another learner can audit the conclusion.
- Test and correct this misconception: encryption removes the need for access control
Formula or reasoning frame
Mean data rate = bits transferred ÷ seconds elapsed
Worked solution
- Supplied computing and networking case for “data representation, hardware, operating systems and networks”: A fictional log sends 800 bits in 4 seconds. Calculate the mean data rate.
- Select the matching frame, “Mean data rate = bits transferred ÷ seconds elapsed”, and identify the exact quantities or textual details provided by the case before applying it.
- State the condition that makes this frame relevant, including the unit, population, source or decision boundary where applicable; do not supply missing facts as if they were observed.
- Worked solution: Data rate = data transferred ÷ time = 800 bits ÷ 4 s = 200 bit/s. The rate is an average for this transfer, not a guarantee about peak throughput or network security.
- Check the method against “encryption removes the need for access control”; explain which supplied fact supports the conclusion and which further evidence would be needed to generalise it.
Foundation practice
- Reproduce the worked solution for “data representation, hardware, operating systems and networks” with all intermediate steps and units or stated assumptions; then explain one step in your own words.
- Identify which fact in the supplied case is an observation, which is a calculation, and which is a limited interpretation.
Standard practice
- Independent parallel case: A transfer sends 1,200 bits in 6 seconds. Find its mean data rate.
- Explain why “Mean data rate = bits transferred ÷ seconds elapsed” fits this supplied case, and identify one assumption or boundary of the result.
Stretch and transfer
- Compare the worked and independent cases. Change one supplied input or condition, predict the direction of change, and check whether the relationship “Mean data rate = bits transferred ÷ seconds elapsed” still applies.
- Explain which additional versioned source or design would be required before transferring this result to a real computing and networking decision.
Open chapter answer and marking guidance after attempting the tasks
- Worked-case answer and reasoning: Data rate = data transferred ÷ time = 800 bits ÷ 4 s = 200 bit/s. The rate is an average for this transfer, not a guarantee about peak throughput or network security.
- Independent-case answer and reasoning: 1,200 bits ÷ 6 s = 200 bit/s. State the unit bit/s, not byte/s.
- Foundation practice must preserve the supplied values, show intermediate reasoning and distinguish the stated data from the interpretation.
- For stretch practice, a correct prediction must name the changed input, hold the other assumptions fixed, recalculate or re-evaluate the result, and state why a different condition might invalidate the frame.
Subject chapter
Chapter 2 · algorithms, programming, testing and software design
Teaching explanation
- Define the key ideas inside “algorithms, programming, testing and software design”, give an example and a non-example, and connect them to the previous chapter rather than learning isolated vocabulary.
- Use this subject method: trace an algorithm using representative and boundary inputs. Explain why it is appropriate, which assumptions it introduces and which evidence would show that it has failed.
- Apply “A conditional has a Boolean test, a true branch and a false branch”. Define every term, preserve units or authority, and interpret the result in the original computing and networking context.
- Produce test table, then separate raw evidence, processing, inference and judgement so another learner can audit the conclusion.
- Test and correct this misconception: a high model accuracy proves fairness and fitness for use
Formula or reasoning frame
A conditional has a Boolean test, a true branch and a false branch
Worked solution
- Supplied computing and networking case for “algorithms, programming, testing and software design”: Trace a rule: if score ≥ 50, print 'pass'; otherwise print 'retry'. Use scores 50 and 49.
- Select the matching frame, “A conditional has a Boolean test, a true branch and a false branch”, and identify the exact quantities or textual details provided by the case before applying it.
- State the condition that makes this frame relevant, including the unit, population, source or decision boundary where applicable; do not supply missing facts as if they were observed.
- Worked solution: For 50 the condition is true and the output is 'pass'; for 49 it is false and the output is 'retry'. Testing the boundary 50 is more informative than testing 80 alone.
- Check the method against “a high model accuracy proves fairness and fitness for use”; explain which supplied fact supports the conclusion and which further evidence would be needed to generalise it.
Foundation practice
- Reproduce the worked solution for “algorithms, programming, testing and software design” with all intermediate steps and units or stated assumptions; then explain one step in your own words.
- Identify which fact in the supplied case is an observation, which is a calculation, and which is a limited interpretation.
Standard practice
- Independent parallel case: For the same rule, state the outputs for 0, 75 and the invalid text input 'fifty'.
- Explain why “A conditional has a Boolean test, a true branch and a false branch” fits this supplied case, and identify one assumption or boundary of the result.
Stretch and transfer
- Compare the worked and independent cases. Change one supplied input or condition, predict the direction of change, and check whether the relationship “A conditional has a Boolean test, a true branch and a false branch” still applies.
- Explain which additional test table would be required before transferring this result to a real computing and networking decision.
Open chapter answer and marking guidance after attempting the tasks
- Worked-case answer and reasoning: For 50 the condition is true and the output is 'pass'; for 49 it is false and the output is 'retry'. Testing the boundary 50 is more informative than testing 80 alone.
- Independent-case answer and reasoning: 0 gives 'retry' and 75 gives 'pass'. 'fifty' needs validation or an error path before the numeric comparison; do not silently count it as 50.
- Foundation practice must preserve the supplied values, show intermediate reasoning and distinguish the stated data from the interpretation.
- For stretch practice, a correct prediction must name the changed input, hold the other assumptions fixed, recalculate or re-evaluate the result, and state why a different condition might invalidate the frame.
Subject chapter
Chapter 3 · data modelling, databases, analytics and AI evaluation
Teaching explanation
- Define the key ideas inside “data modelling, databases, analytics and AI evaluation”, give an example and a non-example, and connect them to the previous chapter rather than learning isolated vocabulary.
- Use this subject method: test expected, invalid, failure and recovery paths. Explain why it is appropriate, which assumptions it introduces and which evidence would show that it has failed.
- Apply “Precision = correct predicted positives ÷ predicted positives; recall = correct predicted positives ÷ actual positives”. Define every term, preserve units or authority, and interpret the result in the original computing and networking context.
- Produce logs, then separate raw evidence, processing, inference and judgement so another learner can audit the conclusion.
- Test and correct this misconception: successful execution proves that software is correct
Formula or reasoning frame
Precision = correct predicted positives ÷ predicted positives; recall = correct predicted positives ÷ actual positives
Worked solution
- Supplied computing and networking case for “data modelling, databases, analytics and AI evaluation”: A fictional classifier predicts 10 positives; 8 are correct. The dataset has 16 actual positives. Find precision and recall.
- Select the matching frame, “Precision = correct predicted positives ÷ predicted positives; recall = correct predicted positives ÷ actual positives”, and identify the exact quantities or textual details provided by the case before applying it.
- State the condition that makes this frame relevant, including the unit, population, source or decision boundary where applicable; do not supply missing facts as if they were observed.
- Worked solution: Precision = 8 ÷ 10 = 0.80; recall = 8 ÷ 16 = 0.50. These values do not establish fairness, safety or suitability for any particular user group.
- Check the method against “successful execution proves that software is correct”; explain which supplied fact supports the conclusion and which further evidence would be needed to generalise it.
Foundation practice
- Reproduce the worked solution for “data modelling, databases, analytics and AI evaluation” with all intermediate steps and units or stated assumptions; then explain one step in your own words.
- Identify which fact in the supplied case is an observation, which is a calculation, and which is a limited interpretation.
Standard practice
- Independent parallel case: A fictional classifier predicts 20 positives; 15 are correct, and there are 25 actual positives. Find precision and recall.
- Explain why “Precision = correct predicted positives ÷ predicted positives; recall = correct predicted positives ÷ actual positives” fits this supplied case, and identify one assumption or boundary of the result.
Stretch and transfer
- Compare the worked and independent cases. Change one supplied input or condition, predict the direction of change, and check whether the relationship “Precision = correct predicted positives ÷ predicted positives; recall = correct predicted positives ÷ actual positives” still applies.
- Explain which additional logs would be required before transferring this result to a real computing and networking decision.
Open chapter answer and marking guidance after attempting the tasks
- Worked-case answer and reasoning: Precision = 8 ÷ 10 = 0.80; recall = 8 ÷ 16 = 0.50. These values do not establish fairness, safety or suitability for any particular user group.
- Independent-case answer and reasoning: Precision = 15 ÷ 20 = 0.75; recall = 15 ÷ 25 = 0.60. Check the denominators before interpreting performance.
- Foundation practice must preserve the supplied values, show intermediate reasoning and distinguish the stated data from the interpretation.
- For stretch practice, a correct prediction must name the changed input, hold the other assumptions fixed, recalculate or re-evaluate the result, and state why a different condition might invalidate the frame.
Subject chapter
Chapter 4 · cybersecurity, privacy, accessibility and responsible systems
Teaching explanation
- Define the key ideas inside “cybersecurity, privacy, accessibility and responsible systems”, give an example and a non-example, and connect them to the previous chapter rather than learning isolated vocabulary.
- Use this subject method: document data provenance, bias, security and human-review boundaries. Explain why it is appropriate, which assumptions it introduces and which evidence would show that it has failed.
- Apply “Availability = available time ÷ scheduled time × 100%”. Define every term, preserve units or authority, and interpret the result in the original computing and networking context.
- Produce data card, then separate raw evidence, processing, inference and judgement so another learner can audit the conclusion.
- Test and correct this misconception: encryption removes the need for access control
Formula or reasoning frame
Availability = available time ÷ scheduled time × 100%
Worked solution
- Supplied computing and networking case for “cybersecurity, privacy, accessibility and responsible systems”: A fictional service is available for 95 of 100 scheduled hours. Calculate availability.
- Select the matching frame, “Availability = available time ÷ scheduled time × 100%”, and identify the exact quantities or textual details provided by the case before applying it.
- State the condition that makes this frame relevant, including the unit, population, source or decision boundary where applicable; do not supply missing facts as if they were observed.
- Worked solution: Availability = 95 ÷ 100 × 100 = 95%. This measure alone says nothing about confidentiality, accessibility or the severity of the five unavailable hours.
- Check the method against “encryption removes the need for access control”; explain which supplied fact supports the conclusion and which further evidence would be needed to generalise it.
Foundation practice
- Reproduce the worked solution for “cybersecurity, privacy, accessibility and responsible systems” with all intermediate steps and units or stated assumptions; then explain one step in your own words.
- Identify which fact in the supplied case is an observation, which is a calculation, and which is a limited interpretation.
Standard practice
- Independent parallel case: A service is available for 72 of 80 scheduled hours. Calculate availability.
- Explain why “Availability = available time ÷ scheduled time × 100%” fits this supplied case, and identify one assumption or boundary of the result.
Stretch and transfer
- Compare the worked and independent cases. Change one supplied input or condition, predict the direction of change, and check whether the relationship “Availability = available time ÷ scheduled time × 100%” still applies.
- Explain which additional data card would be required before transferring this result to a real computing and networking decision.
Open chapter answer and marking guidance after attempting the tasks
- Worked-case answer and reasoning: Availability = 95 ÷ 100 × 100 = 95%. This measure alone says nothing about confidentiality, accessibility or the severity of the five unavailable hours.
- Independent-case answer and reasoning: 72 ÷ 80 × 100 = 90%. A separate security and accessibility check is still required.
- Foundation practice must preserve the supplied values, show intermediate reasoning and distinguish the stated data from the interpretation.
- For stretch practice, a correct prediction must name the changed input, hold the other assumptions fixed, recalculate or re-evaluate the result, and state why a different condition might invalidate the frame.
Prerequisites and diagnostic preparation
- 1. Convert small values between binary, decimal and hexadecimal and use powers of two in address calculations.
- 2. Distinguish a device, interface, link, network, service and user account in a simple labelled topology.
- 3. Use a basic operating-system interface and command line in an authorised training environment without exposing credentials or personal data.
- 4. Prepare an accessible record of topology, configuration revision, tests, changes, risks, approvals and rollback evidence.
Learning objectives
- 1. Explain layered communication, encapsulation and the roles of Ethernet, IP, TCP, UDP, DNS, DHCP and HTTP or HTTPS.
- 2. Calculate IPv4 prefixes, masks, network addresses, broadcasts and usable host ranges, and interpret the purpose of IPv6 prefixes.
- 3. Design a documented VLAN, subnet, routing and service plan using least privilege and explicit trust boundaries.
- 4. Troubleshoot connectivity with hypotheses, discriminating tests, logs and controlled changes rather than random reconfiguration.
- 5. Produce an auditable network evidence pack that separates safe simulation from authority to access, scan or change a live system.
Deep subject explanation
- 1. Layered networking separates responsibilities. Encapsulation places an application message into transport, network and link-layer data, sends it through physical or wireless media and reverses the process at the destination. A fault may therefore exist at the link, address, route, name-resolution, transport, security or application layer even when another layer appears healthy.
- 2. Ethernet switches forward frames using MAC-address information. A VLAN creates a logical broadcast domain, but communication between VLANs requires an authorised Layer 3 route and policy. Loop prevention, port state and documented uplinks matter because one uncontrolled link can affect an entire segment.
- 3. IPv4 uses 32-bit addresses. A prefix such as /26 reserves 26 network bits and leaves 6 host bits, giving 64 addresses before network and broadcast reservations. Subnet decisions must record the prefix, mask, network, usable range, broadcast, gateway convention and capacity rather than listing isolated addresses.
- 4. IPv6 uses 128-bit addresses and prefixes, with link-local and global scopes. Its large address space does not remove the need for routing, filtering, identity, patching and monitoring. Network address translation is an addressing mechanism, not a substitute for security policy in IPv4 or IPv6.
- 5. Routers compare a destination with their route table and normally select the longest-prefix match. A default gateway is the next hop for destinations outside the local subnet; it cannot repair a wrong mask, duplicate address, missing route or denied policy.
- 6. TCP provides connection-oriented delivery and UDP provides message-oriented delivery with different overhead and reliability properties. Ports identify services. DNS maps names to data, DHCP leases configuration, and HTTP commonly uses TLS as HTTPS. DNS may require both UDP and TCP port 53, so a partial firewall rule can create an intermittent-looking failure.
- 7. Performance evidence distinguishes latency, throughput, packet loss and jitter. A successful ping proves only that a particular exchange worked at that time; it does not prove DNS, TCP establishment, TLS validation, application health, capacity or user authorisation.
- 8. Secure design applies least privilege, segmentation, strong individual identities, protected administration, patch and configuration control, logging, backup and tested rollback. Broad any-any rules, shared administrator accounts and undocumented revisions are release blockers rather than convenient temporary fixes.
- 9. Controlled troubleshooting starts by defining scope and a known-good baseline. It then checks physical or wireless state, link and VLAN, address and mask, gateway and routes, DNS, transport policy, service state and logs. Each test should discriminate between hypotheses, record time and source, avoid destructive changes and preserve a way back.
- 10. All exercises use an authorised sandbox, simulator or supplied synthetic evidence. This lesson does not authorise scanning live targets, capturing other people's traffic, attempting credentials, bypassing controls or changing production infrastructure. Those activities require explicit scope, competent supervision and organisational approval.
Fully worked model
- 1. A training centre divides 10.20.10.0/24 into Staff VLAN 10 at 10.20.10.0/26, Learner VLAN 20 at 10.20.10.64/27 and Services VLAN 30 at 10.20.10.96/28.
- 2. For /26, the block size is 64: network 10.20.10.0, usable hosts 10.20.10.1 to 10.20.10.62 and broadcast 10.20.10.63. The first usable gateway convention gives 10.20.10.1.
- 3. For /27, the block size is 32: network 10.20.10.64, usable hosts 10.20.10.65 to 10.20.10.94 and broadcast 10.20.10.95. Endpoint 10.20.10.70/27 and gateway 10.20.10.65 are valid.
- 4. For /28, the block size is 16: network 10.20.10.96, usable hosts 10.20.10.97 to 10.20.10.110 and broadcast 10.20.10.111. DNS server 10.20.10.100 is within the services subnet.
- 5. The learner endpoint reaches its gateway and the training service by IP, but name resolution fails. A resolver trace shows a truncated UDP response followed by a blocked TCP port 53 retry. The least-privilege correction permits learner clients to reach only the approved DNS server on UDP and TCP port 53; it does not justify learner-to-staff or any-any access.
- 6. Release remains blocked because the topology is revision C while the firewall export is revision B, a temporary learner-to-staff any-any rule remains, administration uses a shared account and no approved rollback exists. Correct addressing and a plausible DNS correction do not override governance failures.
Guided and independent practice
- 1. Partition a supplied /24 with variable-length subnetting for four stated host requirements, then record network, prefix, mask, usable range, broadcast, gateway and spare capacity.
- 2. Use three overlapping routes and a default route to identify the longest-prefix match for each supplied destination and explain the selected next hop.
- 3. Sequence DHCP discovery, lease information, DNS resolution, TCP establishment and HTTPS application access, identifying what evidence could confirm each stage.
- 4. Diagnose a simulated failure set containing a wrong prefix, an absent route, an expired lease, a DNS record error and a stopped service using the fewest discriminating tests.
- 5. Build a source, destination, service, action, justification and owner matrix for learner, staff, service and administration zones using least privilege.
- 6. Audit a configuration pack containing planted defects: revision mismatch, duplicate address, UDP-only DNS permission, any-any rule, shared administrator identity, colour-only topology state and no rollback test.
Understanding, misconception and answer checks
- 1. Why does a successful ping not prove that DNS, HTTPS or the application is working?
- 2. How do an endpoint and mask determine whether a destination is local or must be sent to a gateway?
- 3. Why can a DNS service require both UDP and TCP port 53?
- 4. Why do NAT and a private IPv4 address not replace firewall, identity and patch controls?
- 5. How does longest-prefix matching differ from choosing the first route displayed?
- 6. Which tests require explicit authorisation, and which revision, identity, security or rollback gaps must block release?
Retrieval, review and progression
- 1. After 24 hours, repeat the /26, /27 and /28 network, broadcast and usable-range calculations with a different base network without consulting the worked model.
- 2. After one week, diagnose a new simulated name-resolution and routing incident from incomplete evidence, stating competing hypotheses, discriminating tests and stop conditions.
- 3. Add the checked design, test evidence, security review, feedback, corrections and revision history to the DASKEREL portfolio without credentials, real addresses or unnecessary personal data.
Accessibility and equivalent evidence
- 1. Every topology has a structured text alternative listing devices, interfaces, networks, direction, service, trust boundary and status in a logical reading order.
- 2. Address plans, routes, policies and packet sequences are available as labelled tables; colour is never the only way to distinguish VLAN, state, severity or traffic flow.
- 3. Learners may use enlarged diagrams, tactile topology, keyboard-operable simulation, structured address calculators or dictated reasoning with a transcript when the same criteria are demonstrated.
- 4. Demonstration media require captions, audio description, transcript and a non-video procedure, while practical evidence remains subject to identical authorisation, security and safeguarding controls.
Assessed evidence task
Produce a controlled network-design and verification pack for a simulated training centre. Include an accessible topology description, VLAN and subnet plan, IPv4 calculations, an IPv6 allocation concept, gateway and routing table, DHCP and DNS flow, least-privilege policy matrix, authorised test plan, fault tree, log and configuration evidence, revision history, individual administrative roles, backup and rollback plan, unresolved risks and a conditional release decision. Use only supplied evidence or an authorised sandbox; do not scan, intercept or change a live network.
Retain sources, assumptions, assistance received, feedback, corrections and authorship notes. Do not include unnecessary personal or sensitive information.
Teacher and facilitator delivery guide
Suggested sequence
- Begin with the diagnostic questions and prerequisites; record misconceptions without grading the starting point.
- Teach one chapter at a time using explicit explanation, live modelling, guided practice and a short check before independent work.
- Use foundation practice for repair, standard practice for expected mastery and stretch practice only after the core method is secure.
- Delay answer guidance until a genuine attempt exists, then require correction and an explanation of what changed.
- Finish with the assessed evidence task, rubric-based feedback, learner reflection and a scheduled retrieval review.
Diagnostic questions
- Which part of data representation, hardware, operating systems and networks can the learner explain accurately without prompts?
- Can the learner interpret “Data rate = data transferred ÷ time” and identify its inputs, units, authority or assumptions?
- Which of these misconceptions is already present: encryption removes the need for access control; a high model accuracy proves fairness and fitness for use; successful execution proves that software is correct?
- What language, accessibility, prerequisite or practical support is needed before independent computing and networking work?
Intervention prompts
- Return to a concrete example and non-example before repeating the abstract explanation.
- Reduce the task to one visible reasoning step, obtain an explanation, then reconnect it to the complete method.
- Use a worked-example comparison: identify exactly where two responses diverge and what evidence resolves the difference.
- Offer a glossary, writing frame, labelled diagram or accessible alternative while preserving the same subject criterion.
Extension prompts
- Change a material assumption and evaluate whether “Availability = uptime ÷ total time × 100%” still supports the conclusion.
- Combine algorithms, programming, testing and software design and cybersecurity, privacy, accessibility and responsible systems in an unfamiliar case with incomplete or conflicting evidence.
- Ask the learner to design, justify and mark a new problem, including a misconception trap that cannot be solved by guessing.
Safeguarding and practical boundary: No activity authorises access to another person’s account, production system, confidential data or network without explicit permission.
Assessment rubric
| Criterion | Developing | Secure | Advanced |
|---|---|---|---|
| Knowledge and vocabulary | Uses some relevant terms but leaves important ideas disconnected or imprecise. | Explains the relevant Computing, software, networks, data and AI concepts accurately and connects the required strands. | Selects precise knowledge independently, explains boundaries and integrates ideas across strands. |
| Method and working | Attempts a method but hides steps, units, sources or assumptions. | Applies Data rate = data transferred ÷ time or an appropriate alternative with visible, checkable working. | Compares methods, verifies independently and explains why the selected method is strongest. |
| Evidence and evaluation | Uses evidence descriptively or reaches a conclusion that exceeds it. | Uses versioned source or design and relevant supporting evidence to reach a qualified conclusion. | Challenges evidence quality, tests sensitivity and evaluates the strongest alternative explanation. |
| Communication and reflection | Communicates a result but gives limited structure, accessibility or correction. | Communicates clearly for the audience, records sources and improves the work after feedback. | Adapts communication expertly, documents revisions and identifies a precise next learning step. |