The course description states that the topics of the course will cover the following: Introduction to Discrete Mathematics: The algorithmic language. Logic: Logical issues, logic of automata, proofs, mathematical induction. Groups: Special groups, operations, properties and correspondences, application of logic to systems based on knowledge. Relations: Graphical and matrix representations, equivalence and ordering relations, application to databases. Functions: Types, cardinality (numeric), application to functional languages. Non-directed graphs: simple graphs, Oiler paths, Hamilton circuits, trees, application to syntax diagrams. Directed graphs: directed graphs, consistent labeling, path problems, and application to routing in computer networks.
Credit hours: 3
Prerequisites: MATH116
Objectives of the course :
• Applying the logic of judgment to describe and analyze problems.
• Proofing expressions using different mathematical strategies.
• Handling and performing groups and functions.
• Discrimination between relationships based on their characteristics.
• Solves a variety of basic recursive relationships.
• Use diagrams to model real-life problems.
Course outputs :
1.1: Understanding discrete mathematics and its applications in computer science.
1.2: Identifying the basic concepts of mathematical logic.
2.1: Applying groups and logic in expert systems.
2.2: Applying relations and functions in relational databases.
2.3: Use of undirected diagrams in languages and grammatical analysis.
2.4: Application of directed graphs in routing algorithms for communication networks.
This website uses special cookies to ensure ease of use, improve your browsing experience, and clarify the terms and policies related to About user privacy. By continuing to browse this website, you acknowledge that you accept the use of cookies and the terms of the Privacy Policy