Logic, Computational & Advanced Mathematics
Explore counting, recursion, relations, graphs, and discrete structures used in computing and modern mathematics.
Course structure
This course is published as a development map. Full lessons, practice, and assessments will be added after content review.
Complete these courses before beginning when they are available.
Learning outcomes
Module outline preview
Estimated times add up to the course’s planned learning time. Every module is in development.
Introduce finite sets, symbolic structure, and proof-aware problem-solving.
Analyze mappings and relational structure in discrete settings.
Use addition, multiplication, permutations, and combinations to count possibilities.
Model recursive processes and solve simple recurrence relationships.
Prove statements about finite or recursive structures.
Define vertices, edges, paths, degree, and connectivity.
Analyze hierarchical structures, spanning trees, and network problems.
Apply basic procedures for traversal, paths, and matching-style problems.
Connect logical operations with discrete decision systems.
Choose and justify a discrete model for a cumulative problem.
Course status
This course is not yet open for enrollment and does not include lessons, practice, assessments, or formal credit. You can review the outline while it is developed.
Recommended learning paths
These paths show a recommended order. Branches identify connected study that can follow once prerequisites are complete.
Learning path
Use proof-based reasoning to enter discrete, analytical, and abstract mathematical study.
End capabilityUse proof-based reasoning to enter discrete, analytical, and abstract mathematical study.