Background Concept

To store sound on a computer, an original analogue sound wave must be converted into digital data. This is done by sampling.

There are two important measurements:

• sampling rate: how often the sound wave is measured per second
• sampling resolution: how many bits are used to store each measured value

The original sound wave before digitisation is analogue, meaning it is continuous rather than stored as discrete binary values.

Understanding the Question

You are given three descriptions and must write the correct technical term for each one.

This is a vocabulary-matching question about sound representation. No calculations are needed.

Approach

Match each description to the sound term it defines:

1. "number of times the amplitude is measured per time interval" → this is how often samples are taken
2. "number of bits used to store each amplitude measurement" → this is how precisely each sample is stored
3. "type of sound wave before it is recorded by a computer" → this is the continuous real-world signal

Step-by-Step Reasoning

The first description refers to how many measurements are taken in a period of time. In digital audio, that is called the sampling rate.

The second description refers to the number of bits used for each sampled amplitude value. That is called the sampling resolution.

The third description refers to the form of the sound before a computer records it. Real sound waves are continuous, so the term is analogue.

Key Takeaways

• Sampling rate = frequency of measurement.
• Sampling resolution = bits per sample.
• Analogue sound is continuous and must be digitised for storage in a computer.

Common Mistakes

• Mixing up sampling rate and sampling resolution: rate is how often; resolution is how many bits.
• Writing digital instead of analogue for the original wave.
• Using image terminology like bit depth instead of the sound term the syllabus expects.

Things to Be Careful About

• If the question asks for the term for "how often", use sampling rate.
• If it asks for "how many bits per amplitude measurement", use sampling resolution.
• Keep the meanings separate: one affects time detail, the other affects amplitude precision.

Background Concept

Cache memory is a small amount of very fast memory located very close to, or inside, the CPU. Its purpose is to hold data and instructions that are used often or are likely to be needed soon.

Main memory (RAM) is much larger than cache, but it is slower to access. If the processor had to get everything from RAM every time, it would spend more time waiting.

Cache improves performance by reducing this waiting time. When the required data or instruction is already in cache, the CPU can access it much more quickly.

Understanding the Question

The question asks for one benefit of using cache memory. That means you do not need a long list. You need one clear benefit, described properly.

The best benefit to describe is speed:

• cache is faster than RAM
• frequently used items are stored there
• the CPU waits less
• overall performance improves

Approach

A full answer should make a cause-and-effect chain:

1. cache stores frequently used data or instructions
2. cache can be accessed faster than RAM
3. therefore the CPU spends less time waiting
4. therefore the computer performs better

That gives a proper description rather than just saying "it is faster".

Step-by-Step Reasoning

The CPU repeatedly needs instructions and data while programs run.

If every access had to go to RAM, the CPU would often pause while waiting for memory access to complete.

Cache memory helps by keeping commonly needed items in a much faster memory area.

So when the CPU needs one of those items:

• it checks cache
• finds it there
• reads it more quickly than from RAM

Because this happens many times each second, the total reduction in waiting time makes the system run faster.

That is why the benefit is usually described as improved performance due to faster access to frequently used data and instructions.

Key Takeaways

• Cache is small but very fast.
• It stores frequently used data and instructions.
• Faster access means less CPU waiting time.
• Less waiting improves system performance.

Common Mistakes

• Saying cache is a type of permanent storage. It is not; it is temporary memory.
• Saying cache stores everything from RAM. It stores selected data and instructions, not all of RAM.
• Giving a vague answer such as "it makes the computer better" without explaining why.

Things to Be Careful About

• Compare cache with RAM in terms of speed, not capacity.
• Make it clear that the benefit comes from reducing access time.
• Do not confuse cache with virtual memory or secondary storage.

Background Concept

A peripheral device is a device connected to a computer, such as a monitor, printer, keyboard or external drive. To connect peripherals, a computer uses ports. A port is a physical interface or socket into which a matching connector is plugged.

HDMI stands for High Definition Multimedia Interface. It is a standard designed to carry digital multimedia signals, especially video and audio, between devices.

Unlike older standards that might need separate cables for sound and picture, HDMI can carry both through one cable.

Understanding the Question

The question gives a specific example: a monitor connected using an HDMI cable and HDMI port. It asks how HDMI provides connection to peripheral devices.

So the answer should explain two things:

• the HDMI port is the interface used for the physical connection
• the HDMI cable carries the digital signals between the computer and the monitor or other compatible peripheral

Because it is only 2 marks, a concise explanation covering both ideas is enough.

Approach

To answer well:

1. define HDMI as a port/interface standard for connection
2. explain that a cable plugs into the port
3. state that it transfers digital audio and video signals

That covers both the connection mechanism and what HDMI is used to transmit.

Step-by-Step Reasoning

The first part of the explanation is physical connection. The computer has an HDMI port, which is a socket designed for an HDMI connector. A compatible device, such as a monitor, also has an HDMI port. The cable plugs into both ends, linking the two devices.

The second part is data transfer. Once connected, the HDMI cable carries digital signals. For a monitor, the most important signal is video, but HDMI can also carry audio.

So HDMI provides peripheral connection in two senses:

• it gives a standard physical interface
• it provides a path for multimedia data to travel between devices

That is why a complete answer mentions both the port and the digital audio/video transmission.

Key Takeaways

• A port is the physical interface used to connect a peripheral.
• HDMI is a standard port and cable type.
• HDMI carries digital video and audio signals.
• One HDMI cable can provide a multimedia connection between a computer and a compatible peripheral such as a monitor.

Common Mistakes

• Saying HDMI is only a cable and not mentioning the port/interface.
• Saying HDMI connects any peripheral without recognising that it is mainly for multimedia devices such as monitors, TVs and projectors.
• Mentioning internet or network communication. HDMI is not a networking technology.
• Saying it carries analogue signals. HDMI carries digital signals.

Things to Be Careful About

• Use the term port or interface correctly: it is the connection point on the device.
• Mention that HDMI carries audio and video, not just one of them, unless the question specifically narrows it.
• Do not confuse HDMI with USB. Both are ports, but they are used for different kinds of peripherals and data.

Background Concept

A compiler translates the whole source program before execution. It checks the program as a complete unit and, if translation succeeds, produces a translated form such as object code or an executable. That translated program can then be run later without needing the original source code to be translated again.

An interpreter works differently. It translates and executes the program one line at a time. If it reaches a line with an error, execution cannot continue from that point, so it stops and reports the error. This makes testing and debugging easier because the programmer can fix the problem and continue.

Understanding the Question

This question gives a paragraph about compilers and interpreters with four gaps. Each gap is asking for a standard term or action:

• what a compiler produces
• what code it no longer needs access to when running
• what an interpreter does when it finds an error
• when the programmer can correct that error

So this is mainly a precise terminology question from translator theory.

Approach

Use the standard comparison:

• Compiler: whole program first, then produces object code, which runs without the source code.
• Interpreter: line by line, so on an error it stops, the programmer fixes it immediately, then translation/execution can continue.

The safest method is to fill each blank with the exact textbook term rather than a long sentence.

Step-by-Step Reasoning

The first sentence says the compiler has found no errors and then produces something that can run. The standard product of compilation is object code.

The next blank asks what it can run without access to. Once compiled, the translated program does not need the original source code in order to run.

For the interpreter section, the question says it translates one line and then runs it before moving on. If that line has an error, the interpreter cannot proceed past that line, so it stops and displays the error.

The last blank asks when the programmer can correct the error. One advantage of an interpreter is immediate debugging, so the error can be corrected immediately.

Key Takeaways

• A compiler translates the whole program before execution.
• A successful compilation produces object code.
• An interpreted program is translated and executed line by line.
• Interpreters stop at the first error reached during execution, which supports immediate correction.

Common Mistakes

• Writing machine code instead of object code when the syllabus wording expects object code.
• Writing program instead of source code for the second blank; the question is testing the technical term.
• Saying the interpreter reports all errors. That is compiler behaviour, not interpreter behaviour.
• Writing later instead of immediately for when the programmer corrects the error.

Things to Be Careful About

• Use the precise terms normally used in Cambridge answers: object code and source code.
• Do not confuse what the compiler produces with what the programmer originally writes.
• For interpreters, remember the sequence is translate one line, run it, then move on. That is why it stops at the faulty line rather than listing every error in the whole program.

Background Concept

Keeping files secure involves protecting them in different situations. Two important situations here are:

• during transmission over the internet
• while stored on the computer

A method suitable for one situation is not always the best for the other. For transmission, a common risk is that data could be intercepted, so encryption is a strong method because it makes the content unreadable without a key.

For files stored on a computer, a common risk is unauthorised access by another user or account. Access rights control who is allowed to read, write, edit or delete the file.

Understanding the Question

The question already says the files are protected by a password, so you must give one other method for transmission and one other method for protection on the computer. It also says the methods must be different.

That means you cannot repeat password protection, and you should not use the same method for both rows. You also need to say how each method protects the data, not just name it.

Approach

Pick one method that clearly matches each context:

• For during transmission, choose encryption because it directly protects data travelling across a network.
• For on the computer, choose access rights because it restricts who can open or modify the files.

Then explain each one in terms of what threat it blocks.

Step-by-Step Reasoning

For the transmission row, the main risk is interception while the data travels across the internet. If the files are encrypted, the original readable data, called plaintext, is transformed into ciphertext. If an attacker intercepts the transmission, they should not be able to understand the contents unless they also have the decryption key. That is a direct explanation of how the data is protected.

For the on-computer row, the main risk is that an unauthorised person using the machine or network may try to open, copy or change the file. Access rights solve this by assigning permissions. For example, some users may be allowed to read a file, while only certain authorised users may edit or delete it. That means the data is protected from unauthorised viewing or alteration.

Other methods could sometimes be credited in similar questions, such as anti-malware, firewall, or backup, but the key is always matching the method to the situation and explaining its effect clearly.

Key Takeaways

• Security methods should be matched to the context in which the data is at risk.
• Encryption is especially suitable for protecting data in transit.
• Access rights are especially suitable for protecting stored files from unauthorised access.
• Naming a method is not enough; you must explain how it protects the data.

Common Mistakes

• Repeating password even though the question asks for one other method.
• Using the same method for both rows when the question says the methods must be different.
• Naming a method without explaining its effect, for example just writing encryption with no mention of ciphertext or unreadability.
• Giving a vague explanation such as it keeps data safe without stating what the method actually does.

Things to Be Careful About

• Read the context words carefully: during transmission and on the computer are different situations.
• Make sure the method and the explanation match each other. For example, if you write access rights, the explanation should be about permissions and authorised users, not about interception on a network.
• Keep the methods different, as the question explicitly requires this.

Background Concept

In a client-server model, one or more clients request services from a central server. The server stores data or runs services, and the clients connect to it across a network.

A client is the device or software used by the end user to access the service. A server is the central system that responds to requests, stores shared data, and often manages many users at the same time.

This model is very common for websites, browser-based applications, email systems and online games, especially when many users need access to the same shared resource.

Understanding the Question

The question describes a game in a virtual world where:

• users can play from any computer with internet access
• they use a web browser
• they can interact with other users

You are asked to explain why this shows a client-server model. So you need to connect features of the scenario to the characteristics of client-server systems.

Approach

Look for evidence of both parts of the model:

• what acts as the client
• what must be acting as the server

Then explain how they communicate. The browser on each user's machine is the client side. A central system must host the game and shared world state, so that is the server side. Because users interact with each other, the shared data must be coordinated centrally.

Step-by-Step Reasoning

The phrase any computer with internet access using a web browser strongly suggests that the user's device is not holding the whole shared game system locally. Instead, the user opens a browser and connects to a remote service. That user computer and browser therefore act as the client.

If there are clients, there must be something they connect to. For the game to exist as a shared virtual world, a central computer must host the game resources, user accounts, game state, and communication services. That central computer is the server.

In a client-server system, the client sends a request and the server responds. In this game, clients would request pages, game updates, account information, or send actions such as movement, messages, or commands. The server processes those requests and sends the appropriate data back.

The fact that users can interact with other users is especially important. In a multiplayer environment, all players need a consistent shared world. A central server is well suited to this because it can store and update the world state for everyone, manage sessions, and pass information between users. That is a classic reason why the statement is correct.

Key Takeaways

• In a client-server model, clients request services from a central server.
• A browser-based system normally means the user's machine is acting as the client.
• Shared multiplayer systems commonly use servers to manage common data and communication.
• Evidence from the scenario should be linked directly to the model, not just defined in general terms.

Common Mistakes

• Only defining client-server without referring to the game scenario.
• Saying the users' computers are the server. In this scenario they are the clients.
• Describing peer-to-peer behaviour instead, where each user device shares directly without a central server.
• Ignoring the clue that users interact with other users, which strongly suggests central coordination.

Things to Be Careful About

• Use the scenario details as evidence: web browser, internet access, and interaction with other users are all clues.
• Do not drift into talking only about hardware or only about websites; keep the explanation focused on the model.
• Make sure you mention both roles: the clients and the server.

Background Concept

A professional ethical body is an organisation such as the BCS or IEEE that promotes standards of professional behaviour. These bodies usually provide:

• a code of ethics or code of conduct
• guidance on good professional practice
• updates on standards, law and emerging issues
• professional recognition and credibility

Membership does not automatically make someone ethical, but it does mean they are choosing to associate themselves with recognised professional standards.

Understanding the Question

The question asks for the possible consequences if the programmer does not join a professional ethical body. So it is not asking for a definition of such a body. It is asking what the programmer may lose or what risks may increase because they are outside that professional framework.

Approach

Think about what membership gives a programmer, then reverse it:

• If membership gives an ethical code, non-membership means no formal commitment to that code.
• If membership gives guidance and updates, non-membership means the programmer may miss them.
• If membership gives professional recognition, non-membership may reduce trust from employers or clients.

That gives three clear consequences.

Step-by-Step Reasoning

First, professional bodies usually expect members to follow a recognised ethical code. If the programmer does not join, they are not committing themselves to that code through membership. This can increase the chance of poor decisions, such as mishandling user data, ignoring professional responsibilities, or cutting corners.

Second, professional bodies often provide training materials, advice, and updates about standards, legislation and good practice. Without membership, the programmer may be less well informed. That could lead to mistakes, outdated working methods, or even legal and ethical problems.

Third, membership can act as evidence of professionalism. If the programmer is not a member, some employers or clients may see them as less credible or less committed to professional standards. That could reduce trust, damage reputation, or limit career opportunities.

A strong answer does not need to claim that all non-members are unethical. It only needs to explain sensible possible consequences of not joining.

Key Takeaways

• Professional bodies support ethical and professional standards.
• Not joining can mean less ethical guidance, fewer updates, and reduced professional recognition.
• Questions on ethics often reward consequences that affect behaviour, legality, trust and reputation.

Common Mistakes

• Saying that a non-member is automatically unethical. That is too absolute.
• Only describing what a professional body is, without stating a consequence of not joining.
• Giving consequences unrelated to ethics or professionalism, such as computer performance or program speed.
• Repeating the same idea in different words instead of giving distinct consequences.

Things to Be Careful About

• Use cautious wording such as may, could, or greater risk, because the question asks for possible consequences.
• Keep the focus on professional ethics and standards, not on technical security methods or program design.
• Make sure each point is a real consequence, not just a restatement that they are not a member.

Background Concept

A logic circuit is translated into a logic expression by reading the circuit from left to right. Each gate produces an output based on its inputs:

• AND outputs 1 only if both inputs are 1.
• OR outputs 1 if at least one input is 1.
• NOT inverts a single input.
• NOR means NOT OR, so it is the inverse of OR.
• XOR outputs 1 only when its two inputs are different.

When gates are connected in stages, the output from an earlier gate becomes part of the input to a later gate. That means the expression is often built in layers.

Understanding the Question

You are given a circuit with inputs A, B, C and D, and you must write the expressions for outputs X and Y.

For X, the top branch uses two NOR gates in sequence. So you first form the output of the first NOR gate, then use that result with B in the second NOR gate.

For Y, the lower branch has an AND gate using B and C, a NOT gate using D, and then an XOR gate combining those two results.

Approach

Work one gate at a time.

1. Find the inputs to the first gate.
2. Write the output of that gate as a sub-expression.
3. Follow the wire to the next gate and include the sub-expression there.
4. Repeat until you reach the labelled output.

This avoids trying to write the whole expression in one step, which is where most mistakes happen.

Step-by-Step Reasoning

For output X:

• A and C go into a NOR gate.
• So the first sub-expression is A NOR C.
• That result and B then go into another NOR gate.
• Therefore the full expression is:
  • X = (A NOR C) NOR B

For output Y:

• B and C go into an AND gate.
• So one input to the final gate is B AND C.
• D goes through a NOT gate.
• So the other input to the final gate is NOT D.
• These two results go into an XOR gate.
• Therefore:
  • Y = (B AND C) XOR (NOT D)

That matches the structure of the circuit exactly.

Key Takeaways

• Translate a circuit by following the wires from left to right.
• Build expressions one gate at a time.
• Use brackets when one gate's output feeds another gate.
• NOR and NAND already include a NOT, so do not add an extra inversion unless the circuit shows one.

Common Mistakes

• Writing A OR C instead of A NOR C for the first gate in X.
• Forgetting that X uses the output of the first gate together with B in a second NOR gate.
• Writing B XOR C for Y instead of B AND C.
• Forgetting to invert D before it enters the XOR gate.
• Omitting brackets, which can make the grouping unclear.

Things to Be Careful About

• Read the bubble on the output of a gate carefully: that indicates inversion, so OR with a bubble is NOR.
• Make sure you use the correct gate name from the symbol, especially AND versus XOR.
• Keep the exact wire connections correct; a crossing wire is not automatically a connection unless a junction is shown.
• For exam answers, a structurally correct unsimplified expression is acceptable and safest here.

Background Concept

A truth table lists every possible combination of input values and shows the output for each one. With three inputs A, B and C, there are 8 possible rows.

This expression uses several logic operations:

• A OR B is 1 if either input is 1.
• NOT A flips A.
• NOT A NAND C means first combine NOT A and C with AND, then invert the result. In other words, NAND is the opposite of AND.
• XOR gives 1 when the two values being compared are different. For a chain of XORs, evaluate across the row step by step.

So the key skill is breaking a long expression into smaller intermediate results.

Understanding the Question

You must complete the truth table for:

X = (A OR B) XOR (B OR C) XOR (NOT A NAND C)

The question gives all 8 input combinations already. Your job is to work out the value of X for each row. The "Working space" column is there so you can show the intermediate results used to reach the final answer.

The important clue is that this is a compound logic expression. That means you should not try to guess the answer directly. Instead, calculate each bracketed part first.

Approach

For every row:

1. Find A OR B.
2. Find B OR C.
3. Find NOT A.
4. Use NOT A and C to get NOT A NAND C.
5. XOR the three resulting values.

A very reliable method is to write the three values in the working column as something like 1 XOR 0 XOR 1, then reduce it from left to right.

Step-by-Step Reasoning

Let:

• P = A OR B
• Q = B OR C
• R = NOT A NAND C

Now evaluate each row.

Row 1: A=0, B=0, C=0

• P = 0 OR 0 = 0
• Q = 0 OR 0 = 0
• NOT A = 1
• 1 AND 0 = 0, so R = NAND = 1
• X = 0 XOR 0 XOR 1 = 1

Row 2: A=0, B=0, C=1

• P = 0 OR 0 = 0
• Q = 0 OR 1 = 1
• NOT A = 1
• 1 AND 1 = 1, so R = NAND = 0
• X = 0 XOR 1 XOR 0 = 1

Row 3: A=0, B=1, C=0

• P = 0 OR 1 = 1
• Q = 1 OR 0 = 1
• NOT A = 1
• 1 AND 0 = 0, so R = NAND = 1
• X = 1 XOR 1 XOR 1
• 1 XOR 1 = 0, then 0 XOR 1 = 1

Row 4: A=0, B=1, C=1

• P = 0 OR 1 = 1
• Q = 1 OR 1 = 1
• NOT A = 1
• 1 AND 1 = 1, so R = NAND = 0
• X = 1 XOR 1 XOR 0
• 1 XOR 1 = 0, then 0 XOR 0 = 0

Row 5: A=1, B=0, C=0

• P = 1 OR 0 = 1
• Q = 0 OR 0 = 0
• NOT A = 0
• 0 AND 0 = 0, so R = NAND = 1
• X = 1 XOR 0 XOR 1
• 1 XOR 0 = 1, then 1 XOR 1 = 0

Row 6: A=1, B=0, C=1

• P = 1 OR 0 = 1
• Q = 0 OR 1 = 1
• NOT A = 0
• 0 AND 1 = 0, so R = NAND = 1
• X = 1 XOR 1 XOR 1
• 1 XOR 1 = 0, then 0 XOR 1 = 1

Row 7: A=1, B=1, C=0

• P = 1 OR 1 = 1
• Q = 1 OR 0 = 1
• NOT A = 0
• 0 AND 0 = 0, so R = NAND = 1
• X = 1 XOR 1 XOR 1 = 1

Row 8: A=1, B=1, C=1

• P = 1 OR 1 = 1
• Q = 1 OR 1 = 1
• NOT A = 0
• 0 AND 1 = 0, so R = NAND = 1
• X = 1 XOR 1 XOR 1 = 1

So the final X values down the table are:
1, 1, 1, 0, 0, 1, 1, 1

Key Takeaways

• Break long logic expressions into smaller parts before finding the final output.
• NAND means AND first, then invert.
• When you see NOT A NAND C, apply NOT to A before the NAND step.
• A truth table is safest when completed row by row in a fixed order.

Common Mistakes

• Treating NOT A NAND C as NOT (A NAND C), which is a different expression.
• Forgetting that NAND is the inverse of AND.
• Making an error with XOR by treating it like OR. XOR only gives 1 when the compared values are different.
• Skipping intermediate working and then losing track of where an output value came from.
• Not evaluating NOT A before using it in the NAND part.

Things to Be Careful About

• Respect the brackets: each bracketed term should be found before the XOR operations.
• Keep the input rows in the exact order given in the table.
• If you use the working space, make sure the values written there really are the three term results, not the raw inputs.
• Be consistent with XOR across three values: reduce it step by step rather than mentally jumping to an answer.
• In exam questions, one wrong intermediate value can affect the final X, so careful row-by-row checking is worthwhile.

Background Concept

Bit manipulation works by using logic operations on individual bits in a register. The three common operations here are:

• AND with a mask: used to clear bits or test selected bits
• OR with a mask: used to set selected bits to 1
• XOR with a mask: used to toggle selected bits

The key rule for OR is:

• 0 OR x = x
• 1 OR x = 1

So if you want to force one bit to become 1 while leaving all other bits unchanged, you use an OR mask that has:

• 1 in the bit position you want to set
• 0 everywhere else

Understanding the Question

The register already contains some unknown 8-bit value. You need an instruction that works for any such value and makes only the most significant bit become 1.

The most significant bit in an 8-bit register is the leftmost bit:

b7 b6 b5 b4 b3 b2 b1 b0

So the required mask is:

10000000

That mask affects only the leftmost bit.

Approach

Use OR, because OR is the operation that sets chosen bits to 1.

Build a mask with:

• 1 in the most significant bit position
• 0 in every other position

Then OR the accumulator with that mask.

Step-by-Step Reasoning

Suppose the register contains any 8-bit value, for example:

01010110

OR with the mask:

10000000

Bit by bit:

• Leftmost bit: 0 OR 1 = 1
• All other bits: each original bit is ORed with 0, so it stays the same

Result:

11010110

If the original most significant bit was already 1, for example:

10100101

then:

10100101 OR 10000000 = 10100101

So the bit is still 1, and the other bits are unchanged.

That is exactly what the question asks for.

Therefore the correct instruction is:

OR B10000000

Equivalent masks such as OR #128 or OR &80 represent the same bit pattern, but the binary form shows most clearly why it works.

Key Takeaways

• Use OR to set bits to 1.
• Use a mask with 1 only where you want a forced 1.
• Use 0 in all other mask positions to preserve the original bits.
• For an 8-bit most significant bit, the mask is 10000000.

Common Mistakes

• Using AND B10000000. That would clear the other seven bits instead of leaving them unchanged.
• Using XOR B10000000. That would toggle the most significant bit, not guarantee it becomes 1.
• Using the wrong mask such as 00000001, which sets the least significant bit instead.
• Forgetting that the register is 8-bit and writing too many or too few bits in the mask.

Things to Be Careful About

• "Set only the most significant bit to 1" means force that bit to 1 while not altering the others.
• The instruction must work for any starting value, so the operation must be unconditional and safe in all cases.
• Keep the mask aligned correctly: in 8 bits the most significant bit is the far-left bit.
• Binary, hexadecimal and denary masks can all be equivalent, but make sure the value really is 128 decimal or &80 hexadecimal if you use a different representation.

Background Concept

An entity-relationship (E-R) diagram shows the structure of a relational database visually. Each table is treated as an entity, and the lines between entities show relationships.

The key idea is to use keys to work out how tables are linked:

• A primary key uniquely identifies one record in a table.
• A foreign key stores the primary key value from another table.
• If table X contains a foreign key from table Y, then many records in X can usually relate to one record in Y.

That usually gives a one-to-many relationship:

• the parent table is on the "one" side
• the child table containing the foreign key is on the "many" side

A crow's foot is drawn on the many side.

Understanding the Question

You are given five tables:

• CUSTOMER(CustomerID, CustomerName, Email)
• ORDER(OrderID, CustomerID, Date, Collected)
• ORDER_PRODUCT(OrderID, ProductID, Quantity)
• PRODUCT(ProductID, ProductName, QuantityInBox, Cost, SupplierID)
• SUPPLIER(SupplierID, SupplierName, SupplierEmail)

The task is to complete the E-R diagram by adding the correct relationship lines and cardinalities.

The important clue is the foreign keys already visible in the table structures:

• ORDER contains CustomerID
• ORDER_PRODUCT contains OrderID
• ORDER_PRODUCT contains ProductID
• PRODUCT contains SupplierID

Each of those tells you which table links to which other table.

Approach

The safest method is:

1. Look for a field in one table that matches the primary key of another table.
2. Treat that matching field as a foreign key.
3. Put the "one" side at the table whose primary key is being referenced.
4. Put the crow's foot at the table that can contain many matching records.

For this question, every relationship is one-to-many.

Step-by-Step Reasoning

Start with CUSTOMER and ORDER.

• ORDER contains CustomerID.
• That means each order belongs to one customer.
• A customer can place many orders.
• So the relationship is CUSTOMER 1 : many ORDER.

Now ORDER and ORDER_PRODUCT.

• ORDER_PRODUCT contains OrderID.
• Each row in ORDER_PRODUCT belongs to one order.
• One order can contain many rows in ORDER_PRODUCT because an order can include several products.
• So the relationship is ORDER 1 : many ORDER_PRODUCT.

Now PRODUCT and ORDER_PRODUCT.

• ORDER_PRODUCT also contains ProductID.
• Each row in ORDER_PRODUCT refers to one product.
• A product can appear in many different order-product rows across different orders.
• So the relationship is PRODUCT 1 : many ORDER_PRODUCT.

Finally SUPPLIER and PRODUCT.

• PRODUCT contains SupplierID.
• Each product has one supplier.
• One supplier can supply many products.
• So the relationship is SUPPLIER 1 : many PRODUCT.

This gives the completed E-R structure shown below.

Key Takeaways

• Foreign keys are the main clue for drawing E-R relationships.
• The table with the foreign key is usually the many side.
• A linking table such as ORDER_PRODUCT is used to break a many-to-many relationship into two one-to-many relationships.

Common Mistakes

• Reversing the cardinality, for example putting the crow's foot on CUSTOMER instead of ORDER.
• Drawing a direct many-to-many relationship between ORDER and PRODUCT and ignoring ORDER_PRODUCT.
• Missing the SUPPLIER to PRODUCT relationship because it is lower in the diagram.
• Assuming every pair of tables must be connected directly. Only tables linked by keys should be connected.

Things to Be Careful About

• ORDER_PRODUCT is the intersection table, so it must connect to both ORDER and PRODUCT.
• ORDER contains CustomerID, not the other way round, so ORDER is the many side.
• PRODUCT contains SupplierID, so PRODUCT is the many side of the supplier relationship.
• Keep each relationship as one-to-many exactly as implied by the schema.

Background Concept

INSERT INTO is an SQL Data Manipulation Language (DML) command used to add a new record to a table.

The general form is:

INSERT INTO TableName (Field1, Field2, Field3)
VALUES (Value1, Value2, Value3);

Important rules:

• text values are usually written in quotes
• numeric values are not quoted
• the values must match the field order listed in the statement
• using an explicit field list is safer than relying on the table's default column order

Understanding the Question

You must add one new row to the PRODUCT table.

The table structure is:

PRODUCT(ProductID, ProductName, QuantityInBox, Cost, SupplierID)

The given values are:

• ProductID = 002323
• ProductName = Blue ball point 2mm
• QuantityInBox = 50
• Cost = $5.00
• SupplierID = SFX223

So the job is simply to write one correct INSERT statement that places those values into the correct fields.

Approach

Take the fields in the same order as the table definition, then write the matching values in the VALUES clause.

Use quotes for the ID fields and product name because they are text. Use unquoted numbers for QuantityInBox and Cost.

Step-by-Step Reasoning

The table is PRODUCT, so the statement starts:

INSERT INTO PRODUCT

Then list the fields being filled:

(ProductID, ProductName, QuantityInBox, Cost, SupplierID)

Now match the values carefully:

• ProductID gets '002323'
• ProductName gets 'Blue ball point 2mm'
• QuantityInBox gets 50
• Cost gets 5.00
• SupplierID gets 'SFX223'

That produces:

INSERT INTO PRODUCT (ProductID, ProductName, QuantityInBox, Cost, SupplierID)
VALUES ('002323', 'Blue ball point 2mm', 50, 5.00, 'SFX223');

Using the field list makes the answer robust even if the physical column order in the DBMS differs.

Key Takeaways

• Use INSERT INTO ... VALUES ... to add a row.
• Match each value to the correct field.
• Quote string data; do not quote numeric data.

Common Mistakes

• Putting the values in the wrong order.
• Forgetting quotes around text such as the product name or supplier ID.
• Quoting all values, including numbers, unnecessarily.
• Omitting one field or one value so the counts do not match.

Things to Be Careful About

• 002323 may need to be treated as text because it has leading zeros.
• SFX223 is clearly alphanumeric, so it must be quoted.
• If the exam uses the table name PRODUCT, keep that identifier exactly.
• The script is for adding one record only, not creating the table.

Background Concept

When a query needs data from more than one table, SQL uses a join. A join links rows using matching key values, usually a primary key in one table and a foreign key in another.

This question also needs an aggregate:

• COUNT(...) counts matching rows.
• GROUP BY forms groups so the count is calculated separately for each group.
• AS gives a result column a clearer title.

A WHERE clause is used before grouping to filter the rows included in the count.

Understanding the Question

You need to return:

• the customer name
• the number of orders not collected by that customer
• with the count labelled NotCollected

The relevant tables are:

• CUSTOMER(CustomerID, CustomerName, Email)
• ORDER(OrderID, CustomerID, Date, Collected)

The link is CustomerID.

The condition is that Collected must be FALSE, because the question wants orders not yet collected.

The example output shows one row per customer, not one row per order. That tells you aggregation is needed.

Approach

Use CUSTOMER joined to ORDER on CustomerID.

Then:

1. filter to only uncollected orders with WHERE Collected = FALSE
2. group by the customer name
3. count the orders in each group
4. rename the count column to NotCollected

Step-by-Step Reasoning

First select the customer name, because that must appear in the result:

SELECT CUSTOMER.CustomerName

Now add the count of matching orders and give it the required heading:

COUNT(`ORDER`.OrderID) AS NotCollected

Next choose the tables:

FROM CUSTOMER
INNER JOIN `ORDER`

The table ORDER contains CustomerID, so join on matching customer IDs:

ON CUSTOMER.CustomerID = `ORDER`.CustomerID

Now keep only orders that have not been collected:

WHERE `ORDER`.Collected = FALSE

At this point there may still be several rows per customer, one for each qualifying order. To combine them into one row per customer, group by the name:

GROUP BY CUSTOMER.CustomerName;

Putting it together gives:

SELECT CUSTOMER.CustomerName, COUNT(`ORDER`.OrderID) AS NotCollected
FROM CUSTOMER
INNER JOIN `ORDER`
ON CUSTOMER.CustomerID = `ORDER`.CustomerID
WHERE `ORDER`.Collected = FALSE
GROUP BY CUSTOMER.CustomerName;

This returns one row per customer who has at least one uncollected order, with the number of such orders shown in the NotCollected column.

Key Takeaways

• Use a join when the data needed is spread across tables.
• Use WHERE to keep only the records that match the condition.
• Use COUNT with GROUP BY to summarise data per customer.
• Use AS to produce a meaningful output heading.

Common Mistakes

• Forgetting the join and trying to select from only one table.
• Using Collected = TRUE, which gives the opposite result.
• Forgetting GROUP BY, which makes the count incorrect or invalid in SQL.
• Counting all rows without first filtering to uncollected orders.
• Not renaming the count column to NotCollected as requested.

Things to Be Careful About

• The table name ORDER is a reserved SQL word in many systems, so surrounding it with backticks is a safe choice.
• Group by the customer field you selected.
• The query should return only customers with uncollected orders, not every customer in the database.
• The condition is Boolean, so compare with FALSE, not a text string unless the specific DBMS stores it that way.

Background Concept

Binary addition works like denary addition, but each column can only contain 0 or 1.

The key rules are:

• 0 + 0 = 0
• 0 + 1 = 1
• 1 + 0 = 1
• 1 + 1 = 10 so write 0, carry 1
• 1 + 1 + 1 = 11 so write 1, carry 1

If an extra carry comes out of the leftmost column, that is the overflow bit the question asks you to include.

Understanding the Question

You must add these two 8-bit binary numbers:

• 11110101
• 10110001

The question specifically says to include any overflow bit, so if the sum needs 9 bits, you must show all 9 bits.

Approach

Work from right to left:

1. Add the bits in the rightmost column.
2. Carry when needed.
3. Continue across all columns.
4. If there is still a carry after the final column, write it at the front.

Step-by-Step Reasoning

Add from the right-hand side.

Column 1:

• 1 + 1 = 10
• write 0, carry 1

Column 2:

• 0 + 0 + 1 = 1
• write 1, carry 0

Column 3:

• 1 + 0 = 1
• write 1

Column 4:

• 0 + 0 = 0
• write 0

Column 5:

• 1 + 1 = 10
• write 0, carry 1

Column 6:

• 1 + 1 + 1 = 11
• write 1, carry 1

Column 7:

• 1 + 0 + 1 = 10
• write 0, carry 1

Column 8:

• 1 + 1 + 1 = 11
• write 1, carry 1

There is still a carry left over, so place it at the front.

Final result:

110100110

Key Takeaways

• Binary addition is done one column at a time from right to left.
• A carry must be included in the next column.
• If the question says to include overflow bits, keep the final carry.

Common Mistakes

• Forgetting to include a carry in the next column.
• Omitting the final overflow bit and writing only 8 bits.
• Adding left to right instead of right to left.
• Treating 1 + 1 + 1 as 10 instead of 11.

Things to Be Careful About

• Read the instruction carefully: here the overflow bit must be shown.
• Keep the digits aligned by column.
• Do not drop the leftmost carry at the end.

Background Concept

Binary subtraction follows the same idea as denary subtraction, but with only 0 and 1.

Useful rules are:

• 0 - 0 = 0
• 1 - 0 = 1
• 1 - 1 = 0
• 0 - 1 cannot be done directly, so you must borrow from the next column to the left

Borrowing in binary means:

• taking 1 from the next column left
• that 1 is worth 10 in the current column because the base is 2

So 10 - 1 = 1 in binary.

Understanding the Question

You must subtract:

00011110

from:

01100100

So the calculation is:

01100100 - 00011110

The question says to use binary subtraction and show working, so the expected method is direct subtraction with borrowing where necessary.

Approach

Start from the rightmost bit and move left:

1. Subtract each column.
2. If the top bit is smaller than the bottom bit, borrow from the next column left.
3. Continue until all 8 columns are complete.

A quick check at the end can be done in denary if you want: 01100100 is 100 and 00011110 is 30, so the answer should be 70, which is 01000110.

Step-by-Step Reasoning

Write the subtraction:

  01100100
- 00011110

Work from right to left.

Rightmost column:

• 0 - 0 = 0

Next column:

• 0 - 1 needs a borrow
• borrow from the next column to the left
• current column becomes 10
• 10 - 1 = 1

Next column:

• because of the borrow, the top bit there has been reduced
• this column also requires borrowing to continue the subtraction correctly

Continuing this borrowing process across the necessary columns gives the final result:

01000110

Check in denary:

• 01100100 = 100
• 00011110 = 30
• 100 - 30 = 70
• 70 in binary is 01000110

So the subtraction is correct.

Key Takeaways

• In binary subtraction, 0 - 1 requires borrowing.
• A borrowed 1 becomes 10 in the current column because binary is base 2.
• Checking the result in denary can help confirm the answer.

Common Mistakes

• Forgetting that a borrowed bit reduces the next left column by 1.
• Writing 0 - 1 = 1 without borrowing.
• Losing track of multiple consecutive borrows.
• Dropping the leading 0 and not keeping the answer as 8 bits.

Things to Be Careful About

• Keep the columns aligned exactly.
• When you borrow, update both the current column and the column you borrowed from.
• The answer should stay as an 8-bit binary number here: 01000110.