CMPE 220 Discrete Computational Structures (3+0+0) 3
Bingol - 2006 Spring



Home & News
Syllabus
Contact Us
Online Documents
Homeworks & ToDo
Grades

Syllabus

InstructorDr. Haluk Bingöl, bingol@boun.edu.tr, x7121, HKC 213
AssistantAlbert Ali Salah, salah@boun.edu.tr, x4490, HKC BAL
Web Sitehttp://www.cmpe.boun.edu.tr/courses/cmpe220
Time/RoomLectures: FFF 145 / HKD 101
PS: F 6 / HKD 201
First Meeting03.03.2006/09:00
Text Book Discrete Mathematics and Its Applications, 5e
Rosen
McGraw-Hill, 2003
[ QA39.3.R67 2003]
Grading 20% Midterm #1
20% Midterm #2
20% Homeworks & Quizzes
40% Final
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.
Course Outline 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.
Topics
  • Logic, Sets, and Functions
  • Methods of Proof
  • Recurrence Relations
  • Binary Relations
  • Graphs
  • Trees
  • Algebraic Structures
PrerequisitesSophomore standing in CmpE.
References

Introduction to Discrete Structures
Preparata & Yeh
Addison-Wesley, 1973, [QA162.P7]

Applied Abstruct Algebra
Lidl & Pils
Springer-Verlag, 1984, [QA162.L53]