CSCE 423

Design and Analysis of Algorithms

University of Nebraska-Lincoln · UGRD · Fall 2026

1 section

Catalog description

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.

Sections

Current meeting, instructor, credit, and enrollment details

Updated 6 hours ago

001

Availability not recently verified

Class #nebraska_lincoln-CSCE423Fall 2026UGRD3 credits

Days & times: No scheduled meeting time
Meeting dates: —
Location: —
Instructor: Staff

Class numbers and section codes come from the registrar.

Spot missing or incorrect course data?