|
Language of Instruction
|
English
|
|
Level of Course Unit
|
Bachelor's Degree
|
|
Department / Program
|
Electrical - Electronic Engineering
|
|
Type of Program
|
Formal Education
|
|
Type of Course Unit
|
Compulsory
|
|
Course Delivery Method
|
Face To Face
|
|
Objectives of the Course
|
On successful completion of this course unit, students/learners will or will be able to:
1. This course has provided the ability to understand elementary facts about sets, functions, relations, graphs, trees, boolean algebra, machines and languages.
2. This course has provided the ability to understand and conduct relation properties, representing relations and partial ordering.
3. This course has provided the ability to find the number of solutions to arrangement problems which are isomorphism and connectivity.
4. This course has provided the ability to apply knowledge on trees and traversal analysis of algorithm.
5. This course has provided the ability to use boolean algebra problems.
6. This course has provided the ability to analyze machine and languages connect algorithmic and algebraic aspects of machine and languages.
|
|
Course Content
|
Sets, relations and functions, application to data structure and graph representations, partial ordered sets, trees, algebraic structures, lattices and Boolean algebra, semi groups, groups, introduction to grammars and machines and languages, error correcting codes.
|
|
Course Methods and Techniques
|
|
|
Prerequisites and co-requisities
|
None
|
|
Course Coordinator
|
None
|
|
Name of Lecturers
|
None
|
|
Assistants
|
None
|
|
Work Placement(s)
|
No
|
Recommended or Required Reading
|
Resources
|
|
|
Course Notes
|
Discrete Mathematics and Its Applications, Kenneth Rosen Seventh Edition, 2012, McGrawHill.
Discrete and Combinatorial Mathematics 5th ed - R. Grimaldi.
|
Course Category
|
Mathematics and Basic Sciences
|
%80
|
|
|
Engineering
|
%20
|
|
|