CSCE 311: Data Structures and Algorithms for Informatics

Prereqs: Grade of “Pass” or “C” or better in CSCE155.
Students may not receive credit for both CSCE310 and 311. CSE majors must take CSCE 310.
An introduction to algorithms and data structures for informatics. Foundational coverage of algorithms includes both problems (such as indexing, searching, sorting, and pattern matching) and methods (such as greedy, divide-and-conquer, and dynamic programming). Foundational coverage of data structures includes lists, tables, relational databases, regular expressions, trees, graphs, and multidimensional arrays. The topics will be studied in the context of informatics applications.
Credit Hours: 3
Course Format: Lab 1, Lecture 3
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.