1 / 8

Course overview

Learn foundational discrete math concepts crucial for developing algorithms and systems. Topics include sets, logic, relations, counting, graphs, and more. Textbooks recommended.

lcorrea
Download Presentation

Course overview

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Course overview • Course title: Discrete mathematics for Computer Science • Instructors: • Dr. AbdelouahidDerhab (abderhab@ksu.edu.sa) • Credit hours: 7/week

  2. Prerequisite • Engineering Probability & Statistics • Data structure

  3. Goals of the course • The course is an introductory course in discrete mathematic with emphasis on how this theory can be invoked to develop efficient algorithms and systems. Also, it serves as the mathematical perquisite for many advanced courses (design & analysis of algorithms).

  4. OUTCOMES • Students will be able to: • discuss and use set theoretic techniques, (operations, Venn diagrams, etc.). • solve problems in combinatorics (permutations, combinations, etc..). • perform various operations with relations and functions (congruence, methods of proof, induction, recursion, etc..). • explain and use the concepts of graphs and trees.

  5. Recommended textbooks • Scheinerman, Edward, Mathematics: A Discrete Introduction, 2006, Cengage. • Roman, Steven.  An Introduction to Discrete Mathematics, 2nd edition, Saunders, NY. • Rosen, Kenneth h.  Discrete Mathematics and Its Applications, 2 ed, McGraw/Hill • Dossey, John A. et al, Discrete Mathematics, 3rd edition, Addison-Wesley, Reading, MA.

  6. Course content • Foundations: Sets, Sequences, and Functions • Logic: propositional logic, equivalences, predicate logic; mathematical reasoning: rules of inference, methods of proving. • Relations • Induction and Recursion • Counting • Graphs and Trees • Recursion, Trees, and Algorithms • Boolean Algebra

  7. Grading • Home work: 30 points • 3Quizes: 30 points • Exam: 40 points

  8. Notes for email communication • Your email header must start with [CSC278] • Send your email to abderhab@KSU.edu.sa email address. • Please write your name and your ID at the end of the email

More Related