CS3305 - Discrete Mathematics for Computing II

CS 3305 Discrete Mathematics for Computing II (3 semester credit hours) Advanced counting methods; recurrence relations, divide and conquer algorithms, principle of inclusion and exclusion. Partial orders and lattices, Algorithmic complexity. Graph theory. Strings and languages. Number theory. Elements of modern algebra. Credit cannot be received for both courses, CS 3305 and SE 3306. Double majors are required to take CS 3305. Prerequisites: (CE 2305 or CS 2305 or TE 2305) with a grade of C or better, and (MATH 2414 or MATH 2419). (3-0) S