COMP212 - Data Structures

[ Wesleyan Home Page ] [ WesMaps Home Page ] [ WesMaps Archive ] [ Course Search ] [ Course Search by CID ]
Academic Year 2005/2006

Data Structures
COMP 212 SP

This is the second course in a two-course sequence (COMP 211-212) that is the gateway to the Computer Science major. This course provides an introduction to fundamental algorithms and data structures based on the notion of an abstract data type. The topics will include abstract data types, stacks, queues, sets, hashing, and graphs; these will be addressed from both a programming and mathematical standpoint.

MAJOR READINGS

TBA

EXAMINATIONS AND ASSIGNMENTS

TBA

ADDITIONAL REQUIREMENTS and/or COMMENTS

Because of the non-programming topics that are addressed in COMP 211, permission to take COMP 212 without having taken COMP 211 will be decided on a case-by-case basis by the instructor. COMP 112 is not typically acceptable as a prerequisite for this course.

This course may have addtional laboratory sections.

COURSE FORMAT: Lecture

REGISTRATION INFORMATION

Level: UGRD Credit: 1 Gen Ed Area Dept: NSM MATH Grading Mode: Graded

Prerequisites: COMP211

SECTION 01

Instructor(s): Ridgway,John

Times: ..T.R.. 09:00AM-10:20AM; Location: SCIE638;

Reserved Seats: (Total Limit: 60)

SR. major: 0 Jr. major: 0

SR. non-major: 5 Jr. non-major: 5 SO: 25 FR: 25

Special Attributes:

Curricular Renewal: Quantitative Reasoning

Links to Web Resources For This Course.

Last Updated on MAR-30-2006