Free degree-level computing lessons for careful independent study.
Aplailasain by Static Carnival

Degree Level Programmes · Formal Computing Foundations · Lesson 15

Semester 1 Consolidation and Digital Exam Practice

Integrate the first half of the course through exam-style modelling tasks.

Back to coursePreviousNext lesson

Lesson overview

Integrate the first half of the course through exam-style modelling tasks.

CourseFundamentals of Computing
Topic strandAssessment preparation
Assessment styleDigital exam practice
EvidenceWorked answer plus justification

Starter: make the model explicit

Before reading the worked example, write down the objects involved, the claim being made and the notation you expect to use. This prevents the common error of calculating before modelling.

Learning objectives

  • Select the right technique for a mixed problem.
  • Show working clearly enough for digital assessment.
  • Identify and correct a flawed solution.

Learning outcomes

  • By the end of this lesson, you can select the right technique for a mixed problem.
  • By the end of this lesson, you can show working clearly enough for digital assessment.
  • By the end of this lesson, you can identify and correct a flawed solution.

Key vocabulary

revisionmethod selectionworkingchecking

What this lesson is about

Consolidation means combining earlier techniques rather than revising them as isolated facts. A digital exam question may require set notation, number representation and counting in the same scenario.

The focus is method selection, clear working and deciding which formal tool matches which part of a problem.

Terms, acronyms and named methods

These are the phrases and named techniques used in this lesson. Read this section before the worked example so the notation and examples have a clear meaning.

Method selectionPhrase. Choosing the correct formal technique before calculating. Mixed questions often fail when the wrong tool is forced onto the problem.
Boundary casePhrase. A small, extreme or limiting case used to test whether a method or claim still works.
Digital examPhrase. An assessment format where typed working still needs clear definitions, notation and justification.

Formal notation and definitions

A good mixed answer begins by classifying the structure: set, representation, function, matrix or counting problem.State the chosen method before calculation.

How to read the symbols

classificationDeciding which formal tool fits each part of a mixed problem.
boundary caseA small or extreme case used to test whether a method still works.

Use the notation to classify the problem before solving. Mixed questions often need more than one formal tool.

Degree-level reasoning

Mixed formal questions reward classification before calculation. Name the topic, state the relevant definition, then solve.

A polished answer includes enough working that another reader can audit the reasoning without guessing your method.

Do not stop at a correct-looking answer. State why the method is valid, whether the result depends on a hidden assumption, and what would count as a counterexample.

Worked formal model

This section shows the model, notation, calculation and interpretation as one worked answer. The notation is part of the reasoning, not decoration.

1. Context and objects

A mixed question may combine binary representation, a set operation and a counting argument, so the first skill is recognising the topic boundaries.

Objects: the mixed scenario, the sub-problems inside it, and the formal tool assigned to each sub-problem.

Model cue: Use a classification flow: Is the problem about membership, representation, mapping, transformation or counting? Choose the method only after classification.

2. Mathematical working

Problem→{set part,representation part,counting part}\text{Problem}\to\{\text{set part},\text{representation part},\text{counting part}\}Users×Rolesmodels assignmentsUsers\times Roles\quad\text{models assignments}(1011)2=1110models an encoded permission mask(1011)_2=11_{10}\quad\text{models an encoded permission mask}
Plain text version
A good mixed answer begins by classifying the structure: set, representation, function, matrix or counting problem.
State the chosen method before calculation.

Worked use: A mixed question about user-role pairs and binary permissions may require a Cartesian product first, then binary representation for each permission mask. The topics combine because the model has both structured pairs and encoded attributes.

3. How to read the working

  1. Read the first line as decomposition, not calculation: the mixed problem is separated into set, representation and counting parts.
  2. Assign notation to each sub-problem before solving it. Users × Roles is a set/data-model step, while (1011)2 = 11 is a representation step.
  3. Solve each part using its own rules rather than forcing one technique onto the whole question.
  4. Finish by recombining the partial results into one answer to the original computing scenario.

4. Computing meaning and check

The value is in method selection. A mixed question should be decomposed into smaller formal tasks before any calculation is attempted.

Now check: Write a mixed question using two Semester 1 topics and mark which part of the solution belongs to which topic.

Worked example

From scenario to formal reasoning

Scenario: A mixed question may combine binary representation, a set operation and a counting argument, so the first skill is recognising the topic boundaries.

Method: Use the definitions and notation introduced above, then state what the result means in this computing scenario.

Reveal model answer

A mixed question about user-role pairs and binary permissions may require a Cartesian product first, then binary representation for each permission mask. The topics combine because the model has both structured pairs and encoded attributes.

Worked solution structure

How a strong answer should be written

  1. Define: State the domain and the objects under discussion. For this lesson, begin from A good mixed answer begins by classifying the structure: set, representation, function, matrix or counting problem.
  2. Apply: Use the relevant definition from assessment preparation; do not rely on the diagram, wording or intuition alone.
  3. Check: Test a boundary case, counterexample candidate or representation limit.
  4. Conclude: Write one sentence that connects the formal result back to the computing scenario.

Common misconception

A common mistake is revising topics separately but freezing when they are combined. Exam preparation should include mixed classification practice.

Guided practice

  1. Create a mixed problem involving user-role pairs and binary permission masks.
  2. Label which part of the solution uses Cartesian products and which part uses number representation.
  3. Add a counting question about how many valid assignments remain after one restriction.
  4. Write a short marking note explaining what evidence a digital-exam answer must show.

Quick checks

1. What is the first move in a mixed formal question?

2. A user-role pair is best modelled first with:

Digital exam practice

Example exam task

A system has Users = {u1,u2}, Roles = {reader, editor}, and stores a 4-bit permission mask such as (1011)_2 for each assignment. Decompose the problem into set/data modelling, number representation and counting parts, then solve one part from each topic.

Notation toolkit

A×BA\times B

Means: all ordered pairs from two sets

How to use: Use it for the data-modelling part of a mixed question.

(n)2(n)_2

Means: a numeral read in binary

How to use: Use it when a permission mask or stored pattern appears.

∣S∣|S|

Means: the size of a set S

How to use: Use it when the final part of a mixed problem asks how many options remain.

What a good answer is expected to show

A strong answer for this lesson defines the mixed scenario, the sub-problems inside it, and the formal tool assigned to each sub-problem, applies the assessment preparation method with visible working, and finishes by interpreting the result in the computing scenario.

How to solve it

  1. Read the first line as decomposition, not calculation: the mixed problem is separated into set, representation and counting parts.
  2. Assign notation to each sub-problem before solving it. Users × Roles is a set/data-model step, while (1011)2 = 11 is a representation step.
  3. Solve each part using its own rules rather than forcing one technique onto the whole question.
  4. Finish by recombining the partial results into one answer to the original computing scenario.

Model answer

Reveal model answer
Assignments⊆Users×RolesAssignments\subseteq Users\times Roles(1011)2=1⋅23+0⋅22+1⋅21+1⋅20=1110(1011)_2=1\cdot2^3+0\cdot2^2+1\cdot2^1+1\cdot2^0=11_{10}mixed problem=set model+number representation+counting argument\text{mixed problem}=\text{set model}+\text{number representation}+\text{counting argument}

The assignment model uses Users × Roles or a selected relation inside it. A 4-bit permission mask such as (1011)_2 represents decimal 11. If a restriction removes one user-role pair, the count is the number of remaining valid pairs times the number of permitted masks. A strong answer labels the set, representation and counting parts separately.

Practise next

  1. Create a mixed problem involving user-role pairs and binary permission masks.
  2. Label which part of the solution uses Cartesian products and which part uses number representation.

Self-marking criteria

  • Separates the mixed scenario into named topic parts.
  • Uses Cartesian product or relation notation for assignments.
  • Converts or interprets one binary mask.
  • Counts valid configurations under a stated restriction.
  • Presents typed working clearly enough for audit.

Extension

Change one assumption in the worked scenario and decide whether the same method still applies. If it does not, name the exact point where the reasoning breaks.

Study route

Save one clean worked answer from this lesson. Include the problem statement, notation, working, final answer and a short note explaining the computing meaning of the result.

Next lesson: Relations: Definitions, Tables, Graphs and Matrices.