Algorithms (CMPE323) Course Details

Course Name: Algorithms
Code: CMPE323
Pre-requisite Course(s): CMPE226
Objective: This course is designed to teach students how to analyse and design algorithms and measure their complexities. In addition, students will be able to develop efficient algorithms for the solution of real life computational problems.
Content: Design and analysis of algorithms, O-notation, divide and conquer algorithms, dynamic programming, backtracking and branch and bound, lower bound theory, complexity of sorting and searching algorithms, graph algorithms, NP-hard and NP-complete problems, basic NPC problems, proving problems to be NPC, analysis of some string processing algorithms.
Term: Autumn
Theory: 3
Application: 0
Laboratory: 0
Credit: 3
ECTS Course File: Course File
Course File: