|
|
CMP 338
Data Structures and Algorithms I
|
Course News
|
Date Posted | Announcement |
Sept 2, 2003 | There will be a special class meeting on
September 9, from 10 to 12 am, in Room 217, for those who want to learn
more about recursion.
I sent an email to all members of the class. If you haven't gotten it,
I probably copied your email address wrong. Please let me know. |
|
Course Description
|
4 hours, 4 credits.
Abstract characterizations of data structures such as arrays, stacks,
queues, trees and graphs will be studied along with algorithms that
make use of such structures, including algorithms for sorting, searching,
and memory management. Implementation issues will be considered,
and students will write programs that embody these structures and algorithms.
Prerequisites: CMP 326
Textbook: Frank M. Carrano and Janet Pritchard, Data Abstraction and Problem Solving with Java,
Walls and Mirrors, Updated Edition, 2004.
Classroom: Gillet 205
Time: Tuesdays and Thursdays, 9 - 10:50 am
|
|