TECHNOLOGY-14 · Research · ENGLISH · PLANNED
Follow a real task through a system, then design and troubleshoot it.
Study time is an initial activity estimate, excluding extra reading, revision and extended laboratory or project work. Videos and question bodies have not been produced by adding this outline.
Complete these courses or demonstrate equivalent knowledge. These are recommended prerequisites, not enforced enrolment locks.
YouTube playlist: ARK Technology | Computer Science Theory and Research Studio
Playlist title reserved in the plan; no YouTube playlist or upload has been created yet.
Sign in to save this learning pathPractical outcome: Classify a toy problem by its computational requirements.
Explain finite automata using a visual and one worked real-world example. Context: Classify a toy problem by its computational requirements. End with a prediction or check-for-understanding.
Explain regular languages using a visual and one worked real-world example. Context: Classify a toy problem by its computational requirements. End with a prediction or check-for-understanding.
Explain context-free grammars using a visual and one worked real-world example. Context: Classify a toy problem by its computational requirements. End with a prediction or check-for-understanding.
Explain turing machines using a visual and one worked real-world example. Context: Classify a toy problem by its computational requirements. End with a prediction or check-for-understanding.
Use the first concepts from this section. Classify a toy problem by its computational requirements. Produce a labelled diagram, trace or calculation; explain each step and check one changed input.
3–6 questions on the preceding first-half concepts only: recall, visual interpretation, application and one plausible misconception. Explain each answer after submission.
Explain decidability using a visual and one worked real-world example. Context: Classify a toy problem by its computational requirements. End with a prediction or check-for-understanding.
Explain reductions using a visual and one worked real-world example. Context: Classify a toy problem by its computational requirements. End with a prediction or check-for-understanding.
Explain p versus np using a visual and one worked real-world example. Context: Classify a toy problem by its computational requirements. End with a prediction or check-for-understanding.
Explain approximation algorithms using a visual and one worked real-world example. Context: Classify a toy problem by its computational requirements. End with a prediction or check-for-understanding.
Classify a toy problem by its computational requirements. Work without the example, compare two cases, record assumptions and limitations, then self-review correctness, reasoning and clarity.
6–12 questions covering Finite automata, Regular languages, Context-free grammars and the remaining section concepts, with cumulative retrieval from earlier sections. Include a new transfer problem; 70% unlocks progression.
Practical outcome: Prepare an architecture experiment with repeatable measurements.
Explain compiler pipeline using a visual and one worked real-world example. Context: Prepare an architecture experiment with repeatable measurements. End with a prediction or check-for-understanding.
Explain type systems using a visual and one worked real-world example. Context: Prepare an architecture experiment with repeatable measurements. End with a prediction or check-for-understanding.
Explain formal verification using a visual and one worked real-world example. Context: Prepare an architecture experiment with repeatable measurements. End with a prediction or check-for-understanding.
Explain concurrent algorithms using a visual and one worked real-world example. Context: Prepare an architecture experiment with repeatable measurements. End with a prediction or check-for-understanding.
Use the first concepts from this section. Prepare an architecture experiment with repeatable measurements. Produce a labelled diagram, trace or calculation; explain each step and check one changed input.
3–6 questions on the preceding first-half concepts only: recall, visual interpretation, application and one plausible misconception. Explain each answer after submission.
Explain parallel computing using a visual and one worked real-world example. Context: Prepare an architecture experiment with repeatable measurements. End with a prediction or check-for-understanding.
Explain storage engines using a visual and one worked real-world example. Context: Prepare an architecture experiment with repeatable measurements. End with a prediction or check-for-understanding.
Explain distributed consensus assumptions using a visual and one worked real-world example. Context: Prepare an architecture experiment with repeatable measurements. End with a prediction or check-for-understanding.
Explain performance benchmarking using a visual and one worked real-world example. Context: Prepare an architecture experiment with repeatable measurements. End with a prediction or check-for-understanding.
Prepare an architecture experiment with repeatable measurements. Work without the example, compare two cases, record assumptions and limitations, then self-review correctness, reasoning and clarity.
6–12 questions covering Compiler pipeline, Type systems, Formal verification and the remaining section concepts, with cumulative retrieval from earlier sections. Include a new transfer problem; 70% unlocks progression.
Practical outcome: Build and document an accessible bounded prototype with a test plan.
Explain literature review using a visual and one worked real-world example. Context: Build and document an accessible bounded prototype with a test plan. End with a prediction or check-for-understanding.
Explain research questions using a visual and one worked real-world example. Context: Build and document an accessible bounded prototype with a test plan. End with a prediction or check-for-understanding.
Explain experimental baselines using a visual and one worked real-world example. Context: Build and document an accessible bounded prototype with a test plan. End with a prediction or check-for-understanding.
Explain reproducible artifacts using a visual and one worked real-world example. Context: Build and document an accessible bounded prototype with a test plan. End with a prediction or check-for-understanding.
Use the first concepts from this section. Build and document an accessible bounded prototype with a test plan. Produce a labelled diagram, trace or calculation; explain each step and check one changed input.
3–6 questions on the preceding first-half concepts only: recall, visual interpretation, application and one plausible misconception. Explain each answer after submission.
Explain privacy review using a visual and one worked real-world example. Context: Build and document an accessible bounded prototype with a test plan. End with a prediction or check-for-understanding.
Explain technical writing using a visual and one worked real-world example. Context: Build and document an accessible bounded prototype with a test plan. End with a prediction or check-for-understanding.
Explain peer review using a visual and one worked real-world example. Context: Build and document an accessible bounded prototype with a test plan. End with a prediction or check-for-understanding.
Explain product demonstration using a visual and one worked real-world example. Context: Build and document an accessible bounded prototype with a test plan. End with a prediction or check-for-understanding.
Build and document an accessible bounded prototype with a test plan. Work without the example, compare two cases, record assumptions and limitations, then self-review correctness, reasoning and clarity.
6–12 questions covering Literature review, Research questions, Experimental baselines and the remaining section concepts, with cumulative retrieval from earlier sections. Include a new transfer problem; 70% unlocks progression.
Combine all three sections: Build and document an accessible bounded prototype with a test plan. Submit an original worked artifact, evidence or tests, assumptions and a reflection. Rubric: correctness, method, practical usefulness, reproducibility and communication. Self-reviewed, not certified.
6–12 balanced questions sampling every section of Computer Science Theory and Research Studio, including interpretation, calculation or reasoning, a misconception and a new application. Passing is 70%; review errors before retrying.
System diagrams, design reviews and bounded prototypes. Guided work leads to an independent attempt, with a diagram, explanation, trace, calculation or tested artifact. Question bodies are generated when opened in your private learning path. Programming submissions are stored as text; the platform does not execute submitted code.
Use original or appropriately licensed datasets. Practical science activities use models or supplied data unless a qualified supervisor has reviewed a physical experiment.
Open the interactive practice sampler →