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..




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


Offered Spring only


Lower Division Transfer (LDT) Course

General Education Requirements

AAOT Science/Math Non Lab,


Upon successful completion of this course, students will be able to:
Demonstrate an understanding of programmatic input, manipulation, and output of digital files. Write correct source code for creating and using data structures and abstract data types such as stacks, ques, lists, trees, hash tables and heaps. Analyze, evaluate, and write various searching and sorting algorithms using pseudo-code and source code. Describe programs and algorithms in terms of time complexity and space complexity.