MATH 111

This course includes the following topics:

1)     Elementary logic and Set theory: Simple and compound statements, Logical connectives, Truth tables, Basic logic laws, Operations on sets, Basic laws of set theory, Cartesian product of sets.

2)     Methods of proof: Proof Strategy, Direct Method, the Contrapositive Method, the Contradiction Method, Mathematical Induction, and Structural Induction.

3)     Relations: Basic definitions on relations, Binary relations and their types, Equivalence relation and set partition, Partial Ordering.

4)     Algorithms: Algorithms, Examples of Algorithms, Complexity of Algorithms, Recursive Definitions, Recursive Algorithms.

5)     Integers and Algorithms: Integers and Division, The Division Algorithm, Congruencies, Representation of Integers, Integers Algorithms, The Euclidean Algorithm, Applications.

6)     Principles of Counting: The Basics of Counting, The Pigeonhole Principle, Permutations and Combinations, Generalized Permutations and Combinations, Algorithms for generating Permutations and Combinations, Binomial Coefficients.

7)     Graph theory: Introduction to Graphs, Representation of Graphs, Paths and Cycles, Euler and Hamilton Paths, Shortest-Path Algorithms, Planar Graph, Graph Coloring.

أعلان هام

Welcome to the New Semester

الساعات المكتبية

Office Hours

PM1:20 -12:30  : Tuesday

Thursday: 12:30-2:00 PM

Academic Advising Hours

Thursday: 10:00 - 11:50 AM

Thursday : 9:00 -10:00 AM


Begin a day with an attitude of

T-This is an

O- Opportunity to

D- Do

A- A work, better than

Y- Yesterday

أرقام الاتصال

Contact Information

[email protected]

Extn: 5372

إحصائية الموقع

عدد الصفحات: 26

البحوث والمحاضرات: 8

الزيارات: 5506