CSCE 310: Data Structures and Algorithms

Prereqs: Grades of "Pass" or "C" or better in CSCE 156/156H and 235/235H.
Theoretical concepts with programming assignments.
A review of algorithm analysis, asymptotic notation, and solving recurrence relations.  Advanced data structures and their associated algorithms, heaps, priority queues, hash tables, trees, binary search trees, and graphs.  Algorithmic techniques, divide and conquer, transform and conquer, space-time trade-offs, greedy algorithms, dynamic programming, randomization, and distributed algorithms.  Introduction to computability and NP-completeness.
Credit Hours: 3
Course Format: Lecture 3, Recitation 1
Course Delivery: Classroom


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