Design and Analysis of Algorithms
Weekly Hours: 6
ECTS Credits: 6
Course Homepage: http://www.cse.uoi.gr/~stavros/mypage-teaching-BSc-DAA.html
Description: Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: growth of functions; recurrence; sorting; median and other statistics; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; spanning trees; sorting networks; polynomial and matrix calculations; parallel algorithms; NP-completeness.