Dec 02, 2022  
2020-2021 Lane Community College Catalog 
2020-2021 Lane Community College Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

CS 260 - Data Structures 1

4 Credit(s)

This course is intended primarily for students seriously interested in computer science. Students will demonstrate the usage of advanced data structures, including linked-lists and tree structures using pointers, and advanced structure programming methods through a variety of programming projects.

Prerequisite: CS 162C  or CS 162P  or CS 162N  and MTH 111  or MTH 112   or MTH 231   or MTH 241   or MTH 251  or instructor consent.
Learning Outcomes

Upon successful completion of this course, the student should be able to:
1. Define and implement data structures including stacks, queues, linked lists, trees, hash tables, and graphs.
2. Program recursively and define how recursion works.
3. Measure and analyze algorithms for efficiency considerations.
4. Define and implement multiple search and sort algorithms.
5. Select the appropriate data structure and algorithm for a given problem.

Add to Portfolio (opens a new window)