Mathematical Structures for Computer Science

Catalog description

The course prepares computer science majors for advanced study by emphasizing components of discrete mathematics related to computer science. The topics include sets, functions and relations, logic, Boolean algebra, graph theory, proof techniques and matrices. Examples will emphasize computer science applications. Prerequisite(s): CSCI 1301 >= C and ( MATH 1220 >= C or MATH 2011 >= C) Lecture Hours: 3 Repeatability: May not be repeated for credit. Grade Mode: Normal, Audit Schedule Type (Primary): Lecture Schedule Type (Additional): Asynchronous Instruction Click here for the Schedule of Classes.