CS 281 Discrete Mathematics for Computer Science Instructors

CS 281: Discrete Mathematics for Computer Science Instructors: Ms. Nourah Al Angari(nmalangari@ksu. edu. sa) Ms. Hadeel Al. Negheimish(halnegheimish@ksu. edu. sa) Credit hours: 3 Hours Lecture/week 1 Hour Tutorial/week

CS 281: Course Description https: //www. youtube. com/watch? v=Py_QYk. MEe. H 4 �Logic and methods of proofs. �Basic Discrete Structures: Sets, Functions, Recursive definitions, Sequences and Summations. �Growth of functions. �Integers and Division, Rings & Fields, Applications of Number Theory. �Combinatorics: Counting techniques, Permutations and Combinations, Binomial Coefficients, Permutation and Combinations with repetition, �Recurrence Relations, Generating Functions.

Course Blog csc 281. wordpress. com

CS 281: Grading Assessment Methods: Final Exam: Midterm 1: Midterm 2: Tutorials: Homework: Quiz : 40% 20% 6% 8% 6% Important Dates Last Date to Drop Course: 16/3/1438 Midterm 1: Tuesday | 8/2/1438 Midterm 2: Tuesday | 14/3/1438 Final Exam: Tuesday 3 rd week of final exams

CS 281: Text Book Kenneth H. Rosen, Discrete Mathematics and Its Applications, 7 th Edition

CS 281: Lecture Plan Week #01 Lecture 1 #02 (Chap-1) 1. 1: #03 (Chap-1) Lecture 2 Orientation & Introduction Lecture 2 Tutorial 1. 3: 1. 4: Tutorial-1 1. 5: 1. 6: 1. 7 -8: Tutorial-2 #04 (Chap-2) 2. 1: 2. 2: 2. 3: Tutorial-3 #05 (Chap-2) 2. 4: 2. 5: 2. 6: Tutorial-4 #06 (Chap-3) 3. 2: 3. 3: Tutorial-5 #07 (Chap-3) 3. 3: 4. 1: Tutorial-6 #08 (Chap-4) 4. 2: 4. 3: Tutorial-7 #09 (Chap-4) 4. 3: 4. 4: 4. 5: Tutorial-8 #10 (Chap-5) 5. 1: 5. 2: 5. 3: Tutorial-9 #11 (Chap-5) 5. 3: 5. 4: Tutorial-10 #12 (Chap-6) 6. 1: 6. 2: Tutorial-11 #13 (Chap-6) 6. 3: 6. 4: Tutorial-12 #14 (Chap-6) 6. 4: 6. 5: Tutorial-13 #15 #16 () #17 () #18 () Preparatory Courses Final Exams Homerwork Remarks