S5 ICT Practice Paper (Paper 2): Transmission Time and Link Efficiency, IP Subnetting, Relational Keys and SQL Aggregates, Spreadsheet IF and SUMIF, Pseudo-code Tracing, Sound Sampling and Image Compression, Password Strength and Symmetric Keys
- 2026-11-18
ICT
S5 ICT paper 2: transmission time, IP subnetting, SQL aggregates, IF/SUMIF, pseudo-code tracing, sound sampling, image compression. 24 questions, 100 marks, answers.
Download Question paper PDF | Answer key PDF
Paper details Level: S5 | Subject: ICT | Time: 75 minutes | Total: 100 marks | 24 questions
Part A Networking and Data Transmission
Show all steps and units.
| # | Question | Answer and marking notes |
|---|---|---|
| 1 | A 30 MB file is sent over a 24 Mbps leased line. Ignoring protocol overhead, find the minimum transmission time in seconds. | 30 × 8 = 240 Mbit; 240 ÷ 24 = 10 s. |
| 2 | An uncompressed 24-bit bitmap of 1920 × 1080: find its size in MiB (1 MiB = 2^20 bytes). | 1920 × 1080 × 3 = 6,220,800 bytes; ÷ 1,048,576 = 5.93 MiB. |
| 3 | How many usable host addresses does 192.168.10.0/26 provide? | Host bits = 32 − 26 = 6, so 2^6 = 64 addresses; minus network and broadcast = 62 usable. |
| 4 | A 100 Mbps link runs at 80% efficiency. How long does a 50 MB file take? | Effective bandwidth 100 × 0.8 = 80 Mbps; 50 × 8 = 400 Mbit; 400 ÷ 80 = 5 s. |
Part B Relational Databases and SQL
Write only the keyword or value required.
| # | Question | Answer and marking notes |
|---|---|---|
| 5 | The student table has 5 rows and the enrolment table 12 rows; every student takes at least one course. How many rows does an equi-join on student ID return? | 12 rows — a one-to-many join returns one row per enrolment record. |
| 6 | SELECT AVG(score) FROM result WHERE class = ‘5A’; class 5A scores are 60, 72, 84, 90. Give the result. | (60 + 72 + 84 + 90) ÷ 4 = 306 ÷ 4 = 76.5. |
| 7 | An unnormalised table holds 8 students, each with 3 phone numbers. After conversion to 1NF, how many rows are there? | 8 × 3 = 24 rows, one per phone number, with a composite key (student ID, phone). |
| 8 | SELECT score FROM result ORDER BY score DESC LIMIT 2; scores are 60, 72, 84, 90. Give the two output rows. | 90 and 84 — descending order, first two rows. |
Part C Spreadsheet Functions
Formulas start at row 2; state the resulting value.
| # | Question | Answer and marking notes |
|---|---|---|
| 9 | B2 holds 78. What does =IF(B2>=80,”A”,IF(B2>=65,”B”,”C”)) return? | 78 is not ≥ 80 but is ≥ 65, so it returns “B”. |
| 10 | C2:C6 = 5A, 5A, 5B, 5B, 5B and D2:D6 = 40, 35, 50, 20, 45. Give =SUMIF(C2:C6,”5A”,D2:D6). | Only the two 5A rows: 40 + 35 = 75. |
| 11 | E2:E10 = 58, 61, 72, 45, 88, 90, 60, 59, 77. Give =COUNTIF(E2:E10,”>=60″). | Scores of 60 or above: 61, 72, 88, 90, 60, 77 — 6 in total. |
| 12 | B2 = 50 and F1 = 1.2. Give the value of =B2*$F$1, and state which cell is still referenced after the formula is copied to row 3. | 50 × 1.2 = 60; $F$1 is absolute, so it still refers to F1 after copying. |
Part D Algorithms and Program Tracing
Give the final value or trace result.
| # | Question | Answer and marking notes |
|---|---|---|
| 13 | s ← 0; for k = 1 to 19 step 2: s ← s + k. What is s at the end? | 1 + 3 + … + 19 has 10 terms, sum = 100. |
| 14 | Linear search for 9 in [12, 7, 25, 9, 31] — how many comparisons are needed? | 9 is the 4th element, so 4 comparisons. |
| 15 | Bubble sort [5, 3, 8, 1]. Give the array after the first pass and the number of swaps. | After pass 1: [3, 5, 1, 8] with 2 swaps (5↔3, 8↔1). |
| 16 | Binary search over 16 sorted items — how many comparisons in the worst case? | Halving 16→8→4→2→1 gives 4 splits plus one confirmation: 5 comparisons worst case. |
Part E Multimedia and Compression
Include units; 1 MiB = 2^20 bytes.
| # | Question | Answer and marking notes |
|---|---|---|
| 17 | A 60-second stereo recording at 44.1 kHz, 16-bit: give the uncompressed size in bytes and MiB. | 44,100 × 2 × 2 × 60 = 10,584,000 bytes ≈ 10.09 MiB. |
| 18 | A signal has a maximum frequency of 8 kHz. What is the minimum sampling rate under the sampling theorem? | It must be at least 2 × 8,000 = 16,000 Hz (16 kHz). |
| 19 | The 6,220,800-byte bitmap is compressed to 933,120 bytes. Find the compression ratio (original ÷ compressed). | 6,220,800 ÷ 933,120 ≈ 6.67, i.e. about 6.67 : 1. |
| 20 | With a colour depth of 8 bits, how many colours can be represented? | 2^8 = 256 colours. |
Part F Information Security
Show working for numeric parts; name the mechanism for scenario parts.
| # | Question | Answer and marking notes |
|---|---|---|
| 21 | A password has 8 characters from a 62-symbol set. Find its entropy in bits (1 d.p.). | 8 × log2(62) = 8 × 5.954 = 47.6 bits. |
| 22 | Ten users communicate pairwise with symmetric encryption. How many distinct shared keys exist in total? | C(10, 2) = 10 × 9 ÷ 2 = 45 keys. |
| 23 | A user types a password into a phishing site, yet the bank still asks for a one-time code. Why does the one-time code limit the damage? | The one-time code is bound to that session or transaction, so a stolen password alone cannot authenticate; reuse risk is also cut. |
| 24 | Give the digest length of SHA-256 and MD5 in bits and bytes. | SHA-256: 256 bits = 32 bytes; MD5: 128 bits = 16 bytes. |
Find a tutor — freeTutor Registration →
A TutorZone practice paper; original questions and passages, not publisher material.



