Apr 20, 2024  
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 204 - Algorithms I: Sorting and Searching

Fall, Spring
Basic techniques for estimating the efficiency of algorithms. Searching algorithms: sequential, binary, Fibonacci, tree search, tries, hashing (study of several hash functions). Sorting algorithms: heapsort, mergesort, quicksort, binsort. Balanced trees: AVL trees, Hoffman’s algorithm. Equivalence relations and compressed balanced trees. Topological sorting. External sorting: merge sorting, multiway merge, B-trees (2-3 trees, 5-way trees).

Prerequisites & Notes
CSC 120.

Credits: 3 s.h.




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