NEB 12 Computer Science study plan
NEB 12 Computer Science · Give each week a clear focus.
8 weeks · About 6 hours per week
Computer Science
Define and classify the core building blocks of a computer system (CPU, memory, storage, I/O) and explain how each contributes to program execution
Convert between binary, decimal, octal, and hexadecimal by hand and verify each conversion with a second method
Perform binary addition and subtraction, including two's complement representation of negative integers
Explain how characters, integers, and floating-point values are represented and stored in memory
Your checkpoint
A one-page reference sheet of number-system conversions and data representations, plus 20 solved conversion and two's complement problems with working shown
Computer Science
Trace the fetch-decode-execute cycle for a short instruction sequence and identify the role of the program counter, instruction register, and accumulator
Differentiate primary and secondary memory and justify a storage choice for a stated scenario
Describe the purpose of an operating system and distinguish multitasking, multiprocessing, and time-sharing
Identify common input, output, and storage devices and state one trade-off for each
Your checkpoint
A labeled diagram of the CPU and memory hierarchy with a written trace of one instruction cycle and a 200-word comparison of OS scheduling concepts
Computer Science
Write, compile mentally, and trace short programs that use variables, arithmetic operators, and type casting
Construct and evaluate Boolean expressions using AND, OR, and NOT, including truth tables
Trace nested selection structures and predict output for given inputs
Identify and correct common syntax and logic errors in short code fragments
Your checkpoint
A set of 15 hand-traced code snippets with predicted outputs, at least 5 containing deliberate errors that you diagnose and fix
Computer Science
Trace definite and indefinite loops and compute iteration counts and final variable values
Convert a loop-based solution between for, while, and do-while forms
Decompose a problem into functions with parameters and return values, and trace parameter passing
Explain the difference between local and global scope with a concrete example
Your checkpoint
A timed 60-minute practice set of 10 loop and function tracing problems scored against your own worked solutions, with errors logged
Computer Science
Declare and traverse one-dimensional and two-dimensional arrays and compute sums, maxima, and searches by hand
Perform linear and binary search on sample data and count comparisons for each
Trace a simple sorting algorithm step by step and state its effect on the data after each pass
Match a problem statement to an appropriate data structure and justify the choice
Your checkpoint
A worked trace of binary search and one sorting algorithm on a 10-element dataset, plus a comparison-count table and a written justification for three data-structure choices
Computer Science
Explain the relational model and identify primary keys, foreign keys, and candidate keys in given schemas
Write SQL statements for selection, projection, filtering, and simple joins
Normalize a small unnormalized table to third normal form and justify each step
Distinguish DBMS, RDBMS, and file-based storage with one advantage of each
Your checkpoint
A normalized schema for a small scenario with written justification, plus 10 SQL queries written and checked against a hand-computed result set
Computer Science
Describe the layers of a network and the function of common protocols (HTTP, TCP/IP, DNS, SMTP)
Distinguish LAN, WAN, and the client-server versus peer-to-peer models with examples
Explain the difference between the internet and the World Wide Web and outline how a URL resolves to a page
Identify common security threats and at least three countermeasures, including encryption and authentication
Your checkpoint
A one-page network and security summary covering protocol roles, topology types, and five threats with matched countermeasures
Computer Science
Assemble a consolidated formula and definition sheet spanning all eight weeks
Complete a full-length timed mock exam under exam conditions and self-mark it
Categorize every missed question by topic and re-solve each one without notes
State your three weakest subtopics and the specific corrective action for each
Your checkpoint
A scored full-length mock exam with an error log, re-solved corrections, and a prioritized final-revision checklist
Milestones
Week 2: Can convert between all four number bases and complete a two's complement problem within 2 minutes without notes
Week 4: Scores at least 70% on the timed loop and function tracing set, with every error traced to a specific misconception
Week 6: Writes a correct multi-table SQL query and normalizes a table to 3NF unaided
Week 8: Scores at least 75% on the full-length mock exam and has re-solved every missed question correctly