SAT solver
Write a Boolean satisfiability solver (DPLL) and use it to solve sudokus.
All pathsDiscover Coursera PlusAfter step 1 After step 3 After step 4
Computer science · 38Intermediate
Logic & Symbolic AI
Theory-minded learners drawn to logic, reasoning and graphical models.
Logic and mathematics for computing, proofs and graphs, algorithms, then Bayesian networks and inference.
435hours of coursework
44weeks at 10 h
4steps
17courses
3universities
Target skills
AlgorithmsGraph TheoryDeductive ReasoningStatisticsMathematical ModelingArithmeticProgramming PrinciplesProbabilityComputer ScienceTrigonometryAlgebraMathematical Theory & Analysis
Skill labels as listed on Coursera.
Target jobs
- AI researcher
- Formal verification engineer
- Computer science PhD student
Progression
- 1University of London (Goldsmiths)Beginner
Show the 5 courses
Course Level Length Rating (reviews) Mathematical Foundations for Computing Beginner 20 h — Applied Mathematical Methods for Computing Beginner 19 h — Geometry and Calculus for Computing Beginner 15 h — Logic and Reasoning for Computing Intermediate 18 h — Algorithms and Complexity Intermediate 19 h — - 2University of California San DiegoBeginnerPython
Stated prerequisites: Basic math (fractions, squares), basic Python (functions, loops, recursion)
Show the 5 courses
Course Level Length Rating (reviews) Mathematical Thinking in Computer Science Beginner 42 h 4.4 (2,289) Combinatorics and Probability Beginner 23 h 4.6 (874) Introduction to Graph Theory Beginner 21 h 4.5 (1,073) Number Theory and Cryptography Beginner 17 h 4.5 (610) Delivery Problem Beginner 13 h 4.7 (376) - 3Stanford University (Stanford Online)IntermediateC, Java, Python
Stated prerequisites: Programming in at least one language (C, Java or Python); familiarity with proofs (induction, contradiction); discrete probability
Show the 4 courses
Course Level Length Rating (reviews) Divide and Conquer, Sorting and Searching, and Randomized Algorithms Intermediate 15 h 4.8 (5,342) Graph Search, Shortest Paths, and Data Structures Intermediate 14 h 4.8 (2,002) Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming Intermediate 15 h 4.8 (1,279) Shortest Paths Revisited, NP-Complete Problems and What To Do About Them Intermediate 13 h 4.8 (832) - 4Stanford University (Stanford Online)AdvancedMATLAB, Octave
Stated prerequisites: Abstract thinking and math skills, programming in at least one language, basic discrete probability (independence, conditional independence, Bayes' rule)
Show the 3 courses
Course Level Length Rating (reviews) Probabilistic Graphical Models 1: Representation Advanced 67 h 4.6 (1,445) Probabilistic Graphical Models 2: Inference Advanced 38 h 4.6 (491) Probabilistic Graphical Models 3: Learning Advanced 66 h 4.6 (305)
With Coursera Plus
This path takes 435 hours, about 10 months at 10 hours a week. A Coursera Plus subscription gives access to most of its courses during that time.
Projects to build
Planner
Program a planner that finds a sequence of actions to reach a goal, using A* search.
Probabilistic expert system
Model a small diagnostic domain with a Bayesian network and explain its conclusions.
Free textbooks
Mathematics for Computer ScienceE. Lehman, F. T. Leighton, A. R. Meyer (MIT)Free, CC BY-SA
AlgorithmsJeff EricksonFree, CC BY 4.0
Probabilistic Machine Learning: An IntroductionKevin P. MurphyFree PDF, CC BY-NC-ND