Nov 25, 2024  
2008 Summer Sessions Bulletin 
    
Catalog Navigation
  Bulletin Home
  ** Course Offerings **
  Academic Calendar
  Distance Learning Courses
  Three-Week SSI 2008 Courses
  Courses of Special Interest
  Admission
  Registration
  Tuition and Fees
  General Information
  Schools Offering Courses
  Courses-General Info
  Preprofessional Studies
  Certificate Programs for College Graduates
  Grading System
  Campus Housing and Dining Plans
  Necessities
  Selected Resources
  Campus Map
  Accreditations
  Administrative & Academic Offices
  Administrative Hours
  Availability of Records
  Downloadable Forms
  HU at a Glance
  Study Abroad Programs & Internships
  My Personal Catalog
HELP
2008 Summer Sessions 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

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.

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

Semester Hours: 3

Summer 2008 Offering:
SSI
60705:    Distance Learning, Moody

SSII
70620:    Distance Learning, Kamberova




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