Discrete Mathematics
Computer Programming
Vocational School of Kocaeli
Short Cycle (Associate's Degree)
| Course Unit Title | Course Unit Code | Type of Course Unit | Level of Course Unit | Year of Study | Semester | ECTS Credits |
|---|---|---|---|---|---|---|
| Discrete Mathematics | BPP123 | Elective | Associate degree | 1 | Fall | 2 |
Name of Lecturer(s)
Lecturer NEVIN ANTAR
Learning Outcomes of the Course Unit
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
Program Competencies-Learning Outcomes Relation
| Program Competencies | ||||||||||||||||
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | ||
| Learning Outcomes | ||||||||||||||||
| 1 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | High | No relation | No relation | |
| 2 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | High | No relation | No relation | |
| 3 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | High | No relation | No relation | |
| 4 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | High | No relation | No relation | |
| 5 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | High | No relation | No relation | |
| 6 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | High | No relation | No relation | |
Mode of Delivery
Face to Face
Prerequisites and Co-Requisites
None
Recommended Optional Programme Components
-
Course Contents
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.
Weekly Schedule
1) Propositions, logical statements.2) Set theory
3) Functions
4) Algebric Sturucture
5) Groups ve semi Groups
6) Combinarotic Theory
7) Boole Algebra
8) Graph Theory
9) Applications
10) Applications
11) Applications
12) Applications
13) Applications
14) Applications
15) exam
16) exam
Recommended or Required Reading
Planned Learning Activities and Teaching Methods
1) Lecture
2) Group Study
3) Self Study
4) Problem Solving
Assessment Methods and Criteria
Contribution of Midterm Examination to Course Grade |
40% |
|---|---|
Contribution of Final Examination to Course Grade |
60% |
Total |
100% |
Language of Instruction
Turkish
Work Placement(s)
Not Required