>
Course Unit Title Course Unit Code Type of Course Unit Level of Course Unit Year of Study Semester ECTS Credits
Algorithms BPP115 Compulsory Associate degree 1 Fall 6

Name of Lecturer(s)

Lecturer NEVIN ANTAR
Lecturer Burak ÇAKIR

Learning Outcomes of the Course Unit

1) Use algorithm logic for solve to a problem.
2) Explain the variable types.
3) Refer variable concept.
4) Explain the structure of the basic algorithm.
5) Create a flow diagram.
6) Explain a connection between the algorithm and flow charts.
7) Design algorithm for a problem.
8) Optimize to the system that desired computer logic.

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 High No relation Low No relation No relation No relation No relation No relation No relation Low No relation No relation
2 No relation No relation No relation High No relation Middle No relation No relation No relation No relation No relation No relation Low No relation No relation
3 No relation No relation No relation High No relation Middle No relation No relation No relation No relation No relation No relation Low No relation No relation
4 No relation No relation No relation High No relation Middle No relation No relation No relation No relation No relation No relation No relation No relation No relation
5 No relation No relation No relation High No relation Middle No relation No relation No relation No relation No relation No relation No relation No relation No relation
6 No relation No relation No relation High No relation Middle No relation No relation No relation No relation No relation No relation No relation No relation No relation
7 No relation No relation No relation High No relation Middle No relation No relation No relation No relation No relation No relation No relation No relation No relation
8 No relation No relation No relation Low No relation Middle No relation No relation No relation No relation No relation No relation No relation No relation No relation

Mode of Delivery

Face to Face

Prerequisites and Co-Requisites

None

Recommended Optional Programme Components

No

Course Contents

In this lecture students are provided with knowledge on algorithm logic which is the foundation of programming and knowledge on the use of algorithm logic to solve a problem finding the shortest path.

Weekly Schedule

1) The process and the contents of the course, and the way to follow
2) Problem-solving principles and stages
3) The creation of algorithms and flow charts
4) The creation of algorithms and flow charts
5) The creation of algorithms and flow charts
6) The creation of algorithms and flow charts
7) The use of programming environment and code writing rules
8) Midterm examination/Assessment
9) Variables
10) Arrays
11) Subprograms
12) Subroutines, Functions, Procedures.
13) Subroutines
14) Subroutines
15) Preparing for the xam
16) Final examination

Recommended or Required Reading

1- Algoritmalar ve Programlamaya Giriş , Soner ÇELİKKOL , Seçkin Yayıncılık , 2004.
2- Algoritmalar Teoriden Uygulamalara , Vasif V. NABİYEV , Seçkin Yayıncılık , 2011.
3- Bilgisayarda Temel Algoritmalar ve C++ Dili ile Programlama Örnekleri , Prof. Dr. Mithat Uysa, Nirvana Yayınları , 2010.

Planned Learning Activities and Teaching Methods

1) Lecture
2) Question-Answer
3) Discussion
4) Drill and Practice
5) Demonstration
6) Group Study
7) Case Study
8) Lab / Workshop
9) Self Study
10) Problem Solving
11) Project Based Learning


Assessment Methods and Criteria

Contribution of Midterm Examination to Course Grade

30%

Contribution of Final Examination to Course Grade

70%

Total

100%

Language of Instruction

Turkish

Work Placement(s)

Not Required