Nov 28, 2024  
2014-2015 Graduate Studies Bulletin 
    
Catalog Navigation
  Bulletin Home
  Course Descriptions
  Our Mission
  About Our University
  Academic Honesty
  Academic Policies and Procedures
  Admission (Graduate)
  Archived Bulletins
  Tuition, Financial Aid and Scholarships
  Programs (Alphabetically, University-wide)
  Programs (by Degree, University-wide)
  Programs (by School)
  Distance Learning
  Hofstra College of Liberal Arts and Sciences
  Frank G. Zarb School of Business
  The Lawrence Herbert School of Communication
  School of Education
  School of Engineering and Applied Science
  School of Health Sciences and Human Services
  Academic Calendars and Deadlines
  Facilities and Services
  General Information and Definitions
  HEGIS Codes
  Printable Forms
  @HofBulletins on Twitter
  My Personal Catalog
HELP
2014-2015 Graduate Studies 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


Semester Hours: 3

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.

Prerequisite(s)/Course Notes:
CSC 204 . Course open to graduate students in computer science, others need permission from computer science graduate director.




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