NYSTCE Computer Science study plan
NYSTCE Computer Science · Give each week a clear focus.
8 weeks · About 6 hours per week
Computer Science content domain (as enumerated in the official 194 framework)
Map every subarea named in the official 194 framework to a personal checklist and rate current confidence 1-5 on each
Write working pseudocode for iteration, recursion, and nested control flow without reference material
Trace variable scope, parameter passing, and return values through a 20-line program by hand on paper
Define algorithm, program, and computation precisely enough to distinguish them in a short written answer
Your checkpoint
A one-page framework coverage matrix with confidence ratings plus three hand-traced program outputs checked against actual execution
Computer Science content domain (as enumerated in the official 194 framework)
Implement search (linear, binary) and sort (selection, insertion, merge) routines from memory in one language
Compare time and space complexity of each implemented algorithm using Big-O notation with justification
Distinguish abstract data types from their implementations for list, stack, queue, and map
Solve five short trace problems involving stacks and queues by hand
Your checkpoint
A working code file of six algorithms with a complexity table and hand-traced outputs for five data-structure problems
Computer Science content domain (as enumerated in the official 194 framework)
Convert between binary, octal, decimal, and hexadecimal by hand for 20 values including negatives in two's complement
Perform binary addition and subtraction and identify signed overflow
Explain how characters, integers, and floating-point values are encoded at the bit level
Compute the address of an array element given a base address and element size
Your checkpoint
A 25-item self-quiz on number systems, two's complement, and addressing, scored and with every miss reworked until correct
Computer Science content domain (as enumerated in the official 194 framework)
Diagram the fetch-decode-execute cycle and label registers, buses, and memory roles
Trace a short instruction sequence through registers and memory to a final state
Explain the memory hierarchy and predict which level serves a given access pattern
Differentiate compiled, interpreted, and hybrid execution models with examples
Your checkpoint
A labeled machine-cycle diagram plus a completed register/memory trace table for a six-instruction program
Computer Science content domain (as enumerated in the official 194 framework)
Write and debug programs using conditionals, loops, functions, and arrays in one language
Apply top-down design by decomposing a stated problem into named functions before coding
Identify and fix five seeded logic and off-by-one errors in provided-style code you write yourself
Explain the difference between syntax, runtime, and logic errors with an example of each
Your checkpoint
A tested program of at least 60 lines with a decomposition outline and a bug log documenting each defect found and fixed
Computer Science content domain (as enumerated in the official 194 framework)
Model a small problem as entities, attributes, and relationships and derive a normalized table design
Write select, join, and aggregate queries against your own schema
Explain primary keys, foreign keys, and referential integrity with concrete examples
Describe how the internet layers (link, network, transport, application) cooperate to deliver a request
Your checkpoint
A schema diagram with three normalized tables, five working queries and their result sets, and a one-page layered walkthrough of a web request
Computer Science content domain (as enumerated in the official 194 framework)
Outline the social, legal, and ethical issues named in the framework, including privacy, security, equity of access, and intellectual property
Explain how encryption, authentication, and hashing differ and when each is appropriate
Describe impacts of computing on society and identify a defensible position on one current issue
Recognize common network and software vulnerabilities and their mitigations
Your checkpoint
A two-page position brief on one computing ethics issue plus a 15-item self-quiz on security and legal concepts, scored
Computer Science content domain (as enumerated in the official 194 framework)
Re-rate every framework subarea and close remaining gaps with targeted practice
Complete two timed 60-question practice sets and analyze every error by cause
Rehearse written explanations of ten core concepts aloud in under two minutes each
Finalize a one-page formula and terminology sheet for last-minute review
Your checkpoint
A completed practice-test error analysis with a final confidence matrix showing every subarea at 4 or higher, or a written plan for each remaining weak area
Milestones
Week 2: Can implement and justify the complexity of linear and binary search and two sorts from memory without notes
Week 4: Can convert numbers across bases, apply two's complement, and trace a fetch-decode-execute sequence accurately on a timed 20-minute drill
Week 6: Can design a normalized schema, write join and aggregate queries, and explain a layered network request unaided
Week 8: Scores at or above your target on two timed practice sets and every framework subarea is rated 4 or higher