COSC-506 Concrete Mathematics and Complexity

Faculty:

Squier, Richard

Velauthapillai, Mahendran

This course covers mathematical principles and tools used the development of algorithms and the analysis of their feasibility and performance. Topics are generally in the domain of discrete mathematics: propositional and predicate logic, mathematical proofs including induction, counting and basic probability theory, logarithmic and exponential functions, elementary graph theory, and complexity analysis. Prerequisites: none. Spring.

Credits: 3

Prerequisites: None

Other academic years
There is information about this course number in other academic years:

• 2004-2005 Fall and Spring
• 2008-2009 Fall and Spring
• 2009-2010 Fall and Spring
• 2010-2011 Fall and Spring

More information
Look for this course in the schedule of classes.

The academic department web site for this program may provide other details about this course.