Personal tools

You are here: Home → Academic Programs and Information → Courses and Schedules → COMP 163 : Discrete Structures
 

COMP 163 : Discrete Structures

Credit hours
3
Prerequisites
None.
Description
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.
Syllabus
Taught by Dr. Greenberg Spring 2005.
Document Actions
« November 2009 »
November
MoTuWeThFrSaSu
1
2345678
9101112131415
16171819202122
23242526272829
30