INTRODUCTION TO COMPUTER / DISCRETE MATHEMATICS

Course description

The course will focus on methods of solving homogeneous and non-homogeneous recurrence relations using generating functions and characteristic equations: digraphs to analyze computer algorithms: graph theory and its ramifications to computer algorithms.

The course cover functions, relations, set theory, and graph theory and their applications in computer science: switching circuits, Boolean algebra, and Karnaugh maps.

Course Code: 
ICTE 233    
Credit Hours: 
3