Computer Science 1700 - 002 - course 34179 - Spring 2015

Analysis of Algorithms

There are currently 13 students enrolled in this course. The maximum enrollment is 28 possible students.This course is offered by the Computing Sciences departmentin the College of Sciences . It is classified as a Lecture, and is worth 3. It meets on Tuesdays, Thursdays, from 10:00 am to 11:15 am in Mendel Hall G88.The course is instructed by Levitin, Anany.

Course description:

Efficiency classifications and mathematical analysis ofrecursive and nonrecursive algorithms; design techniques:brute force, greedy, divide-and-conquer, dynamicprogramming, backtracking, branch-and-bound, space andtime tradeoffs; NP-completeness; approximation algorithms;computational problems: sorting, searching, stringprocessing, graphs, arithmetic, linear algebra.