Course Information
SemesterCourse Unit CodeCourse Unit TitleT+P+LCreditNumber of ECTS CreditsLast Updated Date
3MMT260Algorithm Logic3+0+03525.02.2026

 
Course Details
Language of Instruction Turkish
Level of Course Unit Bachelor's Degree
Department / Program Industrial Engineering
Type of Program Formal Education
Type of Course Unit Compulsory
Course Delivery Method Face To Face
Objectives of the Course The objective of this course unit is to analyze the structures of algorithms, the problems in their design and applications, the complexity of the algorithms and the problems in computation, as well as the types of algorithms and the runtime estimation methods. All these are necessary to design and apply for solving practical problems.
Course Content The concept of algorithm, Simplist sorting algorithms, Designing approachs: recursive and divide-and-conquer strategies; asymptotic notations, complexity analysis, running times defining, algorithm design techniques: greedy methods, min-cost spanning trees, backtracking algorithms, branch-and-bound methodology.
Course Methods and Techniques
Prerequisites and co-requisities None
Course Coordinator None
Name of Lecturers Asist Prof. Pegah Mutlu
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources Introductiontothe Design and Analysis of Algorithms , AnanyLevitin ,Pearson; 3 edition (October 9, 2011) ,ISBN-10: 0132316811, ISBN-13: 978-0132316811
Course Notes Lectures, Question-Answer, Project.
Assignments Bir grup projesi
Exams Vize ve Final Sınavları

Course Category
Mathematics and Basic Sciences %0
Engineering %10
Engineering Design %10
Social Sciences %0
Education %0
Science %0
Health %0
Field %80

Planned Learning Activities and Teaching Methods
Activities are given in detail in the section of "Assessment Methods and Criteria" and "Workload Calculation"

Assessment Methods and Criteria
In-Term Studies Quantity Percentage
Mid-terms 1 % 40
Final examination 1 % 60
Total
2
% 100

 
ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Course Duration 14 3 42
Hours for off-the-c.r.stud 14 1 14
Mid-terms 1 2 2
Practice 14 2 28
Laboratory 14 2 28
Project 1 10 10
Final examination 1 2 2
Total Work Load   Number of ECTS Credits 5 126

 
Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 students using basic engineering knowledge understand the concept of algorithm, algorithm representation methods, relationships between algorithms, data structures and programs.
2 Students use engineering knowledge and IT tools to, acquire the strategies for algorithm development, algorithms comparison and the skills for selection.
3 Apply algoritmic approaches for solving problems practically and develop awareness on how to determine effectiveness in algorithm application outcomes.
4 Evaluate algorithmic thoughts in problem solving.

 
Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 What is an Algorithm? Basic Concepts and Examples from Daily Life
2 Flowcharts and Algorithm Representation
3 Sequential Structures and Basic Input/Output Operations
4 Decision Structures (If-Else, Switch) and Conditional Checks
5 Repetitive Structures I – While Loop
6 Repetitive Structures II – For and Do-While Loops
7 Nesting of Loops & Introduction to Algorithm Complexity
8 Midterm Exam
9 Arrays and Their Use in Algorithms
10 Function (Subprogram) Structure and Modularity in Algorithms
11 Search Algorithms (Linear & Binary Search)
12 Sorting Algorithms (Bubble, Selection, Insertion Sort)
13 Complexity of Algorithms (Big-O Notation)
14 Final Exam

 
Contribution of Learning Outcomes to Programme Outcomes
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11
C1 5
C2 4 4
C3 4 4
C4 4 4

  bbb

  
  https://obs.gedik.edu.tr/oibs/bologna/progCourseDetails.aspx?curCourse=234064&curProgID=5582&lang=en