Path Category
Loading Path Category from the AllPath API…
ALLPATHFoundationALLPATHFoundationPath Category
Loading Path Category from the AllPath API…
Path Category
Guided learning journeys that build knowledge step by step.
category · Learning · slug · learning · 7819 Paths
7819 Paths · page 757 / 782
A structured learning path covering essential linear algebra concepts—from vectors and matrices to eigenvalues and SVD—with concrete applications in computer graphics, machine learning, and scientific computing. Designed for university CS and data science students with basic algebra background.
This path covers the essential mathematical foundations for computer science: mathematical logic, set theory, functions, combinatorics, graph theory, number theory, and proof techniques. It is designed for university CS students with basic algebra, systematically building from fundamental concepts to advanced applications.
This learning path covers the core principles and architectures of distributed systems, including communication, synchronization, consistency, fault tolerance, and distributed file systems. It assumes foundational knowledge in networking and operating systems, and guides learners through the key concepts and challenges in designing and understanding distributed systems.
A structured path covering the design and organization of computer systems, starting from digital logic and assembly, through the core concepts of instruction set architecture, pipelining, memory hierarchies, and I/O, culminating in multiprocessor architectures. This path emphasizes the dependencies between levels of abstraction and provides a systematic understanding of how modern computers are built and optimized.
This learning path guides university computer science students through the fundamental phases of compilation, from lexical analysis to code generation. It combines theory of computation, data structures, and programming practice to build a working compiler for a high-level language.
A comprehensive learning path covering the mathematical foundations and core topics of computation theory: automata, formal languages, computability, and complexity. Starting from discrete mathematics and logic, it progresses through finite automata, regular languages, context-free grammars, Turing machines, decidability, and culminates in NP-completeness.
A comprehensive learning path for university CS students covering advanced algorithm design paradigms (divide and conquer, dynamic programming, greedy algorithms) and graph algorithms, culminating in complexity classes and the P vs NP problem. The path builds on discrete mathematics and data structures, emphasizing rigorous analysis of efficiency and correctness.
This learning path provides a comprehensive introduction to artificial intelligence, focusing on core problem-solving techniques such as search algorithms and game playing, as well as knowledge representation and logical reasoning. It is designed for university students with a background in programming and discrete mathematics, preparing them for further study or careers in AI.
This learning path introduces the core concepts of computer graphics, covering the mathematical foundations of transformations and projections, the rasterization pipeline, shading and texturing, and basic image processing. It is designed for university students in CS and game development who have some programming experience and a basic understanding of linear algebra.
A beginner-friendly path for high school students to learn the core principles of designing intuitive, accessible, and user-centered interfaces. It covers user-centered design, usability, prototyping, user testing, and accessibility, with practical application using design tools.