Future University is one of most promising private universities in Egypt. Through excellence in teaching, research and service, Future University strives to provide a comprehensive, high-quality education that prepares our graduates to be future leaders.
90th Street
New Cairo
Egypt
Faculty of Computers & Information Technology
Apply Now

# Course List

## Discrete Mathematics

• Course Code :
MTH 111
• Level :
• Course Hours :
3.00 Hours
• Department :
Faculty of Computers & Information Technology

## Area of Study :

The course introduces the concept of Sets; sequences, algorithms, induction and recursion; relations and functions; Graphs, lattices, number systems and codes, Boolean algebra; Formal logic; trees and languages; semi groups

## Discrete Mathematics

Sets; sequences, algorithms and preudocode, induction and recursion; relations and functions; Graphs, lattices, number systems and codes, boolean algebra; Formal logic; trees and languages; semi groups.

## a. Knowledge and Understanding:

 1- Distinguish between sets and binary relations 2- Use binary relations and functions to visit some applications such as database systems and cryptography systems 3- Understand the logic and propositional calculus 4- Apply the graph theory concepts 5- Identify and use planner graphs and shortest path problems

## b. Intellectual Skills:

 1- Use and construct trees and tree terminology 2- Use and construct binary search trees 3- Use the logic and propositional calculus to solve some problems in the inference and reasoning such as the expert systems 4- Use and construct graphs and graph terminology

## c. Professional and Practical Skills:

 1- Students should be able to analytically solve many problems 2- Students should be able to visit some applications in discrete mathematics 3- Students should be able to use a certain mathematics’ tool

## d. General and Transferable Skills:

 1- Students use visual aids to search for information and engage in life – long self learning discipline 2- Students use visual aids to show representation on any part of course 3- Students prepare report on assignment 4- Students become aware for keywords and abbreviations used for computer science

## Course topics and contents:

Topic No. of hours Lecture Tutorial/Practical
Sets 3 2 2
Binary Trees 3 2 2
Properties of the Integers 3 2 2
2nd Midterm 2 1 2
Boolean Algebra 3 2 2
Relations 3 2 2
Functions 3 2 2
Logic and Propositional Calculus 3 2 2
Techniques of Counting 3 2 2
1st Midterm 2 1 2
Advanced Counting Techniques and Recursion 3 2 2
Graph Theory 3 2 2
Directed Graphs 3 2 2

## Teaching And Learning Methodologies:

Teaching and learning methods
Lectures
Presentation
Exercises
Open Discussion
Case Study

## Course Assessment :

Methods of assessment Relative weight % Week No. Assess What

## Books:

Book Author Publisher
Discrete Mathematics and its Applications Kenneth H.Rosen McGraw Hill