Stanford Computer Science Courses
CS154-Introduction to Automata and Complexity Theory
In this introductory course on theory of computation, students will be asked to find solutions to several computational questions – ranging from how computation is defined to how problems can be efficiently solved through these models. Some of these questions can be answered completely and some questions lead to major open problems in computer science and mathematics today. By the end of this course, students will be able to classify computational problems in terms of their computational complexity. Students will also gain a deeper appreciation for some of the fundamental issues in computing that are independent of technology trends.
CS157-Logic and Automated Reasoning
This course covers propositional and predicate logic, axiomatic theories, and theories with equality and induction. Explore syntax, semantics, models, logical entailment, proofs, soundness, completeness, and decidability. Learn about reasoning methods including the truth table method, natural deduction, the Davis-Putnam procedure, resolution, model elimination, demodulation, and paramodulation.
CS161-Design and Analysis of Algorithms
Algorithms are essential to the study of computer science and are increasingly important in the natural sciences, social sciences and industry. Learn how to effectively construct and apply techniques for analyzing algorithms including sorting, searching, and selection. Gain an understanding of algorithm design technique and work on algorithms for fundamental graph problems including depth-first search, worst and average case analysis, connected components, and shortest paths.
Sorry, the comment form is closed at this time.