OAE Computer Science study plan

Define and contrast core data structures (arrays, linked lists, stacks, queues, hash tables, trees, graphs) by writing a one-page comparison table from memory

Trace at least 6 sorting algorithms (bubble, selection, insertion, merge, quick, heap) by hand on the same 8-element array and record comparison/swap counts

Analyze time and space complexity of each traced algorithm using Big-O, Big-Theta, and Big-Omega notation

Implement a hash table with separate chaining in a language of choice and document collision behavior under load

Derive recurrence relations for merge sort and binary search and solve them using the Master Theorem and substitution method

Classify P, NP, NP-complete, and NP-hard problems and place 8 named problems into the correct class with justification

Trace breadth-first search and depth-first search on a 10-node graph, listing traversal order and parent pointers

Compute minimum spanning trees using both Prim's and Kruskal's algorithms on the same weighted graph

Explain binary search tree operations (insert, delete, search) including all three deletion cases

Write recursive and iterative implementations of binary search, factorial, Fibonacci, and tree traversal, then compare their stack usage

Implement a balanced tree (AVL or red-black) insert and delete with rotation logic, and verify balance factors after each operation

Translate a plain-language problem statement into pseudocode, then into working code, then into a set of unit tests

Debug 5 deliberately broken programs using a debugger (breakpoints, watch variables, call stack) and document each root cause

Compare procedural, object-oriented, and functional paradigms by writing the same small program in all three styles and annotating the tradeoffs

Explain and demonstrate value vs reference semantics, parameter passing modes, and scope/shadowing with runnable examples

Apply the four OOP pillars (encapsulation, inheritance, polymorphism, abstraction) in a single class hierarchy and identify each in code

Handle exceptions and errors correctly in at least 3 failure scenarios, including resource cleanup

Use a version control workflow (branch, commit, merge, resolve one conflict) on a practice repository

Describe the software development life cycle phases and map at least 3 development models (waterfall, agile, spiral) to realistic project scenarios

Write test cases for boundary values, equivalence partitions, and error conditions for a given specification, and distinguish unit vs integration vs system testing

Convert numbers among binary, octal, decimal, and hexadecimal, and perform two's complement arithmetic including overflow detection

Explain how source code becomes an executable: preprocessing, compilation, assembly, linking, and loading

Distinguish compilers vs interpreters and static vs dynamic typing with concrete language examples

Diagram the fetch-decode-execute cycle and explain the roles of PC, IR, ALU, registers, and cache levels

Compute memory hierarchy performance (hit/miss rates, average access time, speedup) for at least 4 worked scenarios

Explain pipelining, hazards, and the difference between RISC and CISC with examples

Compare process vs thread, describe context switching, and explain scheduling and deadlock conditions

Trace virtual memory translation from virtual address to physical address using a page table, including TLB behavior

Map the OSI and TCP/IP models layer by layer and place at least 10 protocols (HTTP, HTTPS, DNS, DHCP, TCP, UDP, IP, ARP, ICMP, TLS) in the correct layer with function

Trace a full request path from browser URL to rendered page, naming each protocol and device involved

Subnet IPv4 networks: given a CIDR block, compute network address, broadcast address, usable host range, and number of hosts for at least 5 problems

Distinguish symmetric vs asymmetric encryption, hashing, and digital signatures, and identify where each is used in TLS

Explain common attack categories (phishing, SQL injection, XSS, MITM, DoS, ransomware) and match each to a concrete mitigation

Take two full-length timed practice tests under exam conditions and log every missed question by domain

Re-teach the 10 weakest concepts from memory in writing, then verify against source material

Re-solve all previously missed numerical problems (complexity, cache, subnetting) without notes

Build a one-page final review sheet covering the highest-yield formula and definition per domain