Course Description
COM S 280 Discrete Structures
Offered Fall or Spring. 4
credits.
Pre- or co-requisite: COM S/ENGRD 211 (Computers &
Programming) or permission of instructor.
Covers mathematical aspects of
programming and computing. Topics are chosen from the
following: mathematical induction; logical proof;
propositional and predicate calculus; combinatorics and discrete
mathematics covering manipulation of sums, recurrence relations, and
generating-function techniques; basic number theory; sets,
functions, and relations; partially ordered sets; graphs; and
algebraic structures.
Required Textbook: Discrete
Algorithmic Mathematics, 2nd edition, by Maurer and Ralston.
ISBN #1-56881-091-1.
|
