Computer Science 250: Analysis of Algorithms will be offered in the spring semester with John Wenskovitch. Lectures will be held Monday, Wednesday, and Friday at 1:30 pm with a weekly lab session on Friday at 2:30 pm.
A treatment of selected topics from the analysis of algorithms including models of computation, design of efficient algorithms, computational complexity, and NP-completeness. Students develop expertise in mathematical analysis and algorithmic programming methodology. One laboratory per week. Prerequisites: CMPSC 112 and Math 205