Algorithms Analysis and Design
Module ID
Υ404
Semester
4
Hours/Week - ECTS
4 – 5
Learning Outcomes
Designing and implementing effective problem-solving techniques is a challenge for human creativity. The course presents and analyzes basic algorithmic techniques and their requirements in computing resources.
Indicative Module Content
- Introduction to asymptotic assessments, worst, average and shared case performance
- Brute-Force Algorithms
- Recursive algorithms
- Divide and Conquer Algorithms
- Dynamic Programming
- Greedy algorithms
- Backtracking algorithms
- Binary search trees
- Graph algorithms (Dijkstra, DFS, BFS)
- Hashing table
- Classes: P, NP, NP complete, NP hard