NSSCO Computer Studies (6134) study plan

Distinguish and classify input, output, processing, and storage components by function, and label the internal blocks of a stored-program computer (CPU, ALU, control unit, registers, main memory, buses).

Describe the fetch-decode-execute cycle step by step and explain how the program counter, instruction register, and accumulator are used at each stage.

Compare primary memory (RAM, ROM, cache) and secondary storage (magnetic, optical, solid-state) on speed, cost per gigabyte, volatility, and typical use.

Explain the role of the operating system and differentiate system software from application software, giving two examples of each.

Convert between binary, denary, and hexadecimal for values up to 8 bits, and perform binary addition showing carry bits.

Represent negative integers using two's complement and explain why it simplifies subtraction in hardware.

Convert characters to their ASCII codes and explain how a character set maps symbols to binary values.

Calculate the storage needed for a given number of images, audio seconds, or text characters, stating the assumptions used.

Express a problem as an algorithm using pseudocode and a flowchart, including sequence, selection, and iteration constructs.

Trace a given algorithm by hand through a trace table and predict its output for three different inputs.

Write working pseudocode or code for linear search, counting occurrences, and finding a maximum value in a list.

Identify and correct logic errors (off-by-one, wrong comparison operator, infinite loop) in short given algorithms.

Design and use one-dimensional arrays to store and process a list of values, including reading, summing, and searching.

Explain the purpose of functions and procedures, and pass parameters by value with a worked example showing the effect on the caller.

Convert a flowchart to pseudocode and pseudocode to a flowchart without changing the logic.

Apply binary and hexadecimal representation to memory addresses and explain why hexadecimal is used for addresses.

Compare LAN, WAN, and the internet, and describe the roles of client, server, router, switch, hub, and modem in a named network topology.

Explain packet switching, IP addressing, and DNS resolution as a sequence of steps from typing a URL to the page loading.

Distinguish the functions of TCP and IP and describe how error checking and retransmission support reliable delivery.

Compare wired and wireless transmission media and state one advantage and one limitation of each.

Define the terms field, record, table, primary key, and foreign key, and identify each in a given data scenario.

Design a two-table relational database to remove repeating groups, and justify each key choice.

Write queries in a described language or query-by-example form to select, filter, and sort records, and explain what each clause does.

Distinguish data from information and describe how validation (range, type, presence checks) protects data quality.

Classify named threats (phishing, malware, ransomware, social engineering) and match each to at least one technical and one user-level countermeasure.

Explain encryption, firewalls, authentication, and backups as security controls, stating what each does and does not protect against.

Discuss two legal or ethical issues in computing (data privacy, intellectual property, or computer misuse) using a named scenario and the relevant principle.

Assess one emerging technology (for example AI tools, cloud computing, or the Internet of Things) for its benefits and risks to a named user group.

Complete a timed full-length practice paper and record the score for each domain.

Re-teach the two weakest domains using your own notes and worked examples, without rereading the original material.

Build a one-page formula and definition sheet covering number conversions, fetch-decode-execute, network devices, database keys, and security terms.

Identify and list the three question types you lost most marks on and write the correction for each.