GCE A/L General Information Technology study plan
GCE A/L General Information Technology · Give each week a clear focus.
8 weeks · About 7 hours per week
Information and Communication Technology Fundamentals & Data Representation and Number Systems
Define the core ICT building blocks (hardware, software, data, people, procedures, connectivity) and classify ten everyday systems by their components
Convert between binary, octal, decimal and hexadecimal by hand for twenty numbers and verify each with a written check
Perform two's complement representation of signed 8-bit integers and explain why overflow occurs at the boundary values
Encode a short English phrase in ASCII and in UTF-8 and compare the byte counts, stating why Unicode is needed for Sinhala or Tamil text
Compute storage sizes for given image (pixel x colour-depth) and audio (sample rate x bit depth x seconds) scenarios
Your checkpoint
A one-page handwritten reference sheet of number-system conversions plus five worked storage-size calculations, self-marked against a key you write yourself
Computer Systems and Hardware
Trace the fetch-decode-execute cycle for a simple instruction sequence and label the role of PC, IR, MAR, MDR and ALU
Distinguish RAM types (SRAM, DRAM, SDRAM, DDR generations) and rank them by speed, cost per bit and volatility
Compare HDD, SATA SSD and NVMe SSD on latency, throughput, durability and cost, and justify a purchase for two stated use cases
Identify the ports and interfaces (USB versions, HDMI, Thunderbolt, SATA, PCIe) from their specifications and match them to peripherals
Explain how cache levels L1-L3 and locality of reference affect observed performance
Your checkpoint
A labelled block diagram of a von Neumann machine with a 150-word annotation for each major unit, plus a comparison table of three storage devices
Software and Operating Systems
Compare batch, multiprogramming, time-sharing, real-time and distributed operating systems by scheduling behaviour and typical use
Describe process states and transitions, and explain context switching, deadlock conditions and one prevention strategy
Differentiate paging from segmentation and compute the physical address for three given logical addresses
Execute ten command-line tasks in a file system (create, list, copy, move, change permissions, search text) and record the exact commands
Classify five software licences (proprietary, freeware, open source, shareware, public domain) against real examples
Your checkpoint
A command-line log of ten completed file-system and permission tasks with the commands used and their output, plus a half-page comparison of paging and segmentation
Computer Networks and the Internet
Map the OSI seven layers and TCP/IP model to each other and state one protocol and one device for each layer
Distinguish hub, switch and router by the layer they operate at and the collision and broadcast domains they create
Calculate network and broadcast addresses and usable host ranges from five given IPv4 addresses with CIDR prefixes
Explain TCP three-way handshake versus UDP connectionless delivery using a concrete application for each
Describe DNS resolution, DHCP lease allocation and NAT translation as step sequences for a single web request
Your checkpoint
A timed 25-question self-test on addressing, devices and protocols, scored and with every wrong answer rewritten as a correct statement
Databases and Information Management
Model a small library or school scenario as entities, attributes and relationships, and draw an ER diagram with correct cardinality
Convert that ER diagram into relations in third normal form and justify each decomposition step
Write ten SQL statements covering SELECT with WHERE, ORDER BY, GROUP BY with aggregates, INNER JOIN and a subquery
Explain primary key, candidate key, foreign key and referential integrity using your own schema as the example
Describe transaction properties (atomicity, consistency, isolation, durability) and demonstrate a rollback scenario
Your checkpoint
A complete ER diagram plus its relational schema and ten working SQL queries run against sample data, with output captured
Programming and Algorithms
Write pseudocode and a flowchart for three problems: finding the maximum, linear search and bubble sort
Trace a given algorithm line by line and produce the output for three different inputs, including an edge case
Compare linear and binary search and bubble and insertion sort by time complexity and the conditions each requires
Implement one of your algorithms in a real language and test it against five cases including empty and single-element input
Distinguish syntax, runtime and logic errors and identify which type each of eight given bugs represents
Your checkpoint
A working program for one sorting or searching task with five documented test cases, plus hand-traced output for two other algorithms
Information Systems and e-Services & ICT in Society, Ethics, and Security
Classify five real e-services (e-government, e-banking, e-learning, e-health, e-commerce) by stakeholder, transaction type and benefit delivered
Explain how e-services depend on databases, networks and authentication, citing one failure mode for each dependency
Identify five security threats (phishing, malware, social engineering, denial of service, SQL injection) and match each to a specific countermeasure
Distinguish symmetric and asymmetric encryption and explain how digital signatures and certificates establish trust
Discuss three Sri Lankan or global legal and ethical issues in ICT, including data protection and intellectual property, and state the relevant principle
Your checkpoint
A two-page case note on one e-service describing its architecture, three risks and the controls that mitigate them
Information and Communication Technology Fundamentals & Computer Systems and Hardware & Software and Operating Systems & Data Representation and Number Systems & Computer Networks and the Internet & Databases and Information Management & Programming and Algorithms & Information Systems and e-Services & ICT in Society, Ethics, and Security
Sit two full-length timed mock papers under exam conditions and record section-wise scores
Re-derive every formula and conversion rule from memory (number bases, storage size, subnetting, complexity) and correct gaps
Rewrite your twenty most frequent errors as one-line rules and re-test yourself on them
Practise structured-answer technique on five past-style questions, allocating marks and time explicitly
Your checkpoint
A scored mock-exam record with an error log of at least twenty entries and a one-page final revision sheet covering all nine domains
Milestones
Week 2: Convert ten mixed numbers between bases and compute three storage sizes without notes, scoring at least 8/10 and 3/3
Week 4: Score at least 70% on the 25-question network self-test and correctly derive network and broadcast addresses for all five given subnets
Week 6: Produce a correct ER diagram, third-normal-form schema and ten running SQL queries, and pass all five test cases on your implemented algorithm
Week 8: Score at least 60% on both timed mocks and show a shorter error log on the second paper than the first