Loyola University Chicago

Department of Computer Science

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.