This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: MSU CSE 260 Section 1 – Spring 2008 Discrete Structures in Computer Science http://www.cse.msu.edu/~cse260/001/ Updated: Mar 24, 2008 Catalog Course Description Propositional and first order logic. Equivalence and methods of proof. Basics of counting. Set operations, relations, functions. Grammars and finite state automata. Discrete probability. Appli- cations to computer science and engineering. Course Objectives The role of discrete mathematics in computer science is analogous to the role of calculus in physics and in engineering: it provides the mechanisms that allow computer scientists to define and reason about complex systems. Complex systems of interest include software, algorithms, data structures, and hardware. The objectives of this course are to introduce the mathematical concepts that provide the basis for much of computer science and to develop the ability to describe and analyze problems in a logical and systematic fashion. This course focuses primarily on: • Logic and mathematical reasoning • Set theory and functions • Induction and recursion • Mathematical relations • Grammars and finite state machines To achieve these objectives, we study broad, general concepts in these areas. Applications in computer science and in computer engineering are discussed to illustrate concepts....
View Full Document
This note was uploaded on 07/25/2008 for the course CSE 260 taught by Professor Saktipramanik during the Spring '08 term at Michigan State University.
- Spring '08
- Computer Science