>
Course Unit Title | Course Unit Code | Type of Course Unit | Level of Course Unit | Year of Study | Semester | ECTS Credits |
---|---|---|---|---|---|---|
Discrete Mathematics (de) | BUE123 | Elective | Associate degree | 1 | Fall | 2 |
Lecturer NEVIN ANTAR
1) State and apply some techniques of discrete math.
2) State the logic of algorithms
3) Use modelling by recurrance relations to solve some problems
4) State complexity notion on algorithmns
5) Solve some type of recurrance relations
6) State how some finite machines work
Bölümün/programın program yeterlilikleri sistemde olmadığından ilişkilendirme işlemi yapılamamıştır.
e-course
None
None
This lesson covers;propositions, proof techniques. algorithms, complexity notion in algorithms, asymptotic notations (Big Oh, Little Oh, Omega, Theta), counting, Pigeonhole Principle, modeling and solution techniques for recursive relations, divide and conquer, graphs, trees and related algorithms and state machines.
1) Lecture
2) Group Study
3) Self Study
4) Problem Solving
Contribution of Midterm Examination to Course Grade |
20% |
---|---|
Contribution of Final Examination to Course Grade |
80% |
Total |
100% |
Turkish
Not Required