2019 Fall Courses



CS 7220 Computability and Complexity


Instructor: Professor Sudkamp

Office Hours: 11:0012:00, 2:003:00 Tuesday, Thursday

and by appointment


Prerequisite: CS 3200 or an undergraduate theory of computer science course


Section 01:

Time: 3:30-4:50 Tuesday, Thursday

Room: 339 Russ


Section 90: online


The objective of this course is to establish basic properties of algorithmic computability and computational complexity. In particular, the relationship between complexity defined by Turing machines and that of `high-level' algorithmic systems will presented. Upon completion of this course, students should be able to demonstrate mastery of the following topics:


CS 7220 Learning Outcomes





CS 2200 Discrete Structures


Prerequisite: CS1200

Co-requisite: CS2200R


Section 01: 12:30-1:50 Tuesday, Thursday

009 Student Success Center

Instructor: Professor Sudkamp

Office Hours: 11:00-12:00, 2:00-3:00 Tuesday, Thursday,

and by appointment, room 495 Joshi


Email: thomas.sudkamp@wright.edu

Phone: 937 775-5170



Recitation Section

Section 05: 3:30-4:25 Thursday

346 Russ Engineering

Section 06: 2:00-2:55 Thursday

346 Russ Engineering

Section 07 10:10-11:05 Friday

355 Russ Engineering


Mr. Joy Prakash Sain,

Office: 436 Russ Engineering

Office Hours: 1:00-6:00 Monday, 10:00-12:30 Thursday

Email: sain.9@wright.edu


Dr. Amelie Gyrard

Office: 387 Joshi

Office Hours: 2:00-5:00 Wednesday, 2:00-5:00 Friday

Email: amelie@knoesis.org




CS 2200 Learning Outcomes

-          Students will be able to demonstrate a working knowledge of discrete structures and their algorithms as relevant for computer science.

-          Students will understand the concepts of rigorous proof and formal argumentation.