/en-s5-ict-binary-hex-colour-depth-image-compression-sampling-subnetting-algorithms-backup-security-practice-paper/
/en-s5-ict-binary-hex-colour-depth-image-compression-sampling-subnetting-algorithms-backup-security-practice-paper/
General Inquiry: info@TutorZone.com.hk
Office Hours: Monday to Saturday - 9:00 AM to 6:00 PM
WhatsApp Monday to Sunday - 24 hours
Hotline: +852 6828 1809
Instant Support: +852 9061 3106

S5 ICT Practice Paper | binary and colour depth, image compression, audio sampling, subnetting, algorithm efficiency and backup security

S5 ICT Practice Paper | binary and colour depth, image compression, audio sampling, subnetting, algorithm efficiency and backup security

  • 2026-11-17

Senior Secondary Information and Communication Technology

S5 ICT practice paper with answers: number bases, colour depth, image compression, audio sampling, subnetting, algorithm efficiency and backup security. Free PDF.

Paper details S5 ICT practice paper with answers: converting binary 10110110 to decimal and hexadecimal, 24-bit colour depth and uncompressed bitmap size for a 3840 by 2160 image, RGB 565 memory saving, number of colours from 24 bits, JPEG compression ratio against a 12 megapixel raw file, number of photos on a 64 GB card, upload time at 25 Mbps, audio file size at 44.1 kHz 16-bit stereo, MP3 size at 128 kbps, doubling the sampling rate, data used by one hour of 320 kbps streaming, slash 26 subnet mask with usable host count, network and broadcast address, download time of 750 MB at 100 Mbps with overhead, subnetting a slash 24 network into five subnets, worst case comparisons for linear and binary search, bubble sort comparisons, merge sort comparisons and speed-up, 3-2-1 backup capacity, daily incremental total, password combinations for eight characters from 62 symbols, cracking time and entropy, and backup window capacity.

Question 1 Number bases and colour depth

One colour channel value of a pixel is 10110110 in binary. A monitor uses 24 bits per pixel (8 bits each for red, green and blue) at a resolution of 3,840 by 2,160. A cheaper panel uses RGB565, with 5 bits for red and blue and 6 bits for green.

# Question Answer and marking notes
1 (a) Convert 10110110 in binary to decimal and hexadecimal. Answer: 128 + 32 + 16 + 4 + 2 = 182 in decimal, which is B6 in hexadecimal.
2 (b) Find the size of one uncompressed bitmap at that resolution in MiB. Answer: 8,294,400 pixels times 3 bytes = 24,883,200 bytes, that is 23.73 MiB.
3 (c) Moving from 24-bit to 16-bit colour, by what percentage does memory use fall? Answer: (24 minus 16) divided by 24 times 100 = 33.3 per cent.
4 (d) Find the number of colours available in 24-bit and in RGB565, and state the difference. Answer: 24-bit gives 2 to the 24, that is 16,777,216 colours; RGB565 gives 65,536 colours, so 24-bit has 256 times as many.

Question 2 Image compression and card capacity

A photographer shoots 4,000 photos of 12 megapixels each, using 3 bytes per pixel; after JPEG compression each file averages 3.2 MB. All photos go onto one 64 GB card of which 90 per cent is usable, then are backed up to the cloud over a 25 Mbps link.

# Question Answer and marking notes
5 (a) Find the raw size of one photo and the compression ratio. Answer: raw file 36.00 MiB, so the ratio is about 11.25 to 1.
6 (b) What is the total size of the photos in GB? Answer: 4,000 times 3.2 MB = 12.80 GB.
7 (c) How many photos fit on the card, and how much space is left? Answer: 18,000 photos fit, leaving 0.0 MB free.
8 (d) If the real throughput is only 80 per cent of the link speed, how many minutes does the upload take? Answer: 102,400 Mb at 20 Mbps gives 85.3 minutes.

Question 3 Audio sampling and streaming data

A 200 second stereo track is recorded at 44,100 Hz with 16 bit samples, then encoded as a 128 kbps MP3. A streaming service delivers the same song at 320 kbps.

# Question Answer and marking notes
9 (a) Find the size of the uncompressed file in MiB. Answer: 176,400 bytes per second times 200 seconds = 33.65 MiB.
10 (b) Find the MP3 size and the compression ratio against the uncompressed file. Answer: 3.05 MiB, a ratio of about 11.03 to 1.
11 (c) With 96,000 Hz sampling and all else unchanged, what is the new size and the percentage increase? Answer: 73.24 MiB, an increase of 118 per cent.
12 (d) How many MB of data does one hour of 320 kbps streaming use? Answer: 40,000 bytes per second times 3,600 seconds = 144.0 MB.

Question 4 Subnetting and download time

A network is 192.168.10.0/24; one of its subnets uses a /26 mask (255.255.255.192), and host 192.168.10.130 sits in one of them. Separately, a computer downloads a 750 MB installer over a 100 Mbps leased line at 85 per cent efficiency.

# Question Answer and marking notes
13 (a) How many addresses does the subnet contain, and how many are usable host addresses? Answer: 64 addresses and 62 usable hosts.
14 (b) Find the network address and broadcast address of the subnet holding 192.168.10.130. Answer: network 192.168.10.128 and broadcast 192.168.10.191.
15 (c) Find the download time in seconds. Answer: 6,000 Mb at 85 Mbps gives 70.6 seconds.
16 (d) To split 192.168.10.0/24 into 5 subnets of at least 25 hosts each, which prefix works, and how many subnets and hosts per subnet does it give? Answer: a /27 mask gives 8 subnets of 30 usable hosts, which covers the requirement.

Question 5 Comparison counts in searching and sorting

A sorted table holds 1,000,000 records and each key comparison takes 0.5 microseconds. Another program bubble sorts 500 items and could use merge sort instead.

# Question Answer and marking notes
17 (a) In the worst case, how many comparisons does a linear search need, and how long does it take? Answer: 1,000,000 comparisons, taking 0.50 seconds.
18 (b) In the worst case, how many comparisons does a binary search need, and how long? Answer: 20 comparisons, that is 10.0 microseconds.
19 (c) How many comparisons does bubble sort need in the worst case for 500 items? Answer: n times n minus 1 over 2 = 124,750 comparisons.
20 (d) Merge sort needs about n log2 n comparisons; find that count and the speed-up over bubble sort. Answer: 4,500 comparisons, about 27.7 times fewer than bubble sort.

Question 6 Backup capacity and password combinations

A company holds 2.4 TB of primary data, keeps 3 full copies under the 3-2-1 rule, changes about 40 GB a day and retains 30 days of incremental backups. Passwords are 8 characters long, each an uppercase letter, a lowercase letter or a digit, and an attacker can try one billion guesses per second. The nightly window is 4 hours at 90 MB/s.

# Question Answer and marking notes
21 (a) Under the 3-2-1 rule, how much storage do all full copies need? Answer: 2.4 TB times 3 copies = 7.2 TB.
22 (b) Find the total size of 30 days of incremental backups and compare with the full copies. Answer: 1,200 GB, about 17 per cent of the full copies.
23 (c) Find the total number of 8-character passwords and the days needed to try them all. Answer: 218,340,105,584,896 combinations, so 2.53 days to exhaust.
24 (d) Find the password entropy in bits, and decide whether a 4 hour window can complete one full 2.4 TB backup. Answer: 47.6 bits; the window only carries 1,296 GB, 54.0 per cent of the data, so a full backup does not fit.

Find a tutor — freeTutor Registration →

A TutorZone practice paper; original questions and passages, not publisher material.

Join as a tutor or coach — academic, music, sports, arts, STEM. Free to register. See how it works →