CmpE 220 Discrete Computational Structures

Fall Semester

Ethem Alpaydin

Catalog Data

Propositional Logic and Proofs. Set Theory. Relations and Functions. Algebraic Structures. Groups and Semi-Groups. Graphs, Lattices, and Boolean Algebra. Algorithms and Turing Machines.

Textbook

K. H. Rosen (1999) Discrete Mathematics and Its Applications 4th (or later) Edition, McGraw-Hill. (Available at BU Bookstore).

Instructor

Dr Ethem Alpaydin, Professor. Department of Computer Engineering, Bogazici University alpaydin AT boun.edu.tr

Teaching Assistant

Itir Barutcuoglu, TA.

See the Course Web Page for homeworks, grades, etc.

Goals

A course in discrete mathematics should teach students how to work with discrete (meaning consisting of distinct or unconnected elements as opposed to continuous) structures used to represent discrete objects and relationships between these objects. These discrete structures include sets, relations, graphs, trees, and finite-state machines.

Prerequisite

Sophomore standing in CmpE.

Topics

  • Logic, Sets, and Functions
  • Methods of Proof
  • Recurrence Relations
  • Binary Relations
  • Graphs
  • Trees
  • Algebraic Structures
  • Introduction to Languages and Grammars

    Computer Usage

    None.

    Total Credits

    3.

    Grading