Computer Science 1700 - 001 - course 32216 - Spring 2015

Analysis of Algorithms

This course is FULL, with 28 students currently enrolled.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 02:30 pm to 03:45 pm in Mendel Hall G86.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.