Mar 22, 2026  
2004-2005 Graduate Bulletin 
    
Catalog Navigation
  Bulletin Home
  ***Courses Offered***
  Academic Calendars
  Board of Trustees
  Hofstra at a Glance
  Graduate Admission
  General Information
  Tuition and Fees
  Financial Aid
  Colleges & Departments
  Graduate Programs Offered
  New College
  Law School
  Services
  Facilities
  Recreation & Leisure
  Clinics
  Cultural Resources
  Alumni Relations
  Faculty Listing
  Chairs & Professorships
  Administrative Staff
  Hegis Codes
  Campus Map
  FERPA
  My Personal Catalog
HELP
2004-2005 Graduate Bulletin [ARCHIVED BULLETIN]

Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Personal Catalog (opens a new window)

CSC 206 - Analysis of Algorithms and Complexity Theory

Periodically
Asymptotics, recurrence relations, lower bound theory including comparison trees for sorting and searching. Oracles. Lower bounds on parallel computation. Combinatorial optimization. Branch and bound: Knapsack problem, FFT and applications. Integer and polynomial arithmetic. Analysis of divide and conquer algorithms, dynamic programming, greedy algorithms, backtracking. Nondeterministic algorithms. The classes P and NP. NP completeness. Complexity hierarchy.

Prerequisites & Notes
CSC 161.

Credits: 3 s.h.


View Course Offering(s):

Summer Session I 2026

Summer Session II 2026

Summer Session III 2026

Fall 2026



Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Personal Catalog (opens a new window)