Nepal SEE Computer Science study plan

Define computer fundamentals in your own words: hardware versus software, input-process-output-storage cycle, and the main categories of computers (micro, mini, mainframe, supercomputer) with one Nepali-context example each.

Label and explain the function of core internal components (CPU with ALU and control unit, RAM, ROM, motherboard, hard disk, SSD) and state which are volatile and which are non-volatile.

Classify at least 15 peripheral devices as input, output, or storage, and write the unit of measurement used for each (Hz, GB, Mbps, dpi).

Draw a labelled block diagram of a computer system from memory and check it against your textbook, correcting every missing arrow or block.

Convert between number systems (binary, octal, decimal, hexadecimal) by hand for at least 10 values in each direction and verify each answer by reverse conversion.

Perform binary addition, subtraction using two's complement, and multiplication on 8-bit numbers, showing every carry and borrow.

Compute 1's and 2's complement of given binary numbers and explain why 2's complement is preferred in computers.

Convert between BCD, ASCII-style character codes, and plain binary for a set of given characters, and state the bit width of each representation.

Describe the layered logic of operating systems: definition, functions (process, memory, file, device management), and give three examples of single-user and multi-user systems.

Distinguish GUI from CUI, and open-source from proprietary software, with two examples of each category.

Explain the stages of the program development cycle (problem definition, algorithm, flowchart, coding, testing, debugging, documentation) and identify which stage a given scenario belongs to.

Write algorithms in pseudocode for five simple problems (sum of numbers, largest of three, even-odd check, factorial, simple interest) and dry-run each with sample input.

Draw flowcharts using standard symbols (terminal, process, decision, input/output, connector) for the same five problems you wrote algorithms for, keeping symbols consistent.

Trace a given flowchart with three different inputs and state the output for each, identifying any logic error you find.

Explain the difference between syntax errors, runtime errors, and logical errors, and classify five given bug descriptions.

Describe compilation versus interpretation and where each fits in turning source code into a running program.

Define data, information, database, DBMS, and table, and explain with an example why a DBMS is preferred over a flat file list.

Identify primary key, foreign key, field, record, and tuple in a given small table, and explain what makes a field suitable as a primary key.

Write the purpose of the main SQL statements (CREATE TABLE, INSERT, SELECT with WHERE, UPDATE, DELETE) and hand-write one correct statement for each.

Normalise a small messy table up to second normal form on paper, splitting it and marking keys.

Explain the need for computer networks and classify them by scale (LAN, MAN, WAN) with a realistic example of each in Nepal.

Compare star, bus, and ring topologies on cost, fault tolerance, and ease of expansion, and pick the best one for three given scenarios with justification.

Distinguish the internet from the web, define IP address, DNS, URL, HTTP, and ISP, and trace what happens when a URL is typed into a browser.

Describe common cyber threats (virus, worm, phishing, spam) and at least four protective measures including firewall, antivirus, strong passwords, and backup.

Solve 40 mixed multiple-choice questions spanning all units under exam timing, and log every wrong answer with the reason it was wrong.

Re-derive the two or three concepts behind each logged mistake and write a corrected one-line rule you can recall in the exam hall.

Practise the long-answer format: write four full answers (one on number systems, one on flowcharts, one on databases, one on networks) within the word and time limits you expect.

Memorise the exact syntax and symbol conventions that are easy to lose marks on, such as flowchart shapes and SQL keyword order.

Sit two full-length mock papers under strict timing with no notes, and score each against the official marking scheme.

Rework only the questions missed in the mocks until you can solve each one without help, then re-test them two days later.

Review the week 7 error log and confirm every rule is now automatic by reciting it and applying it to a fresh example.

Prepare a one-page final revision sheet of formulas, conversions, symbols, and definitions, and read it aloud twice before the exam.