60 likes | 73 Views
Dive into logic, proofs, discrete structures, combinatorics, number theory, and more in this course. Learn about sets, functions, recurrence relations, and generating functions. Prepare for exams by studying Kenneth H. Rosen's "Discrete Mathematics and Its Applications." Stay updated with important dates and engage with tutorials, homework, and quizzes for a comprehensive understanding.
E N D
CS 281: Discrete Mathematics for Computer Science • Instructors: • Ms.Nourah Al Angari(nmalangari@ksu.edu.sa) • Ms. HadeelAlNegheimish(halnegheimish@ksu.edu.sa) • Credit hours: • 3 Hours Lecture/week • 1 Hour Tutorial/week
CS 281: Course Description • 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. https://www.youtube.com/watch?v=Py_QYkMEeH4
Course Blog csc281.wordpress.com
CS 281: Grading Assessment Methods: Final Exam: 40% Midterm 1: 20% Midterm 2: 20% Tutorials: 6 % Homework: 8 % Quiz : 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 3rdweek of final exams
CS 281: Text Book Kenneth H. Rosen, Discrete Mathematics and Its Applications, 7th Edition