| Course Type | Elective Course |
| Course Level | Bachelor's Degree |
| Year of Study | - |
| Semester | - |
| ECTS | 5 |
| Name of Lecturer(s) |
- |
| Learning Outcomes |
At the end of this course, the students;
- perform analyses according to the variable types
- learn basic statistical terminology
|
| Mode of Delivery | Face to face |
| Prerequisites | No |
| Recommended Optional Programme Components | There is no recommended optional programme component for this course. |
| Course Description | Fundamental Concepts, Subgraphs, Trees and Distance, Matchings and Factors, Connectivity and Paths, Euler Tours, Hamilton Cycles, Matchings, Edge and Vertex Colorings, Independent Sets, Planar Graphs, Directed Graphs, and Networks. |
| Course Contents |
| WEEK |
TOPICS |
|
1st Week |
Fundamental Concepts |
|
2nd Week |
Subgraphs |
|
3rd Week |
Trees |
|
4th Week |
Distance |
|
5th Week |
Matchings and Factors |
|
6th Week |
Connectivity and Paths |
|
7th Week |
Euler Tours |
|
8th Week |
MIDTERM I |
|
9th Week |
Lisp |
|
10th Week |
Lisp |
|
11th Week |
Tools for symbolic programming and an Introduction to Scheme |
|
12th Week |
Induction Recursion and Scope |
|
13th Week |
Syntactic Abstraction and Data Abstraction |
|
14th Week |
Reduction Rules and Imperative Programming |
|
| Recommended or Required Reading | Krishnamurthy, Introduction to Computer Graphics, McGraw-Hill, ISBN: 007120704X.
Rogers , David F;& Adams , J. A, Mathematical Elements for Computer Graphics, McGraw-Hill, ISBN: 0070535302. |
| Planned Learning Activities and Teaching Methods |
|
| Assessment Methods and Criteria |
|
Quantity |
Percentage (%) |
| Mid-term |
1 |
20 |
| Assignment |
5 |
5 |
| Quiz |
5 |
5 |
| Project |
1 |
20 |
| Total(%) |
|
50 |
| Contribution of In-term Studies to Overall Grade(%) |
|
50 |
| Contribution of Final Examination to Overall Grade(%) |
|
50 |
| Total(%) |
|
100 |
|
| Language of Instruction | Turkish |
| Work Placement(s) | No |