Go to Main Content

Lebanese American University WWW Information System

 

HELP | EXIT

Detailed Course Information

 

Date
Mar 25, 2017
Transparent Image
Information Select the desired Level or Schedule Type to find available classes for the course.

CSC 611 - Design&Analysis of Algorithms
This course addresses both the fundamentals and the research boundaries of algorithm design and analysis. Covered topics include: complexity of algorithms, divide and conquer techniques, greedy methods, dynamic programming, recursive backtracking, amortized analysis, graph algorithms, polynomial-time problem reduction, NP-completeness, approximation algorithms and a selected advanced topic. [3-0, 3 cr.]
3.000 Credit hours
3.000 Lecture hours

Levels: Graduate
Schedule Types: Lecture, Tutorial

Computer Science & Mathematics Division
Computer Science Department

Restrictions:
May not be enrolled in one of the following Programs:     
      Freshman Science
      Freshman Arts
Must be enrolled in one of the following Levels:     
      Graduate
May not be enrolled in one of the following Degrees:     
      Executive MBA

Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.5.4