Pamukkale University
University is the guide to life
Welcome to PAU;
Prospective Student
Our Students
Our Staff
TR
Information Package & Course Catalogue
Home Page
About University
Name And Address
Acedemic Authorities
General Discription
Academic Calendar
General Admission Requirements
Recognition of Prior Learning
General Registration Procedures
ECTS Credit Allocation
Academic Guidance
Information For Students
Cost Of Living
Accommodation
Meals
Medical Facilities
Facilities for Special Needs Students
Insurance
Financial Support for Students
Student Affairs
Learning Facilities
International Programs
Language Courses
Internships
Sports Facilities and Leisure Activities
Student Associations
Practical Information for Mobile Students
Degree Programmes
FIRST CYCLE - BACHELOR'S DEGREE
FACULTY OF ENGINEERING
COMPUTER ENGINEERING DEPARTMENT
253 Computer Engineering
Course Information
Course Learning Outcomes
Course's Contribution To Program
ECTS Workload
Course Details
Print
COURSE INFORMATION
Course Code
Course Title
L+P Hour
Semester
ECTS
CENG 204
ALGORITHMS
3 + 0
4th Semester
7,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
1
Explains basics of algorithm analysis
2
Explains algorithm analysis techniques
3
Explains dynamic programming
4
Explains greedy algorithm technique
COURSE'S CONTRIBUTION TO PROGRAM
PO 01
PO 02
PO 03
PO 04
PO 05
PO 06
PO 07
PO 08
PO 09
PO 10
PO 11
PO 12
LO 001
5
3
4
2
2
1
1
2
2
LO 002
5
3
4
2
2
1
1
2
2
LO 003
5
3
4
2
2
1
1
2
2
LO 004
5
3
4
2
2
1
1
2
2
Sub Total
20
12
16
8
8
4
4
8
8
Contribution
5
3
4
2
0
2
1
1
2
2
0
0
ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
Activities
Quantity
Duration (Hour)
Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)
14
3
42
Hours for off-the-classroom study (Pre-study, practice)
14
5
70
Assignments
5
9
45
Mid-terms
1
18
18
Final examination
1
20
20
Total Work Load
ECTS Credit of the Course
195
7,5
COURSE DETAILS
Select Year
All Years
2023-2024 Spring
2022-2023 Spring
2021-2022 Spring
2020-2021 Spring
2019-2020 Spring
2018-2019 Spring
2017-2018 Spring
2016-2017 Spring
2015-2016 Spring
2014-2015 Spring
2013-2014 Spring
2012-2013 Spring
2011-2012 Spring
2010-2011 Spring
2009-2010 Spring
2008-2009 Spring
Course Term
No
Instructors
Details
2023-2024 Spring
1
ELİF HAYTAOĞLU
Details
2023-2024 Spring
2
ELİF HAYTAOĞLU
Details
2022-2023 Spring
1
ELİF HAYTAOĞLU
Details
2021-2022 Spring
1
ŞEVKET UMUT ÇAKIR
Details
2021-2022 Spring
2
ŞEVKET UMUT ÇAKIR
Details
2020-2021 Spring
1
TUFAN TURACI
Details
2019-2020 Spring
1
ELİF HAYTAOĞLU
Details
2018-2019 Spring
1
ELİF HAYTAOĞLU
Details
2017-2018 Spring
1
ELİF HAYTAOĞLU
Details
2016-2017 Spring
1
ŞEVKET UMUT ÇAKIR
Details
2015-2016 Spring
1
ŞEVKET UMUT ÇAKIR
Details
2014-2015 Spring
1
ŞEVKET UMUT ÇAKIR
Details
2014-2015 Spring
2
ŞEVKET UMUT ÇAKIR
Details
2013-2014 Spring
1
ŞEVKET UMUT ÇAKIR
Details
2013-2014 Spring
2
ŞEVKET UMUT ÇAKIR
Details
2012-2013 Spring
1
GÜRHAN GÜNDÜZ
Details
2012-2013 Spring
2
GÜRHAN GÜNDÜZ
Details
2011-2012 Spring
1
GÜRHAN GÜNDÜZ
Details
2011-2012 Spring
2
GÜRHAN GÜNDÜZ
Details
2010-2011 Spring
1
GÜRHAN GÜNDÜZ
Details
2009-2010 Spring
1
GÜRHAN GÜNDÜZ
Print
Course Details
Course Code
Course Title
L+P Hour
Course Code
Language Of Instruction
Course Semester
CENG 204
ALGORITHMS
3 + 0
1
Turkish
2023-2024 Spring
Course Coordinator
E-Mail
Phone Number
Course Location
Attendance
Asts. Prof. Dr. ELİF HAYTAOĞLU
eacar@pau.edu.tr
SABF C0206
%60
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
Topics
Weeks
Topics
1
Introlduction
2
Datastructures Overview
3
Algorithm Analysis Fundamentals
4
Algorithm Analysis Fundamentals
5
Brute Force
6
Brute Force
7
Decrease Conquer
8
Decrease Conquer
9
Divide Conquer
10
Transform Conquer
11
Midterm
12
Dynamic Programming
13
Branch Bound
14
Backtracking
Materials
Materials are not specified.
Resources
Course Assessment
Assesment Methods
Percentage (%)
Assesment Methods Title
Final Exam
55
Final Exam
Midterm Exam
45
Midterm Exam
L+P:
Lecture and Practice
PQ:
Program Learning Outcomes
LO:
Course Learning Outcomes
{1}
##LOC[OK]##
{1}
##LOC[OK]##
##LOC[Cancel]##
{1}
##LOC[OK]##
##LOC[Cancel]##
Home Page
About University
Name And Address
Acedemic Authorities
General Discription
Academic Calendar
General Admission Requirements
Recognition of Prior Learning
General Registration Procedures
ECTS Credit Allocation
Academic Guidance
Information For Students
Cost Of Living
Accommodation
Meals
Medical Facilities
Facilities for Special Needs Students
Insurance
Financial Support for Students
Student Affairs
Learning Facilities
International Programs
Language Courses
Internships
Sports Facilities and Leisure Activities
Student Associations
Practical Information for Mobile Students
Degree Programmes