CS 260 Data Structures

Explores the correct use of a variety of data structures in object-oriented programs. The topics covered include the uses of complexity analysis, simple and complex sorting algorithms, stacks, queues, priority queues, arrays, linked-lists, file processing, tree structures, binary search trees, hashing algorithms, heaps and recursion..

Credits

4

Prerequisite

Prerequisite: CS 162 Introduction to Computer Science II with a grade of C or better.

Offered

Offered Spring only

Notes

Lower Division Transfer (LDT) Course

General Education Requirements

AAOT Science/Math Non Lab,