CSCE 423/823: Design and Analysis of Algorithms

Prereqs: CSCE 235; CSCE 310 or CSCE 311.
Mathematical preliminaries. Strategies for algorithm design, including divide-and-conquer, greedy, dynamic programming and backtracking. Mathematical analysis of algorithms. Introduction to NP-Completeness theory, including the classes P and NP, polynomial transformations and NP-complete problems.
This course is a prerequisite for: CSCE 923, CSCE 924
Credit Hours: 3
Course Format: Lecture
Course Delivery: Classroom

Attention

This is the site for old bulletin data. Please head to UNL's Course Catalog for updated course and program information.