COMP 212
Spring 2011
| Section:
01
|
| Certificates: Informatics and Modeling |
This is a 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; topics covered will include abstract data types, stacks, queues, trees, hashing, and sets, addressed from both programming and mathematical standpoints. |
|
Essential Capabilities:
Logical Reasoning, Quantitative Reasoning
This course will develop fundamental ideas of object-oriented programming and their associated formalisms.
|
| 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
Sedgewick, Robert, ALGORITHMS IN JAVA PTS. 1-4, ISBN13: 978-0-201-36120-9
|
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): Aaron,Eric Times: ..T.R.. 10:30AM-11:50AM; Location: SCIE139; |
| Total Enrollment Limit: 30 | | SR major: 0 | JR major: 0 | | |
| Seats Available: 13 | GRAD: X | SR non-major: 2 | JR non-major: 2 | SO: 10 | FR: 16 |
| Drop/Add Enrollment Requests | | | | | |
| Total Submitted Requests: 0 | 1st Ranked: 0 | 2nd Ranked: 0 | 3rd Ranked: 0 | 4th Ranked: 0 | Unranked: 0 |
|