Discrete Math. 2

 

What is the main purpose for this course?

This course covers the mathematical topics that are mostly directed to computer science. Students may need them in courses like cryptography, compiler, and programming design. Topics include:

Introduction to number theory, concepts of abstract algebra, and formal languages.

  1. Number Theory: Divisibility and Euclidean algorithms. Modular arithmetic, Fermat's and Euler's theorems, Chinese remainder theorem.
  2. Concepts of Abstract Algebra: groups, rings, fields, Homomorphisms, Lagrange's theorem, Finite fields.
  3. Automata Theory: Finite state machine, Regular expressions, DFA, NDFA, and their equivalence, Grammars and Chomsky hierarchy.

Briefly describe any plans for developing and improving the course that are being implemented :

  1. Using group discussion
  2. Updating the materials of the course to cover the new topics of the field.
  3. Encourage students to learn the benefits of this course to be engaged in other applications.

 

 List of Topics

 

No. of

Weeks

Contact Hours

  1. Number Theory: Divisibility and Euclidean algorithms. Modular arithmetic, Fermat's and Euler's theorems, Chinese remainder theorem.

5

10

  1. Concepts of Abstract Algebra: groups, rings, fields, Homomorphisms, Lagrange's theorem, Finite fields.

5

10

  1. Automata Theory: Finite state machine, regular experssions, DFA, NDFA, and their equivalence, Grammars and Chomsky hierarchy.

5

10

 

Learning Resources

  1. List Required Textbooks :
    • Kenneth H. Rosen, “Discrete Mathematics and Its Applications”, Mcgraw-Hill College, 2011.
  2. List Essential References Materials :
    • Ronald L. Graham, Donald E. Knuth, and Oren Patashnik, Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley Professional, 1995.
  3.  List Recommended Textbooks and Reference Material  :

Download 

Contact Info.

Tel.: 016 404 4029
Ext. : 4029
Email: [email protected]

Room : S177

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

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

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

الزيارات: 9817