OSAT Computer Science (OK181) study plan

Write pseudocode for 10 short problems covering input, selection, iteration, and output, then hand-trace each one before running it.

Convert 5 of those pseudocode solutions into working code in a language you will teach (Python or Java), fixing syntax errors yourself before checking references.

Build a one-page reference sheet mapping variable scope, parameter passing by value versus reference, and data type conversion rules, with a code snippet for each.

Explain in writing the difference between syntax errors, runtime errors, and logic errors, and classify 12 given bugs into those categories.

Implement and trace linear search, binary search, selection sort, insertion sort, and merge sort, recording comparison counts for input sizes 8, 16, and 32.

Derive Big-O time and space complexity for 15 code fragments by counting loop iterations, and justify each answer in one sentence.

Write recursive and iterative versions of factorial, Fibonacci, and a string reversal, then compare call-stack depth and runtime.

Design a lesson sequence that introduces tracing before coding for one of the algorithms above, listing the exact questions you would ask students.

Implement a singly linked list, a stack, and a queue from scratch, and write insert, delete, and search operations for each.

Compare array-backed and linked implementations of a stack on 5 criteria, including memory overhead and worst-case operation cost.

Draw and annotate the structure of a binary search tree after a given sequence of 9 insertions, then show the tree after deleting a node with two children.

Choose the appropriate structure for 8 realistic scenarios (undo history, printer queue, symbol table, and similar) and defend each choice in two sentences.

Implement breadth-first and depth-first traversal on a small graph represented as an adjacency list, and record the visit order for both.

Implement a hash table with collision handling by chaining, and measure average probe length at load factors 0.25, 0.5, and 0.75.

Analyze 6 short algorithm problems and select a design strategy (brute force, divide and conquer, greedy, or dynamic programming) for each, stating why the others fail.

Solve 20 practice items on number bases, Boolean logic, and truth tables, and correct every miss with a written explanation of the rule.

Write a 300-word explanation of how binary representation and two's complement produce a given negative value, suitable for a high school student.

Trace a fetch-decode-execute cycle for 5 given instructions, naming the registers and buses involved at each step.

Convert between binary, decimal, and hexadecimal for 15 values, and compute the result of 8 bitwise AND, OR, XOR, and shift operations.

Diagram the layers of the TCP/IP model and map 6 protocols (HTTP, DNS, SMTP, TCP, UDP, IP) to their layer and purpose.

Compute subnet ranges and usable host counts for 6 CIDR blocks without a calculator, then verify with a tool.

Explain symmetric versus asymmetric encryption and describe how a TLS handshake uses both, in 250 words.

Write SQL queries using SELECT, WHERE, JOIN, GROUP BY, and HAVING against a small multi-table schema you create, and predict each result before running it.

Normalize a given unnormalized table to third normal form, documenting each decomposition step and the anomaly it removes.

Identify the CIA triad component at risk in 10 short incident scenarios, and name one mitigation for each.

Describe three common web vulnerabilities (SQL injection, cross-site scripting, weak password storage) and the defensive practice that prevents each.

Build a spreadsheet or script that computes mean, median, and standard deviation for a 30-row dataset, and interpret what the spread says about the data.

Summarize the key provisions of FERPA and COPPA as they apply to classroom technology choices, and list two compliance actions a teacher would take.

Analyze 4 ethical dilemmas in computing (data privacy, algorithmic bias, intellectual property, accessibility) using a structured decision framework, and write a defensible position for each.

Design a 3-lesson unit for one CS topic, writing measurable objectives that map to appropriate cognitive levels and aligning each to a standard.

Create a 10-item formative assessment blueprint showing item type, target objective, and cognitive level, plus a rubric for one performance task.

Draft a plan for using student misconception data from a formative assessment to reteach one concept.

Take two full-length timed practice tests under exam conditions, and log every missed item by domain and error type.

Rework every missed item from both tests until you can explain the correct reasoning without notes.

Review your weakest two domains using your own week 1-7 deliverables rather than new material.

Write a one-page exam-day strategy covering pacing per domain, flag-and-return rules, and how you will handle questions that require code tracing.