FTCE Computer Science study plan

Map every Domain 1 subarea (algorithms and complexity, data structures, discrete math and number systems, boolean logic, computer architecture basics) to a one-page self-audit rating each from 1 to 5

Convert between binary, octal, decimal, and hexadecimal by hand for 20 mixed values and verify each result

Trace at least 5 sorting and searching algorithms on paper, recording comparison counts for each pass

Write out Big-O time and space bounds for 10 standard operations (array access, linked-list insert, hash lookup, balanced-tree search, and similar) from memory

Solve 30 discrete-math items covering sets, relations, functions, combinatorics, and basic probability, and log every miss with the underlying rule

Reduce 15 boolean expressions using truth tables and algebraic identities, then confirm each with a second method

Explain von Neumann architecture, fetch-decode-execute, pipelining, and memory hierarchy in your own words without notes

Build a personal error log that tags each mistake by subarea so patterns become visible

Decompose 8 word problems into inputs, outputs, constraints, and edge cases before writing any solution

Draw flowcharts and pseudocode for 6 classic problems (linear search, binary search, bubble sort, merge sort, recursion on a tree, and one string-manipulation task)

Translate 5 pseudocode blocks into working code in your strongest language and run them against edge-case inputs

Estimate time and space complexity for each solution you produce and justify the estimate in one sentence

Implement recursion for factorial, Fibonacci, tree traversal, and Towers of Hanoi, and compare each against an iterative version

Practice tracing recursive calls by hand for 10 functions, drawing the call stack at each step

Write 20 short code-reading items where you predict output before running anything

Identify and fix 8 deliberately buggy code snippets spanning off-by-one loops, base cases, and null handling

Implement core data structures from scratch (dynamic array, singly linked list, stack, queue, binary search tree, hash table) and unit-test each

Compare the trade-offs of arrays, linked lists, trees, and hash tables across insert, delete, search, and memory in a written table

Refactor one working program to apply separation of concerns, meaningful naming, and defensive input validation

Write test cases that cover normal, boundary, and invalid inputs for two of your implementations

Walk through the software development life cycle stages and match each to a concrete artifact you would produce

Explain compiled versus interpreted execution, linking, and the role of a build tool in your own words

Practice reading stack traces and diagnosing 6 runtime errors from message alone

Describe object-oriented principles (encapsulation, inheritance, polymorphism, abstraction) using examples from your own week-5 code

Diagram the OSI and TCP/IP models and place 10 protocols (HTTP, HTTPS, DNS, DHCP, TCP, UDP, IP, ARP, SMTP, SSH) at the correct layer with a one-line purpose

Compute subnet basics: given an address and prefix, derive network, broadcast, and usable host range for 10 examples

Explain operating-system responsibilities (process scheduling, memory management, file systems, permissions) with a concrete example for each

Summarize legal, ethical, and security topics (acceptable use, intellectual property, privacy, malware types, authentication) into a study sheet

Take two full-length timed practice exams under real conditions and score each by domain

Re-teach your three weakest subareas from the week-1 audit by writing a short explainer for each without notes

Review the entire error log and re-solve every item you previously missed

Build a final one-page formula and reference sheet covering number systems, complexity, and subnetting