[
Wesleyan Home Page
] [
WesMaps Home Page
] [
WesMaps Archive
]
[
Course Search
] [
Course Search by CID
]
Academic Year 2000/2001
Data Structures
COMP 212 SP
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, stacks, queues, sets, hash tables,
graphs, and object-oriented
languages. There will be also be several substantial programming assignments.
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.
Unless preregistered students attend the first class meeting or communicate directly with the instructor prior to the first class, they will be dropped from the class list. NOTE: Students must still submit a completed
Drop/Add form to the Registrar's
Office.
COURSE FORMAT:
Lecture
REGISTRATION INFORMATION
Level:
UGRD
Credit:
1
Gen Ed Area Dept:
NSM MATH
Grading Mode:
Graded
Prerequisites:
COMP211
SECTION 01
- Instructor(s): Krizanc,David D.
- Instructor's Course Page
- Times: ..T.T.. 10:30AM-11:50AM; Location: SCIE109
- Reserved Seats: (Total Limit: UNL)
- SR. major: Jr. major:
- SR. non-major: Jr. non-major: SO: FR:
Special Attributes:
- Curricular Renewal: Quantitative Reasoning
Links to Web Resources For This Course.
Last Updated on MAR-26-2001
Contact
wesmaps@wesleyan.edu
to submit comments or suggestions. Please include a url, course title, faculty name or other page reference in your email
Copyright Wesleyan University, Middletown, Connecticut, 06459