Computer Science Level 3 study plan
Computer Science Level 3 · Give each week a clear focus.
8 weeks · About 6 hours per week
Computational Thinking and Algorithms
Decompose ten word problems into inputs, outputs, and step sequences before writing any code.
Trace three nested-loop and recursion snippets by hand, recording variable values at each step.
Rank algorithm growth rates from constant to exponential and justify each ordering in one sentence.
Write pseudocode for two search routines and state their worst-case time complexity.
Your checkpoint
A one-page complexity cheat sheet plus ten hand-traced problem decompositions with answers.
Computational Thinking and Algorithms & Programming and Software Development
Implement five classic algorithms from scratch in a language you know, without copying reference code.
Compare iterative and recursive versions of the same algorithm and record runtime differences.
Translate pseudocode into working code for sorting and searching tasks.
Explain to yourself, in writing, why an algorithm that looks correct can still fail on edge cases.
Your checkpoint
A small code repository with five algorithms, each passing at least three self-written test cases.
Programming and Software Development & Data Structures and Data Management
Refactor a messy script into functions with clear names, parameters, and return values.
Build and manipulate an array-based list and a linked structure, then compare their insertion costs.
Write unit tests that cover normal, boundary, and invalid inputs for two functions.
Identify and fix three deliberate bugs in code you wrote in week 2.
Your checkpoint
A refactored module with a test file that runs green and a short note on each bug fixed.
Data Structures and Data Management
Implement a stack, a queue, and a hash table from scratch and document their operations.
Compare the time cost of searching a sorted list versus a hash-based lookup on generated data.
Choose the right structure for five short scenarios and defend each choice in two sentences.
Describe how collisions are handled and demonstrate one resolution strategy in code.
Your checkpoint
A data-structure library with a written comparison table of operations and their costs.
Computer Systems, Networks, and Security
Convert numbers between binary, decimal, and hexadecimal and explain each step aloud.
Diagram how a request travels from a client through a network to a server and back.
Explain the difference between authentication and authorization with two concrete examples.
List four common attack types and one defensive measure against each.
Your checkpoint
A labeled network diagram plus a two-page security summary covering attacks and defenses.
Data Analysis and Computational Applications
Load a small dataset and compute summary statistics for at least three numeric columns.
Clean a messy dataset by handling missing values and inconsistent formats, documenting each decision.
Create two charts that answer a specific question and write one sentence interpreting each.
Distinguish correlation from causation using an example from your own analysis.
Your checkpoint
A short analysis notebook or report with cleaned data, two charts, and written interpretations.
Impacts of Computing and Professional Practice & Programming and Software Development
Summarize three computing innovations and state one benefit and one risk for each.
Draft a one-page code review checklist covering readability, testing, and security.
Apply the checklist to a peer-style review of your own week 3 module and log findings.
Explain what intellectual property and data privacy mean for a software project.
Your checkpoint
A one-page review checklist applied to your own code, with a log of at least five findings.
Computational Thinking and Algorithms & Data Structures and Data Management & Computer Systems, Networks, and Security & Data Analysis and Computational Applications & Impacts of Computing and Professional Practice
Take two timed practice sets weighted by domain percentages and score each by domain.
Re-teach your two weakest topics in writing without notes, then check against your materials.
Redo every missed practice question and record why the correct answer is correct.
Assemble a single reference sheet of formulas, complexities, and definitions for final review.
Your checkpoint
A scored practice report by domain plus a one-page final reference sheet.
Milestones
Week 2: All five algorithms run and pass your own test cases; you can state each one's complexity from memory.
Week 4: Data-structure library works, and you can justify a structure choice for a new scenario in under a minute.
Week 6: Analysis report is complete with cleaned data, two interpreted charts, and a correlation caveat.
Week 8: Practice scores show no domain below 60 percent, and every missed question has a written correction.