SUNY Korea Computing Society
CSE 215 - Foundations of Computer Science
CSE 215 - Foundations of Computer Science
Introduction to the logical and mathematical foundations of computer science. Topics include functions, relations, and sets; recursion; elementary logic; and mathematical induction and other proof techniques.
| Details | Description |
|---|---|
| Credits | 4 |
| Prerequisites | AMS 151 or MAT 125 or MAT 131 |
Course Outcomes
- An ability to define and use discrete structures such as functions and sets.
- To understand recursion as a computing paradigm.
- An ability to use logic and basic proof techniques, such as mathematical induction.
- An ability to discuss major concepts and ideas about the foundations of computing
- and computer science.
Course Topics
| Topic | Materials |
|---|---|
| Sets and Functions | |
| Relations and Integer Representations | |
| Propositional Logic | |
| Boolean Algebra | |
| Proof Methods | |
| Sequences and Summations | |
| Induction and Recurrence | |
| Basics of Counting | |
| Advanced Counting and Basic Probability | |
| Graph Theory | |
| Graph Applications and Trees | |
| Special topics: Gray codes |
Textbooks
Susanna Epp, "Discrete Mathematics with Applications", Brooks/Cole (Thomson), 4th ed., 2010
Edit this page on GitHub