|
|||||||||||||||||||||
Computer Science Engineering | |||||||||||||||||||||
SYLLABUS | |||||||||||||||||||||
2013-2014 Fall Semester | |||||||||||||||||||||
Course Code | Course Name | Course Type | Weekly Course Hours | Credits | ECTS | Campus / Weekly Time & Classroom Schedule | |||||||||||||||
T | A | L | |||||||||||||||||||
MATH257 | Discrete Mathematics | Compulsory | 3 | 0 | 0 | 3 | 7 |
Göztepe Thursday 12:30-13:20 Friday 14:30-16:20 at MC163 |
|||||||||||||
Prerequisite | Prerequisite to | ||||||||||||||||||||
Course Lecturer | Öğr. Gör. Birol GENÇYILMAZ | Office Hours Schedule | Thursday 15:00-17:00 | ||||||||||||||||||
birol@marmara.edu.tr | |||||||||||||||||||||
Phone | 216 348 02 92 / 253 | Office / Room No | 453 | ||||||||||||||||||
Teaching Assistant(s) | Phone | ||||||||||||||||||||
Office / Room No | |||||||||||||||||||||
Course Objectives |
The purpose of this course is to present the basic theory of propositions and mathematical logic, proof methods, finite-infinite sets, mathematical induction, relations, recurrence relations, graphs, counting techniques and probability to computer engineering students. | ||||||||||||||||||||
Textbooks and/or References |
1. | Discrete Mathematics 5th edition, Ross & Wright, Prentice Hall | |||||||||||||||||||
WEEK | Date | TOPICS | Reference No - Section | ||||||||||||||||||
Week 1 | Meeting, objectives of courses, etc. | ||||||||||||||||||||
Week 2 | Sets and Subsets, Set Operations, Laws of Algebra | 1-1,1-2,1-3,1-4 | |||||||||||||||||||
Week 3 | Functions and Sequences | 1-5,1-6 | |||||||||||||||||||
Week 4 | Elementary Logic, Propositional Calculus | 2-1,2-2 | |||||||||||||||||||
Week 5 | Methods of Proof, Logic in Proof | 2-3,2-4,2-5 | |||||||||||||||||||
Week 6 | Quantifiers, Predicate Calculus | 13-1,13-2 | |||||||||||||||||||
Week 7 | Relations, Graphs and Directed Graphs | 3-1,3-2 | |||||||||||||||||||
Week 8 | Matrices, Matrix Multiplication, Division Algorithm | 3-3,3-4,3-5 | |||||||||||||||||||
Week 9 | Loop Invariants, Mathematical Induction | 4-1,4-2,4-6 | |||||||||||||||||||
Week 10 | Recurrence Relations, Recursive Definitions | 4-4,4-5 | |||||||||||||||||||
Week 11 | Basic Counting Techniques, Elementary Probability | 5-1,5-2 | |||||||||||||||||||
Week 12 | Inclusion, Exclusion and Binomial Methods | 5-3. | |||||||||||||||||||
Week 13 | Counting and Partitions | 5-4. | |||||||||||||||||||
Week 14 | Boolean Algebra, Logic Networks,Karnaugh Maps | 10-1,10-2,10-3,10-4 | |||||||||||||||||||
Evaluation Tools |
Evaluation Tool | Quantity | Date |
Weight in Total (%) |
Weight in Semester Evaluation (%) |
||||||||||||||||
Final Exam | 1 | 40 | 0 | ||||||||||||||||||
Final Make-up Exam (if exists) | 1 | 40 | 0 | ||||||||||||||||||
Semester Evaluation | 60 | 100 | |||||||||||||||||||
Midterm(s) | 1 | 30 | 50,0 | ||||||||||||||||||
Quiz(zes) | 3 | 15 | 25,0 | ||||||||||||||||||
Project(s) | |||||||||||||||||||||
Homework(s) | 10 | 15 | 25,0 | ||||||||||||||||||
Laboratory | |||||||||||||||||||||
Other | |||||||||||||||||||||
*** Lifelong Learning Programme (LLP) *** | Language of Instruction: | English | |||||||||||||||||||
Evaluation Tool | Quantity | Student Workload Hours | Evaluation Tool | Quantity | Student Workload Hours | ||||||||||||||||
Theoretical Hours | -- | 42,0 | Applied Hours | -- | 0,0 | ||||||||||||||||
Midterm | 1 | 15,0 | Final | 1 | 15,0 | ||||||||||||||||
Quiz | 3 | 24,0 | Project | ||||||||||||||||||
Laboratory | Homework | 10 | 30,0 | ||||||||||||||||||
Atelier | Seminar | ||||||||||||||||||||
Field Study | Presentation | ||||||||||||||||||||
Other | Self Study | 49,0 | |||||||||||||||||||
TOTAL : | 15 | 175,0 | |||||||||||||||||||
Recommended ECTS Credit (Total Hours / 25) : | 7 |