[WesMaps Home Page]
[Course Search]
[Course Search by CID]
COMP212
Data Structures
COMP212 SP
| Section | Class Size | *Available | Times |
|---|
| 1 | 80 | 26 | Times: M.W.F.. 11:00AM-11:50AM; |
*The number of spaces listed as available is based on class seats open for
the current phase of registration. Some seats may be taken in previous
phases while others may be held out for subsequent phases of registration.
(Last Updated on Wed Mar 4 05:00:40 EST 1998
)
The purpose of this course is to introduce and investigate a
variety of important data structures based on the notion of
an abstract data type. Topics will include abstract data
types, stack, queues, sets, hash tables, graphs, and object
oriented languages. There will be a number of programming
assignments using imperative languages.
MAJOR READINGS
To be announced
EXAMINATIONS AND ASSIGNMENTS
To be announced.
ADDITIONAL REQUIREMENTS and/or COMMENTS
It is strongly recommended that a student will have
previously taken MATH228 or enroll in MATH228 in the same
semester.
COURSE FORMAT: Discussion Lecture
REGISTRATION INFORMATION
Level: UG Credit: 1.00
Prerequisites:
COMP211
- Section 01
- Dougherty, D
- Times: M.W.F.. 11:00AM-11:50AM;
- Grading Mode: A/F
- Registration Preference (1 high to 6 low, 0=Excluded) Sr: 1, Jr: 1, So: 1, Fr: 1
- No Major Preference Given
Last Updated on MAR-03-1998
Contact wesmaps@wesleyan.edu to
submit comments or suggestions.
Copyright Wesleyan University, Middletown, Connecticut, 06459