This course is a survey of fundamental data structures for information processing, including lists, stacks, queues, trees, and graphs. It explores the implementation of these data structures (both array-based and linked representations) and examines classic algorithms that use these structures for tasks such as sorting, searching, and text compression. The Java programming language is used to demonstrate the topics discussed; and key notions of object-oriented programming, including encapsulation and abstract data types, are emphasized.
Registration Closes: January 23, 2025
Credits: 4
View Tuition Information Term
Spring Term 2025
Part of Term
Full Term
Format
Online or On Campus
Credit Status
Graduate, Undergraduate
Section Status
Open