COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
CENG 204ALGORITHMS3 + 04th Semester7,5

COURSE DESCRIPTION
Course Level Bachelor's Degree
Course Type Compulsory
Course Objective The aim of this course is to help students develop algorithmic intuition which means knowing how various algorithms work, selecting the best algorithms for problems.
Course Content Design and analysis of algorithms, divide and conquer, brute force, decrease and conquer, transform and conquer, dynamic programming, greedy programming, iterative improvement and 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 015342 21122  
LO 025342 21122  
LO 035342 21122  
LO 045342 21122  
Sub Total2012168 84488  
Contribution534202112200

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)14570
Assignments5945
Mid-terms11818
Final examination12020
Total Work Load

ECTS Credit of the Course






195

7,5

COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2020-2021 Spring1TUFAN TURACI

Course Details
Course Code:  CENG 204 Course Title:  ALGORITHMS
L+P Hour : 3 + 0   Course Code : 1   Language Of Instruction: Turkish Course Semester :  2020-2021 Spring
Course Coordinator :  ASSOCIATE PROFESSOR TUFAN TURACI E-Mail:  tturaci@pau.edu.tr Phone Number : 
Course Location MUH A0250, MUH A0327,
Goals : The aim of this course is to help students develop algorithmic intuition which means knowing how various algorithms work, selecting the best algorithms for problems.
Content : Design and analysis of algorithms, divide and conquer, brute force, decrease and conquer, transform and conquer, dynamic programming, greedy programming, iterative improvement and NP completeness
Attendance : %60
Topics
WeeksTopics
1 Introduction to Algorithms
2 Datastructures Overview
3 Algorithm Analysis Fundamentals
4 Algorithm Analysis Fundamentals
5 Brute Force
6 Brute Force
7 Decrease and Conquer
8 Midterm exam
9 Divide and Conquer
10 Divide and Conquer
11 Transform and Conquer
12 Dynamic Programming
13 Gready Algorithms
14 Backtracking Algorithm
Materials
Materials are not specified.
Resources
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam60Final Exam
Midterm Exam40Midterm Exam
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes
© 2021 PAU