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


Home & News
Syllabus
Course documents
  - Homeworks
  - Topics covered
  - Grades
Online Documents

Syllabus

InstructorDr. Haluk Bingöl, bingolboun.edu.tr, x7121, ETA 48
AssistantItır Karaç, itir.karacboun.edu.tr, x7781, ETA 47
Office Hours: Tuesday 14:00-15:00
Web Sitehttp://www.cmpe.boun.edu.tr/courses/cmpe220
Time/RoomLectures: MMF 564 / ETA B5 ETA B5 ETA A3
PS: F 5 / ETA ???
First Meeting19.02.2007/13: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 Abstract Algebra
Lidl & Pils
Springer-Verlag, 1984, [QA162.L53]

 
[http://www.cmpe.boun.edu.tr/courses/?cmpe=220   updated:20072002]