PAÜ .:. Eğitim Öğretim Bilgi Sistemi

COURSE INFORMATION

Course Code	Course Title	L+P Hour	Semester	ECTS
CENG 504	ALGORITHM DESIGN AND ANALYSIS	3 + 0	2nd Semester	7,5

COURSE DESCRIPTION

Course Level	Master'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 and selecting the best algorithms for problems.
Course Content	Design and analysis of algorithms, divide and conquer, searching and sorting, heaps and other data structures, graphs and search techniques, 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	Develops efficient and fast algorithms
3	Analyses algorithms in terms of memory and time.
4	Provides multiple solutions to one problem.

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	8	40
Mid-terms	1	15	15
Final examination	1	28	28
Total Work Load ECTS Credit of the Course			195 7,5

COURSE DETAILS

Select Year

Course Details

Course Code	Course Title	L+P Hour	Course Code	Language Of Instruction	Course Semester
CENG 504	ALGORITHM DESIGN AND ANALYSIS	3 + 0	1	Turkish	2023-2024 Spring

Course Coordinator	E-Mail	Phone Number	Course Location	Attendance
Asts. Prof. Dr. FATMANA ŞENTÜRK	fatmanas@pau.edu.tr		MUH A0257 TEK A0106	%

Goals		The aim of this course is to help students develop algorithmic intuition which means knowing how various algorithms work and selecting the best algorithms for problems.
Content		Design and analysis of algorithms, divide and conquer, searching and sorting, heaps and other data structures, graphs and search techniques, NP completeness.

Topics

Weeks	Topics
1	Basics of Algortihm analysis
2	Basics of Algortihm analysis
3	Brute force
4	Brute force
5	Divide and conquer
6	Divide and conquer
7	Decrease and conquer
8	Decrease and conquer
9	Transform and conquer
10	Dynamic programming
11	Dynamic programming
12	Greedy programming
13	Greedy programming
14	Iterative improvement

Materials

Materials are not specified.

Resources

Resources	Resources Language
The design and analysis of algorithms, Anany Levitin	English

Course Assessment

Assesment Methods	Percentage (%)	Assesment Methods Title
Final Exam	50	Final Exam
Midterm Exam	50	Midterm Exam

L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes

Prospective Student