Welcome to COMP 2230 - Foundations of Computer Science! This website is designed to keep you informed about the schedule, policies, assignments, and other elements of the course.
Meeting Time and Place
| Time: | MWF 9:10 - 10:05 a.m. |
| Location: | Art & Communication C116 |
| Prerequisites: | MATH 1230 |
Instructor
| Name: | Dr. Barry Wittman |
| E-mail: | wittman1@otterbein.edu |
| Office: | Art & Communication C123 |
| Phone: | (614) 823-2944 |
| Office Hours: |
MF 2:00 - 4:00 p.m. W 2:00 - 3:30 p.m. TR 10:00 - 11:15 a.m. TR 2:00 - 4:00 p.m. and by appointment |
Text Book
|
Susanna S. Epp |
 |
Course Catalog Description
A continued exploration of the mathematical foundations of computer science begun in Discrete Mathematics. Topics include asymptotic analysis and complexity, discrete probability, relations, graph theory, Boolean algebra, and automata theory.
Student Learning Outcomes
By the end of the course, students will be able to:
- Apply knowledge of computing and mathematics to solve problems
- Apply mathematical induction
- Apply counting and basic probability
- Explain the mathematical foundation of recursion
- Prove basic facts about algorithm running time
- Prove properties of relations
- Prove properties of trees and graphs
- Use regular expressions and finite-state automata and show their equivalence
- Explain issues posed by higher level formal languages and the Halting Problem
Program Learning Outcomes
The Computer Science major has a set of ten Student Learning Outcomes (SLOs). Work in this course contributes to the following SLOs:
- Students are proficient in logic and discrete mathematics.
- Students can develop an understanding of the recurring themes of abstraction and computation.
