Announcements

Instructors

Alex Pothen Vernon Rego

Teaching Assistants

Fang-Yu Rao TA 2

Grades

Grades will be determined based on the following course work: Course grades are maintained on Blackboard (course staff and students only).

Academic Dishonesty Policy

Please read this policy before starting as we intend on enforcing it strictly.
For further information, look at the Professional Honesty & Conduct section of this page.

Course Description

In this course, students learn many interesting principles and aspects of computer
science that comprise the basic tools of solving different problems related to computer
science. Students should be able to develop analytical skills and become very well
acquainted with computer science terminologies. Students are encouraged to
get engaged in class discussion and raise any question whenever they have a concern.

Prerequisites

CS 18000, MA 16100

Topics Covered (tentative)

Sets, sequences, functions, and relations
Number representations
Logic and proofs
Boolean algebra and combinatorial circuits
Mathematical proofs
Counting
Discrete probability
Graphs and trees
Algorithms and their complexities
Finite state machines
Pushdown automata
Complexity classes, computability, and undecidability