1. SECOND CYCLE - MASTER'S DEGREE
  2. THE GRADUATE SCHOOL OF SOCIAL SCIENCES
  3. MANAGEMENT INFORMATION SYSTEMS DEPARTMENT
  4. 2317 MANAGEMENT INFORMATION SYSTEMS (WİTHOUT THESİS) (EVENİNG CLASSES)
Course Information Course Learning Outcomes Course's Contribution To Program ECTS Workload Course Details
Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
YOBS 527ALGORITHM DESIGN AND ANALYSIS3 + 01st Semester6

COURSE DESCRIPTION
Course Level Master's Degree
Course Type Elective
Course Objective The aim of this course is to help students develop algorithmic intuition
Course Content divide and conquer, brute force, decreas and conquer, transform and conquer, dynamic programming, greedy programming, iteratie improvement ve NP completeness
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to Face

COURSE LEARNING OUTCOMES
1Explains basics of algorithm analysis
2Explains algorithm analysis techniques
3Explains dynamic programming
4Explains greedy algorithm technique

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10PO 11PO 12
LO 001            
LO 002            
LO 003            
LO 004            
Sub Total            
Contribution000000000000

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
ActivitiesQuantityDuration (Hour)Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)14342
Hours for off-the-classroom study (Pre-study, practice)14342
Assignments14141
Mid-terms11313
Final examination11818
Total Work Load

ECTS Credit of the Course





156

6
COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2021-2022 Fall1ÖMER GÜLEÇ


Print

Course Details
Course Code Course Title L+P Hour Course Code Language Of Instruction Course Semester
YOBS 527 ALGORITHM DESIGN AND ANALYSIS 3 + 0 1 Turkish 2021-2022 Fall
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Asts. Prof. Dr. ÖMER GÜLEÇ omer@pau.edu.tr İİBF B0207 %70
Goals The aim of this course is to help students develop algorithmic intuition
Content divide and conquer, brute force, decreas and conquer, transform and conquer, dynamic programming, greedy programming, iteratie improvement ve NP completeness
Topics
WeeksTopics
1 Introduction
2 Data Structures Overview
3 Algorithm Analysis Fundamentals
4 Algorithm Analysis Fundamentals
5 Brute Force
6 Brute Force
7 Decrease and Conquer
8 Decrease and Conquer
9 Divide and Conquer
10 Transform and Conquer
11 Dynamic Programming
12 Greedy Programming
13 Iterative Improvements
14 NP Completeness
Materials
Materials are not specified.
Resources
ResourcesResources Language
McMillan, M., Data Structures and Algorithms Using C#, Cambridge University Press, 2007English
Çölkesen, R., Veri Yapıları ve Algoritmalar, PapatyaBilim, 2019Türkçe
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam50Final Exam
Midterm Exam50Midterm Exam
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes