Comp Sci 1200: Discrete Mathematics for Computer Science
This course provides a rigorous treatment of topics from discrete mathematics which are essential to computer science. Principal topics include: formal logic (propositional & predicate), set theory, proof techniques, mathematical induction, program correctness, combinatorics, discrete probability, relations, functions, matrices, and graph theory.
Time/Day: 12:40 PM - 01:40 PM MTWRF
Prerequisites: A grade of "C" or better in either Comp Sci 1500 or Comp Sci 1570 and in one of Math 1120, Math 1140, Math 1208, or Math 1214.
Course Component(s): Lecture
Attention Distance Students
For classes produced by I.T. MediaServices: Access to live and archived media will be available in MediaSpace at mst.mediaspace.kaltura.com or in Panopto at mst.hosted.panopto.com. For more information email email@example.com.
For other course content: please contact your instructor.
|Campus||Delivery Mode||Class Status||Class Nbr||Section|
|Course Access Information|
|Learning Management System||Canvas|