About CS 1640 A

Introduction to analytic and formal methods of computer science with practical examples, including analysis or data structures, recursion relations, proof methods, and logic programming. Credit not awarded for both CS 1640 and MATH 2055. Prerequisites: CS 1210 or CS 2100; MATH 1234 or MATH 1242.

Notes

Prereqs enforced by the system: (CS 1210 or 2100) and (MATH 1234 or 1242); Open to Degree and PACE students

Section Description

Discrete Structures covers the fundamental mathematical tools that Computer Science students will need for upper level classes. We will focus on logic and proofs, sets and functions, primes and divisibility and advanced proof techniques. Students will learn to understand logical reasoning, construct well formed proofs, define one-to-one and onto functions, prove that sets are countable and work with prime numbers.

Section Expectation

The textbook we will be using is an interactive online textbook called Discrete Math, available through zyBooks.com. This requires a purchase of online access to the book for the semester, which will be under $70.

Evaluation

Online and written assignments and quizzes will be used for evaluation.

Important Dates

Note: These dates may change before registration begins.

Note: These dates may not be accurate for select courses during the Summer Session.

Deadlines
Last Day to Add
Last Day to Drop
Last Day to Withdraw with 50% Refund
Last Day to Withdraw with 25% Refund
Last Day to Withdraw

Resources

There are no courses that meet this criteria.