|
The course introduces fundamental ideas in discrete structures, serving as a basis for subsequent courses in computer information science. Topics include sets, functions and relations, the Pigeonhole Principle, basic counting methods, elementary logic, mathematical induction, recursion, trees and graph theory. (Offered every semester.) |