CS 260 Data Structures (Java)
Course explores the correct use of a variety of data structures in Java programs. Include the topics of complexity analysis, simple and complex sorting algorithms, stacks, queues, priority queues, arrays, linked-lists, file processing, tree structures, binary search trees, hashing algorithms and recursion.
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,
Outcomes
Upon successful completion of this course, students will be able to:
Demonstrate an understanding of complexity analysis and big O notation. Analyze and write Java code for numerous searching and sorting algorithms. Write Java code for linked lists and binary search trees. Demonstrate an ability to trace code for sorting algorithms using recursion. Demonstrate an understanding of hash tables, red black trees and multi way trees.