This course covers the organization of data and the algorithms that act upon them. The topics of stacks, queues, trees and sets are introduced. Fundamentals of algorithm performance are also introduced, with an emphasis placed on time complexity analysis. Applications to data structure searching and sorting, memory allocation and file management are included. Laboratory activities include the application of data structures from standard libraries. (prereq: CS-1020) (2-2-3)

On successful completion of this course, the student will:

• understand and apply complex data structures and algorithms.
• use appropriate algorithms (and associated data structures) to solve complex problems.
• have a thorough understanding of commonly used library data structures.
• be able to analyze the time complexity of algorithms, both sequential and recursive.
• understand the use of recursion in problem solving.
• be able to use data structures in software design and implementation.
• be able to apply standard library data structures in software design.

The above course description and goals were taken from the official course description.

Please review the general course policies webpage.

Data Structures and the Java Collections Framework 2^nd Ed., by William Collins, McGraw-Hill, 2005. ISBN: 0-07-302265-9

Quizzes will be given nearly every week at the beginning of lab. The lowest quiz score will be dropped. No make-up quizzes will be given.

Unless stated otherwise, all laboratory assignments will be completed in teams of two. One lab report should be submitted for each team. Lab assignments are worth 50 points per week of the assignment.

* I would like to have lunch with you individually or as a group to get to know you better. If we eat in RWJ, housing will pick up my lunch bill. If you would prefer to eat elsewhere, we will each be responsible for our own bill. Feel free to suggest another time if the time above does not work for you.

© 2001-2006 Dr. Christopher C. Taylor

Office: CC-36C

Phone: 277-7339