CS 250 Discrete Structures

Old Content	This page was recently redesigned. To access this course's old homepage, please click here.
Description	Discrete structures for computer science, including sets, functions, elementary prepositional and predicate logic, Boolean algebra, elementary graph theory combinatorics and proof techniques including induction and contradiction.
Credit Hours	3.000 Credit hours
Type	Lecture
Prerequisites	Undergraduate level CS 201 Minimum Grade of C and Undergraduate level MA 105 Minimum Grade of C
Files	cs250syllmaster.pdf Master Syllabus

Semester	Section	Days	Time	URL
Spring 2010	2C	TR	11:00 am-12:15 pm	Class homepage
Fall 2009	4A	TR	03:30 pm-04:45 pm	Class homepage
Spring 2009	2B	TR	09:30 am-10:45 am	Class homepage
Fall 2008	2B	TR	09:30 am-10:45 am	Class homepage
Spring 2008	2D	TR	12:30 pm-01:45 pm	Class homepage
Fall 2007				Class homepage
Summer 2007				Class homepage
Spring 2007				Class homepage
Fall 2006				Class homepage
Summer 2006				Class homepage
Spring 2006				Class homepage
Fall 2005				Class homepage
Summer 2005				Class homepage
Spring 2005				Class homepage
Fall 2004				Class homepage