CISP 430 Data Structures Fall 2009

Instructor: Dan Ross

Email: rossd@flc.losrios.edu

Prerequisite:

None

Schedule:

Fall 2009 details TBD

Catalog Description:

This is a course in data structures for computer science. Topics include time complexity analysis and big-O notation, recursion, searching and sorting, linked lists, stacks, queues, priority queues, binary trees, B-trees, graphs, hashing, and basic encryption algorithms.

What the Course is About and Why YOU Should Take It:

Data structures is typically the class that separates the real computer scientists from those who simply know how to write some code.

We will study common ways to organize data in computer programs, and study the common algorithms that operate on this data. We will also analyze these algorithms to determine if they have good or bad performance. This is a really good course for programmers who want to improve their understanding of the relationship between data organization and algorithms in intermediate to advanced level computer programs. It will deepen your knowledge, and make you a better programmer.

This course is part of several degree and certificate programs at FLC. It is also required course for Computer Science majors and Computer Engineering majors at many four-year colleges. It also articulates to other 4-year programs. Check www.assist.org to be sure.

Texts:

· To be determined. Maybe even provided.