This course covers the mathematical foundations of computer science, including such topics as complexity of algorithms, modular arithmetic, induction and proof techniques, graph theory, combinatorics, Boolean algebra, logic circuits, and automata.
3
None
Mathematical foundations of computer science. Topics include: complexity of algorithms; modular arithmetic; induction and proof techniques; graph theory; combinatorics; Boolean algebra and switching systems (including Karnaugh maps and the Quine-McCluskey method); symbolic logic and logic circuits; and an introduction to automata and formal languages.
The student will be prepared for the study of advanced ideas in computer science, from cryptography to databases to algorithms to computer architecture.
| Semester/Year | Instructor | URL |
|---|---|---|
| Fall 2013 | Dr. Greenberg | http://rig.cs.luc.edu/~rig/courses/syllabi/c163f13.pdf |