CSE 260 Discrete Structures

CSE Dept., MSU, Fall, 2009

Course Description

Propositional and first order logic. Equivalence, inference and method of proof. Mathematical induction, diagonalization principle. Basic counting, discrete probability. Set operations, relations, functions. Grammars and finite state automata. Applications to computer science and engineering.

Section 1:: Mon, Wed 10:20 - 11:40 room 311 Bessey Hall; Fri 12:40 - 1:30 EB 1234; Instructor: Dr Laura Dillon; Office: 3132 Engineering Building; Office hours: Mondays noon - 1:30 and Thursdays 3:00 - 4:20, or by appt.
Section 2:: Instructor: Dr George Stockman; Mon, Wed 3:00 - 4:20 EB 2400; FRI 3:00 - 3:50 EB 2400; Office: 2128 Engineering Building; Office hours: Mondays 1:30-2:30 and Thursdays 10-11:30, or by appt.
Teaching Assistant, both sections:: Mr Paul Cornwell; Office Hours: EB 3345 Tue 1-2 PM and Fri 11-noon
Prerequisites: Calculus 2: MTH 133 or MTH 126 or MTH 153H or LBS 119
Text: Required: Discrete Mathematics and its Applications, sixth edition (Kenneth H. Rosen; 2006)

Links