Nov 27, 2024  
2013-2014 Graduate Studies Bulletin 
    
Catalog Navigation
  Bulletin Home
  Course Descriptions
  Academic Calendars
  Academic Honesty
  Admission (Graduate)
  Archived Bulletins
  General Information and Policies
  Tuition, Financial Aid and Scholarships
  Distance Learning
  Programs (by Degree, University-wide)
  Programs (by School)
  Programs (Alphabetically, University-wide)
  Colleges and Departments
  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
  Accreditations
  Academic Deadlines
  Administrative Organization
  Board of Trustees, Senior Administration and Academic Deans
  Campus Map
  Endowed Chairs and Distinguished Professorships
  Consumer Information and Student Right to Know
  Facilities and Services
  Faculty Listing
  FERPA Information
  Hofstra at a Glance
  HEGIS Codes
  Hofstra portal
  Printable Forms
  Bulletin Help
  My Personal Catalog
HELP
2013-2014 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 204 - Algorithm Design and Analysis


Semester Hours: 3
Periodically
Review of algorithm basics (Big-Oh, Big-Theta and Big-Omega notation), algorithms for searching, sorting (Mergesort, Quicksort, Heap Sort), median order statistic, hashing, priority queues, red-black trees, AVL trees, dynamic programming, amortized analysis, graph algorithms for shortest path problems, minimum spanning tree, min-cut and max-flow problems and NP completeness.

Prerequisite(s)/Course Notes:
Course open to graduate students in computer science, others need permission from computer science graduate director. (Formerly Algorithms I: Sorting and Searching.)




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