Malta TutorsStudy Resource Preview
← Back to Notes & Samples

ICT / Computing · Computer Networks

Flip through 20 full sample pages with substantial teaching notes, deep-dive explanations, worked practice, exam application and self-check questions.

Page 1 of 20
Overview

Programming and computational thinking

Computing notes should combine concepts with executable reasoning: decomposition, variables, control structures, data representation, testing and algorithm analysis.

  • decomposition
  • sequence/selection/iteration
  • data types
  • algorithms
  • testing
Worked example / practice: A program that calculates an average can be decomposed into input, validation, processing and output.

Deep-dive notes

The central idea on this page is programming and computational thinking. To use it confidently, connect the definition or rule above to the specific details listed here: decomposition; sequence/selection/iteration; data types. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Programming and computational thinking” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain programming and computational thinking without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: Trace code line by line before trying to 'see' the answer.
Property of Malta Tutors · www.maltatutors.com
Algorithms

From problem to steps

An algorithm is a finite sequence of unambiguous steps for solving a problem. It can be expressed in pseudocode, flowcharts or code.

  • inputs
  • processing
  • outputs
  • termination
  • correctness
Worked example / practice: Algorithm: read n values, accumulate total, output total/n.

Deep-dive notes

The central idea on this page is from problem to steps. To use it confidently, connect the definition or rule above to the specific details listed here: inputs; processing; outputs. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “From problem to steps” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain from problem to steps without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: A good algorithm is language-independent.
Property of Malta Tutors · www.maltatutors.com
Variables

Data and state

Variables store values that may change during execution. Constants represent values intended not to change. Data type affects valid operations and storage.

  • integer
  • real/float
  • string
  • Boolean
  • meaningful identifiers
Worked example / practice: age=16 is numeric; '16' is a string and behaves differently in arithmetic.

Deep-dive notes

The central idea on this page is data and state. To use it confidently, connect the definition or rule above to the specific details listed here: integer; real/float; string. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Data and state” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain data and state without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: Do not confuse assignment with mathematical equality.
Property of Malta Tutors · www.maltatutors.com
Selection

Making decisions

Selection chooses between alternative paths based on Boolean conditions.

  • IF/ELSE
  • comparison operators
  • logical AND/OR/NOT
  • nested selection
Worked example / practice: IF mark>=50 THEN result='Pass' ELSE result='Not pass'.

Deep-dive notes

The central idea on this page is making decisions. To use it confidently, connect the definition or rule above to the specific details listed here: IF/ELSE; comparison operators; logical AND/OR/NOT. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Making decisions” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain making decisions without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: Test boundary values such as exactly 50.
Property of Malta Tutors · www.maltatutors.com
Iteration

Repeating work

Loops repeat instructions. Count-controlled loops suit known iteration counts; condition-controlled loops suit repetition until a condition changes.

  • FOR
  • WHILE
  • REPEAT/UNTIL
  • loop variable
  • termination condition
Worked example / practice: Sum 1..10 with a loop by initialising total=0 then adding each value.

Deep-dive notes

The central idea on this page is repeating work. To use it confidently, connect the definition or rule above to the specific details listed here: FOR; WHILE; REPEAT/UNTIL. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Repeating work” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain repeating work without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: Infinite loops usually come from a condition that never becomes false/true.
Property of Malta Tutors · www.maltatutors.com
Arrays

Collections of values

Arrays or lists store multiple values under one variable name and are accessed using an index.

  • indexing
  • traversal
  • length
  • update element
  • bounds
Worked example / practice: To find maximum, start with first element then compare each remaining value.

Deep-dive notes

The central idea on this page is collections of values. To use it confidently, connect the definition or rule above to the specific details listed here: indexing; traversal; length. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Collections of values” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain collections of values without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: Check whether a language indexes from 0 or 1.
Property of Malta Tutors · www.maltatutors.com
Functions

Modular programming

Functions and procedures break programs into reusable units. Parameters pass information in; return values pass results out.

  • parameter
  • argument
  • return
  • local variable
  • abstraction
Worked example / practice: function square(x) returns x*x.

Deep-dive notes

The central idea on this page is modular programming. To use it confidently, connect the definition or rule above to the specific details listed here: parameter; argument; return. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Modular programming” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain modular programming without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: A function name should describe what it computes.
Property of Malta Tutors · www.maltatutors.com
Searching

Linear and binary search

Linear search checks items sequentially. Binary search repeatedly halves a sorted search space.

  • linear works unsorted
  • binary requires sorted data
  • best/worst cases
  • termination
Worked example / practice: Binary search for 42 compares midpoint and discards half the remaining values each step.

Deep-dive notes

The central idea on this page is linear and binary search. To use it confidently, connect the definition or rule above to the specific details listed here: linear works unsorted; binary requires sorted data; best/worst cases. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Linear and binary search” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain linear and binary search without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: State the precondition: binary search needs ordered data.
Property of Malta Tutors · www.maltatutors.com
Sorting

Ordering data

Sorting algorithms illustrate algorithmic efficiency. Bubble sort repeatedly compares adjacent values; other algorithms may divide data or select minimum elements.

  • comparison
  • swap
  • pass
  • sorted region
  • efficiency
Worked example / practice: One bubble-sort pass moves the largest remaining item toward the end.

Deep-dive notes

The central idea on this page is ordering data. To use it confidently, connect the definition or rule above to the specific details listed here: comparison; swap; pass. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Ordering data” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain ordering data without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: Trace with a small list rather than memorising vague descriptions.
Property of Malta Tutors · www.maltatutors.com
Validation

Protecting input quality

Validation checks that input is sensible according to rules; verification checks that data entered matches a source or intended value.

  • range
  • type
  • length
  • format
  • presence
  • check digit
Worked example / practice: Age 300 may pass an integer type check but fail a sensible range check.

Deep-dive notes

The central idea on this page is protecting input quality. To use it confidently, connect the definition or rule above to the specific details listed here: range; type; length. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Protecting input quality” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain protecting input quality without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: Validation does not prove data is factually true.
Property of Malta Tutors · www.maltatutors.com
Testing

Normal, boundary and erroneous data

Systematic testing uses representative inputs and expected outputs. Boundary tests target values at and just around limits.

  • normal
  • boundary
  • invalid/erroneous
  • expected result
  • actual result
Worked example / practice: For allowed age 13–18: test 13,18,12,19 and a typical value such as 15.

Deep-dive notes

The central idea on this page is normal, boundary and erroneous data. To use it confidently, connect the definition or rule above to the specific details listed here: normal; boundary; invalid/erroneous. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Normal, boundary and erroneous data” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain normal, boundary and erroneous data without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: A test is incomplete without an expected outcome.
Property of Malta Tutors · www.maltatutors.com
Boolean logic

AND, OR and NOT

Boolean operators combine conditions. Truth tables help avoid mistakes in compound selection.

  • AND true only if both true
  • OR true if at least one true
  • NOT reverses
  • precedence matters
Worked example / practice: eligible = age>=18 AND hasID.

Deep-dive notes

The central idea on this page is and, or and not. To use it confidently, connect the definition or rule above to the specific details listed here: AND true only if both true; OR true if at least one true; NOT reverses. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “AND, OR and NOT” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain and, or and not without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: Use parentheses to make complex conditions unambiguous.
Property of Malta Tutors · www.maltatutors.com
Data representation

Binary and hexadecimal

Computers represent data using binary states. Hexadecimal provides a compact representation of binary values.

  • bit
  • byte
  • base 2
  • base 16
  • 4 bits per hex digit
Worked example / practice: Binary 1111 = hexadecimal F = decimal 15.

Deep-dive notes

The central idea on this page is binary and hexadecimal. To use it confidently, connect the definition or rule above to the specific details listed here: bit; byte; base 2. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Binary and hexadecimal” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain binary and hexadecimal without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: Write place values when converting rather than guessing.
Property of Malta Tutors · www.maltatutors.com
Images

Pixels, resolution and colour depth

Bitmap images store pixel values. File size depends approximately on width × height × colour depth, before compression.

  • resolution
  • pixel
  • bit depth
  • metadata
  • compression
Worked example / practice: 1920×1080 at 24 bits/pixel requires about 49.8 million bits before compression.

Deep-dive notes

The central idea on this page is pixels, resolution and colour depth. To use it confidently, connect the definition or rule above to the specific details listed here: resolution; pixel; bit depth. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Pixels, resolution and colour depth” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain pixels, resolution and colour depth without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: Distinguish image quality from file size; they are related but not identical.
Property of Malta Tutors · www.maltatutors.com
Networks

Packets and protocols

Networks allow devices to communicate using agreed protocols. Data can be divided into packets containing payload and control information.

  • IP addressing
  • routing
  • packets
  • protocols
  • wired/wireless media
Worked example / practice: A router forwards packets between networks based on addressing information.

Deep-dive notes

The central idea on this page is packets and protocols. To use it confidently, connect the definition or rule above to the specific details listed here: IP addressing; routing; packets. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Packets and protocols” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain packets and protocols without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: Protocol means agreed rules, not a piece of hardware.
Property of Malta Tutors · www.maltatutors.com
Cybersecurity

Threats and controls

Security questions require matching a threat to an appropriate control and explaining how the control reduces risk.

  • malware
  • phishing
  • brute force
  • social engineering
  • encryption
  • MFA
  • backups
Worked example / practice: MFA reduces risk from a stolen password because an attacker also needs another authentication factor.

Deep-dive notes

The central idea on this page is threats and controls. To use it confidently, connect the definition or rule above to the specific details listed here: malware; phishing; brute force. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Threats and controls” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain threats and controls without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: Avoid saying a control makes a system '100% safe'.
Property of Malta Tutors · www.maltatutors.com
Databases

Structured data and keys

Relational databases organise data into tables. Primary keys uniquely identify records; foreign keys link related tables.

  • field
  • record
  • table
  • primary key
  • foreign key
  • query
Worked example / practice: StudentID can identify a student; a Booking table can store StudentID as a foreign key.

Deep-dive notes

The central idea on this page is structured data and keys. To use it confidently, connect the definition or rule above to the specific details listed here: field; record; table. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Structured data and keys” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain structured data and keys without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: Choose keys for uniqueness and stability, not convenience alone.
Property of Malta Tutors · www.maltatutors.com
SQL

Querying relational data

SQL retrieves and manipulates database data. Basic queries combine SELECT, FROM, WHERE and ORDER BY.

  • SELECT fields
  • FROM table
  • WHERE condition
  • ORDER BY
  • aggregate functions
Worked example / practice: SELECT Name FROM Students WHERE Grade=10 ORDER BY Name;

Deep-dive notes

The central idea on this page is querying relational data. To use it confidently, connect the definition or rule above to the specific details listed here: SELECT fields; FROM table; WHERE condition. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Querying relational data” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain querying relational data without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: Use quoted strings where required and match field names exactly.
Property of Malta Tutors · www.maltatutors.com
Practice

Trace and reason

Trace: total=0; FOR i=1 TO 4; total=total+i; NEXT i. Final total is 10.

  • initialise
  • execute each iteration
  • update state
  • record final output
Worked example / practice: Create a trace table with columns i and total: (1,1),(2,3),(3,6),(4,10).

Deep-dive notes

The central idea on this page is trace and reason. To use it confidently, connect the definition or rule above to the specific details listed here: initialise; execute each iteration; update state. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Trace and reason” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain trace and reason without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: Trace tables expose logic errors better than mental simulation.
Property of Malta Tutors · www.maltatutors.com
Summary

Computing revision checklist

You should be able to design algorithms, trace control structures, choose data types, test programs, explain data representation and reason about networks, databases and cybersecurity.

  • algorithmic thinking
  • programming constructs
  • data
  • testing
  • systems
  • security
Worked example / practice: Final challenge: design pseudocode to input 10 marks, validate each 0–100, and output the mean and maximum.

Deep-dive notes

The central idea on this page is computing revision checklist. To use it confidently, connect the definition or rule above to the specific details listed here: algorithmic thinking; programming constructs; data. These are not separate facts to memorise in isolation; they form the reasoning chain you should be able to reconstruct without looking.

A strong revision method is to close the notes after reading this section and reproduce the key idea from memory. Then compare your version with the page, identify any missing terminology, and correct the explanation before moving to practice. This converts passive reading into active retrieval and makes the page useful for both first learning and later revision.

Exam-style application

Possible question: Explain, apply or use the idea of “Computing revision checklist” in a new situation. Start by stating the relevant rule or definition precisely, then use the information in the question, show the intermediate reasoning, and finish with a conclusion that answers the command word.

  1. Identify exactly what the question is asking and underline the command word.
  2. Write the relevant definition, relationship, rule or principle before substituting or applying it.
  3. Use the information given rather than relying on vague general statements.
  4. Show the reasoning in a logical sequence so method marks remain visible.
  5. Check the final answer for units, terminology, plausibility and relevance to the question.

Before you turn the page

  • Can you define or explain computing revision checklist without looking?
  • Can you give one correct example and one common mistake?
  • Can you recognise when this idea should be used in a question?
  • Can you explain your method clearly enough for someone else to follow?
Exam / study tip: Full notes can add OOP, web development, operating systems, Boolean algebra and exam-board-specific programming.
Property of Malta Tutors · www.maltatutors.com
Preview only. Full resources may vary by subject, level and examination board. Property of Malta Tutors.