About This Site

graph TD
    O[Problem] --> A[Algorithm]
    A --> B[Data Structure]
    B --> C[Solution]

Wyatt’s Notes provides comprehensive study materials for computer science theory. These notes cover algorithms, data structures, computational complexity, formal languages, and discrete mathematics, building the theoretical foundation essential for computer scientists.

These notes are developed by Wyatt, an educator and content creator with deep knowledge of computer science pedagogy. Content follows the standard undergraduate CS curriculum, emphasising formal reasoning, algorithm analysis, and the mathematical foundations of computation.

Materials balance theoretical rigour with practical relevance. Every concept is connected to real-world computing applications, from compiler design to distributed systems, reflecting the applied nature of modern computer science.

• Algorithms covering sorting, searching, graph algorithms, and dynamic programming
• Data structures including trees, hash tables, heaps, and balanced trees
• Computational complexity with P, NP, and reduction theory
• Formal languages covering automata, grammars, and computability
• Discrete mathematics for mathematical foundations of CS

Wyatt develops resources across computer science, mathematics, and programming, enabling deep interdisciplinary connections. Materials are informed by standard university curricula, research-level insights, and industry practice.

• Mathematics, University-level mathematics notes
• Programming, Programming language resources
• Databases, Database design and SQL notes

Start with algorithms and data structures to build core CS theory. Each topic progresses from definitions through proofs to applications. Use the practice problems to develop your algorithmic thinking.

Visit wyattsnotes.wyattau.com for the full network of study resources.

This site provides comprehensive study materials covering:

• Algorithms
• Data structures
• Operating systems
• Networks
• Theory of computation

1. Start with fundamentals, begin with the core topics before moving to advanced material
2. Work through examples, every concept includes worked examples with step-by-step solutions
3. Test yourself, use the practice problems and diagnostic tests to identify knowledge gaps
4. Cross-reference, related topics on other sites in the Wyatt’s Notes network provide additional perspectives

• Flashcards, spaced repetition flashcards for key concepts and formulas
• Practice Problems, graded problems from basic to advanced
• Diagnostic Tests, identify your strengths and weaknesses
• Worked Examples, step-by-step solutions to common problems

These notes are informed by standard university textbooks including Cormen (CLRS), Silberschatz, Sipser. While the notes follow the general structure of these texts, they are not a substitute for reading the primary sources.

programming experience, discrete mathematics

• Mathematics, University-level mathematics
• Physics, University-level physics
• Computer Science, Algorithms, data structures, and theory
• Programming, Programming fundamentals and practice

For questions, corrections, or suggestions, visit wyattsnotes.wyattau.com or open an issue on GitHub.

• Computing
• Computing
• Algorithms and Data Structures

• Rushing through foundational material
• Not practising problems after reading
• Failing to connect concepts across topics

• Algorithms and Data Structures
• Before You Begin: The Abstractions CS Assumes You Already Have
• Complete Computer Science Study Guide
• Computer Networks