COMP 212
Spring 2007
| Section:
01
|
| Certificates: Informatics and Modeling |
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. |
|
Essential Capabilities:
Quantitative Reasoning |
| Credit: 1 |
Gen Ed Area Dept:
NSM MATH |
| Course Format: Lecture | Grading Mode: Graded |
| Level: UGRD |
Prerequisites: COMP211 |
|
Fulfills a Requirement for: (CADS)(COMP)(DATA-MN)(IDEA-MN)(IDEA-EE)(INFO-MN)(MATH)(NS&B)(STS) |
|
Past Enrollment Probability: Not Available |
| SECTION 01 |
Major Readings: Wesleyan RJ Julia Bookstore
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 additional laboratory sections. |
| Instructor(s): Danner,Norman Times: ..T.R.. 10:30AM-11:50AM; Location: SCIE121; |
| Total Enrollment Limit: 60 | | SR major: 0 | JR major: 0 | | |
| Seats Available: 41 | GRAD: 0 | SR non-major: 5 | JR non-major: 5 | SO: 25 | FR: 25 |
| Drop/Add Enrollment Requests | | | | | |
| Total Submitted Requests: 0 | 1st Ranked: 0 | 2nd Ranked: 0 | 3rd Ranked: 0 | 4th Ranked: 0 | Unranked: 0 |
|