Search Results
ECE 366 Design and Analysis of Algorithms
This course covers the fundamentals in algorithm design and analysis, focusing on the themes of efficient algorithms and intractable problems. Topics include divide and conquer algorithms, graph algorithms, greedy algorithms, dynamic programming, NP-completeness and reductions. The course goal is to provide a solid foundation in algorithms for students in preparation for a job in industry and more advanced courses. Undergraduate students cannot receive credit for both 颁厂颁听366 and 颁厂颁听505.
Typically offered in Fall only