Praxis Computer Science study plan
Praxis Computer Science · Give each week a clear focus.
8 weeks · About 7 hours per week
Computer Systems and Organization
Convert values among binary, octal, decimal, and hexadecimal, and perform two's-complement addition and subtraction without a calculator.
Construct truth tables for multi-input Boolean expressions and simplify them using Boolean algebra identities and Karnaugh maps.
Diagram the fetch-decode-execute cycle, labeling the program counter, instruction register, ALU, and control unit at each step.
Compare the levels of the memory hierarchy (registers, cache, RAM, secondary storage) by latency, cost per byte, and volatility.
Your checkpoint
A two-page handwritten reference sheet on number systems, Boolean simplification, and the instruction cycle, plus a 25-question self-quiz scored at 85% or higher with every miss corrected in writing.
Computer Systems and Organization & Programming and Algorithms
Explain how an operating system manages processes, threads, scheduling, and virtual memory, including paging and page faults.
Distinguish compilers from interpreters and trace a short source file through preprocessing, compilation, assembly, and linking.
Write working programs that declare variables of several data types and use operators, input, and output correctly.
Implement and hand-trace nested conditional and iterative control structures, recording variable state at each iteration.
Your checkpoint
Two runnable programs (one using nested loops, one using a multi-branch decision structure) plus a full trace table for a 15-line loop program showing every variable value at every step.
Programming and Algorithms
Implement linear search and binary search, and state the precondition that makes binary search valid.
Implement at least three sorting algorithms and compare their best, average, and worst-case time and space complexity.
Classify code fragments by Big-O growth class and justify each classification with a counting argument.
Write and trace recursive functions, identifying the base case and recursive case for each.
Describe encapsulation, inheritance, and polymorphism and identify each in a short given class design.
Your checkpoint
A complexity comparison table covering five algorithms, plus one working recursive solution (with base case, recursive case, and call-stack trace) to a problem such as tree traversal or factorial.
Programming and Algorithms & Data, Databases, and Information Retrieval
Implement a stack, a queue, and a singly linked list, and justify when each beats a plain array.
Insert into and traverse a binary search tree in inorder, preorder, and postorder, and state the resulting ordering property.
Distinguish the relational model from non-relational stores, and define primary keys, foreign keys, and integrity constraints for a scenario.
Write SQL SELECT statements that use WHERE, ORDER BY, and at least one INNER JOIN.
Your checkpoint
A data-structure notebook containing working stack, queue, and BST implementations with insert and all three traversals, plus a 10-query SQL worksheet executed against a small sample database with results captured.
Data, Databases, and Information Retrieval
Derive an entity-relationship diagram from a written scenario and convert it into relational tables with keys marked.
Normalize a denormalized table to third normal form and state the anomaly each step removes.
Write SQL using joins, aggregate functions, GROUP BY, HAVING, and a subquery, and predict each result set before running it.
Explain transactions, the ACID properties, and when an index speeds up a query.
Describe information retrieval fundamentals: inverted indexes, keyword versus Boolean search, and relevance ranking.
Your checkpoint
A normalized schema package for a given scenario: ER diagram, tables in 3NF, and eight SQL queries with the expected output written out and verified by execution.
Networks and the Internet
Map the functions of each OSI layer to the TCP/IP model and name a protocol operating at each layer.
Convert between binary, dotted-decimal, and CIDR notation, and compute the network address, broadcast address, and usable host range for a given block.
Contrast TCP and UDP, and explain the three-way handshake, port numbers, and flow control.
Trace a browser request end to end, naming the role of ARP, DNS, DHCP, TCP, TLS, and HTTP at each stage.
Distinguish the roles of hub, switch, router, and firewall, and describe basic wireless and WAN connectivity options.
Your checkpoint
A subnetting worksheet of 10 CIDR blocks solved correctly (network, broadcast, and host range shown for each), plus a numbered packet-flow trace from URL entry to page render with the protocol and layer named at every hop.
Impacts of Computing, Ethics, and Security
Classify common attacks (malware, phishing, denial of service, SQL injection, man-in-the-middle) and match each to a specific defense.
Apply the confidentiality-integrity-availability triad and the principles of authentication, authorization, and least privilege to a scenario.
Distinguish symmetric encryption, asymmetric encryption, and hashing, and explain the role of digital certificates in TLS.
Evaluate ethical, legal, and social impacts of a computing system, including privacy, intellectual property, accessibility, and the digital divide.
Your checkpoint
A threat-model write-up for a small web application naming five threats, mapping each to the CIA triad, and pairing each with a concrete mitigation, plus a 15-question security and ethics quiz scored at 80% or higher.
Computer Systems and Organization & Programming and Algorithms & Data, Databases, and Information Retrieval & Networks and the Internet & Impacts of Computing, Ethics, and Security
Re-teach the three weakest subtopics identified by prior practice tests, working fresh problems in each until two consecutive correct attempts.
Complete two full-length timed practice tests under exam conditions, with no notes and strict timing.
Maintain a corrected error log that records the reasoning mistake, not just the right answer, for every missed item.
Consolidate all reference sheets into one final one-page formula and definition sheet for last-minute review.
Your checkpoint
Two completed full-length timed practice tests with per-domain scores recorded at 80% or above in every domain, and an error log in which every missed item has a written cause and a corrected explanation.
Milestones
Week 2: Explain the instruction cycle and the compiler toolchain from memory in under five minutes, and score at least 80% on a 20-question quiz covering number systems, Boolean logic, and control structures.
Week 4: Score a timed 40-question mixed test on Domains 1 and 2, record accuracy per domain, and list the three weakest subtopics with a concrete remediation task for each.
Week 6: Solve a 10-item subnetting set with 100% accuracy in under 15 minutes, and score at least 75% on a 25-question database and SQL quiz.
Week 8: Achieve 80% or higher in every domain on two full-length timed practice tests, and demonstrate that the error log contains a corrected explanation for all missed items.