COS150a_syllabus_Fall2014.doc.docVIP

COS150a Discrete Structures AUBG, Computer Science department, Fall semester 2014 Assoc. Prof. Svetla Boytcheva, PhD Syllabus Course Objectives: This course presents fundamental discrete mathematics concepts which are essential to understanding the capabilities and limitations of computers. The material develops a practical command of mathematical structures through a wide selection of problems. The discrete structures are presented in a formal framework useful for further study in the field of computer science. The major topics covered include introduction to: Logical Thinking – Formal Logic, Propositional Logic, Boolean Algebra, Predicate Logic Relational Thinking – Graphs, Sets Theory, Relations and Functions Recursive Thinking – Recurrence Relations, Mathematical Induction Quantative Thinking – Basic Counting Principles, Combinatorics Analytical Thinking – Algorithms. Traversal Algorithms. Greedy Algorithms. Thinking Through Applications – Formal Languages. Finite State Machines. Regular Expression. No prerequisites. COS150 serves a prelude to COS221 course where more advanced programming concepts are introduced. COS150 is required course for COS Major program. Course Description: The COS150 Discrete Structures course includes lectures, exercises, quizzes and homeworks. COS 150 course content is designed according to the ACM/IEEE Curriculum Guidelines for Undergraduate Degree Programs in Computer Science (/users/sahami/CS2013/final-draft/CS2013-final-report.pdf) and covers all the topics listed in body of knowledge except discrete probability. We will cover topics in chapters in Susanna S. Epp, Discrete Mathematics With Applications. We will not cover all the chapters of the book. We will not cover all sections of all covered chapters Exercises contain discussion on examples and tasks to be individually solved by the student. Quizzes are short 10-15 min sessions and intend to train student skills in understanding specific algorithms and knowledge about fund