ECE 350 - Algorithms

3 credits
3 hours lecture
Prerequisites: ECE 161; MTH 114 or MTH 112; and MTH 350
Computer algorithm design concepts, computational complexity, NP-completeness, and the design and analysis for efficient algorithms. Topics include data structures, sorting, graph, shortest path, depth first search, breadth first search, and network flow networks, computational geometry, dynamic programming, linear programming, parallel and distributed, and other state-of-the-art algorithms. The course includes group projects and presentations requiring students to design experiments to determine algorithms’ complexity as well as to design algorithms for problem solving.