1. THIRD CYCLE - DOCTORATE DEGREE
  2. THE GRADUATE SCHOOL OF SOCIAL SCIENCES
  3. MANAGEMENT INFORMATION SYSTEMS DEPARTMENT
  4. 2619 MANAGEMENT INFORMATION SYSTEMS PHD
Course Information Course Learning Outcomes Course's Contribution To Program ECTS Workload Course Details
Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
YOBS 621ALGORITHM DESIGN AND ANALYSIS3 + 01st Semester7,5

COURSE DESCRIPTION
Course Level Doctorate Degree
Course Type Elective
Course Objective The aim of this course is to help students develop algorithmic intuition which means knowing like how various methods like divide and conquer, brute force, decreas and conquer, transform and conquer, dynamic programming, greedy programming, iteratie improvement ve NP completeness work, selecting the best algorithms for problems.
Course Content Divide and Conquer, Brute force, Decreas and Conquer, Transform and Conquer, Dynamic Programming, Greedy Programming, Iterative 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
Assignments12020
Mid-terms12929
Final examination13232
Presentation / Seminar Preparation13030
Total Work Load

ECTS Credit of the Course





195

7,5
COURSE DETAILS
 Select Year   


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


Print

Course Details
Course Code Course Title L+P Hour Course Code Language Of Instruction Course Semester
YOBS 621 ALGORITHM DESIGN AND ANALYSIS 3 + 0 1 Turkish 2022-2023 Fall
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Asts. Prof. Dr. ÖMER GÜLEÇ omer@pau.edu.tr İİBF B0207 %
Goals The aim of this course is to help students develop algorithmic intuition which means knowing like how various methods like divide and conquer, brute force, decreas and conquer, transform and conquer, dynamic programming, greedy programming, iteratie improvement ve NP completeness work, selecting the best algorithms for problems.
Content Divide and Conquer, Brute force, Decreas and Conquer, Transform and Conquer, Dynamic Programming, Greedy Programming, Iterative Improvement ve NP Completeness
Topics
Materials
Materials are not specified.
Resources
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