ILTS Computer Science (205) study plan

Trace and hand-execute sorting and searching algorithms (merge sort, quicksort, binary search) on given arrays, recording each comparison and swap

Derive Big-O time and space complexity for iterative and recursive code fragments, and rank growth rates from constant to exponential

Convert between binary, octal, hexadecimal, and decimal representations, and perform two's complement arithmetic by hand

Explain the roles of the CPU, memory hierarchy, and bus in the fetch-decode-execute cycle

Implement linear and binary search plus at least two sorting algorithms from scratch in a language of choice and verify them against test cases

Distinguish P, NP, NP-complete, and undecidable problems and classify given problem statements

Describe how recursion uses the call stack and convert a simple recursive function to an iterative equivalent

Summarize the core ideas of automata, formal languages, and regular expressions

Write programs using variables, control structures, functions, parameters, and return values to solve specified tasks

Apply object-oriented principles (encapsulation, inheritance, polymorphism) and contrast them with procedural design

Explain the software development life cycle phases and place Agile, waterfall, and iterative models in context

Identify and fix common defects such as off-by-one errors, infinite loops, and scope mistakes in given code

Read and trace code in at least two languages (for example, Java and Python) and predict output precisely

Describe testing levels (unit, integration, system, acceptance) and write test cases including boundary values

Explain version control concepts (commit, branch, merge) and the purpose of code review

Contrast compilers and interpreters and describe how source code becomes executable

Implement and compare arrays, linked lists, stacks, queues, and hash tables, stating typical operation costs

Trace insert, delete, and search operations on a binary search tree and describe tree traversals

Write SQL queries using SELECT, WHERE, JOIN, GROUP BY, and aggregate functions against a small schema

Explain primary keys, foreign keys, normalization to third normal form, and the difference between relational and non-relational models

Convert between binary, decimal, and dotted-decimal IP addresses and identify network and host portions for a given subnet mask

Explain the functions of the OSI and TCP/IP layer models and map common protocols (HTTP, DNS, TCP, UDP, IP) to layers

Describe operating system responsibilities including process scheduling, memory management, and file systems

Identify common threats (malware, phishing, SQL injection, man-in-the-middle) and matching countermeasures such as encryption, hashing, firewalls, and authentication

Analyze ethical scenarios involving privacy, intellectual property, accessibility, and bias in computing systems using a stated framework

Summarize legal and professional expectations such as acceptable use, data protection, and responsible disclosure

Design a lesson sequence for one CS topic that states standards-aligned objectives, activities, and assessment methods

Select formative and summative assessment strategies appropriate to programming tasks, including rubric design

Complete a timed full-length practice test under exam conditions and record per-domain accuracy

Review every missed item and write a corrected explanation for each

Revisit the two weakest domains using targeted drills until accuracy exceeds 80 percent

Consolidate all cheat sheets and notes into a single quick-review document