|
|
Syllabus
CmpE 220 Discrete Computational Structures
Fall Semester
Haluk Bingöl
Catalog DataPropositional Logic and Proofs. Set Theory. Relations and
Functions. Algebraic Structures. Groups and Semi-Groups. Graphs, Lattices, and
Boolean Algebra. Algorithms and Turing Machines.
TextbookK. H. Rosen (1999) Discrete Mathematics and Its
Applications 4th (or later) Edition, McGraw-Hill. (Available at BU
Bookstore).
InstructorDr Haluk Bingöl, Department of Computer
Engineering, Bogazici University
Teaching AssistantsEvrim Itır Karaç, Albert Ali Salah, TA.
GoalsA 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.
PrerequisiteSophomore 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 UsageNone.
Total Credits3.
Grading
- 2 Mid-terms 2*20%
- Final 40%
- Exercises 20%
|