Course Name Course Code

Discrete Structures 222CPE

Prerequisite Credit Theory Practice

Course Description
The course introduces History and overview, Relevant tools, standards, and/or engineering
constraints, Functions, relations, and sets, Boolean algebra principles, First-order logic, Proof
techniques, Basics of counting, Graphs and trees, Iteration and recursion

Course Topics Duration

History and overview 1
Relevant tools, standards, and/or engineering constraints 1
Sets, Relations and Functions 3
Boolean algebra principles 2
First-order logic 1
Proof techniques 1
Basics of counting 2
Graphs and trees 2
Iteration and recursion 2

Course Learning Outcomes

By the end of successfully completing this course, students are expected to:
 Define the concepts of Sets, relations, functions, Boolean algebra, Iteration and recursion.
 State the concepts of discrete structures, standards, tools and constraints.
 Calculate permutations, combinations, mathematical logic and Tautology .
 Compare various propositions, compound propositions and proof techniques.
 Analyze the various traversing methods of graphs and binary tree.
 Demonstrate an ability to work in team for solving discrete structures problems.
 Communicate in written about Tautology, contradictions and its implications.

Textbook
 Kenneth H. Rosen, Discrete Mathematics and its applications, McGraw Hill.7ed,2012
References
 Discrete Mathematical Structure with Graph Theory (Edgar G. Goodaire& Michael M.
Parmenter) PEARSON Prentice Hall, New Jersey. ISBN-0-13-167995-3
Coordinator
Dr. Ahmed Said Badawy

CE Course Syllabi - 2018 1