MAT 148 - Discrete Mathematics

Course Objectives

To give basic concepts of Discrete Mathematics.

Course Description

Combinations, permutations, binomial theorem and applications, counting techniques. Algorithms and analysis, iteration algorithms. Representation of integers in computer, Euclid algorithm, RSA encryption algorithm. Recursion relations, analysis, application to algorithm analysis. Introduction to graph theory. Boolean algebra, combinatorial circuits. Finite state machines, finite state machines and Turing machines