CSIS 330 - Algorithms and Data Structures

Institution:

University of Nebraska at Kearney

Subject:

Description:

Prereq: CSIS 180* and ENG 102GS* and MATH 115* A comprehensive study of data structures and algorithms with programming applications. Topics include: a review of basic data structures (linked-lists, stacks, queues) and abstract data types, advanced data structures and their associated algorithms, heaps, priority queues, hash tables, trees, binary search trees, and graphs, advanced sorting and searching algorithms, divide and conquer algorithms, greedy algorithms, and dynamic programming. Problem analysis is emphasized. Computability, asymptotic notation and NP-completeness are introduced. An object-oriented programming language will be used.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.unk.edu

Phone Number:

(308) 865-8441

Regional Accreditation:

North Central Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.