Welcome, Guest . Login . Türkçe
Where Am I: Ninova / Courses / Faculty of Science and Letters / MUH 211 / Course Informations
 

Course Information

Course Name
Turkish Ayrık Matematik & Sist Analizi
English Discrete Mathematics
Course Code
MUH 211 Credit Lecture
(hour/week)
Recitation
(hour/week)
Laboratory
(hour/week)
Semester 3
3 3 - -
Course Language Turkish
Course Coordinator Burak Yıldıran Stodolsky
Course Objectives To give the knowledge and the culture that are usefull for many problems of the mathematics and
science that can be solved only by reasoning. Help to gain the ability to use the models and the
similarities that lead to the solutions, find solitions , form algorithms and evaluate their performance
by using graphs and trees.
Course Description Combinations, permutations, binomial theorem and applications, counting. Algorithms and their analysis, recursive algorithms. Representations of integers, Euclid algorithm, RSA cryptosystem. Recurrence relations, their solutions, application to analysis of algorithms. A basic introduction to graph theory. Boolean algebra, combinatorial circuits, finite state machines, finite state automata and Turing Machine
Course Outcomes
Pre-requisite(s)
Required Facilities
Other
Textbook
Other References
 
 
Courses . Help . About
Ninova is an ITU Office of Information Technologies Product. © 2024