ENROLL Course Search
NOTE: There are some inconsistencies in the course listing data - ITS is looking into the cause.
Alternatives: For requirement lists, please refer to the current catalog. For up-to-the-minute enrollment information, use the "Search for Classes" option in The Hub. If you have any other questions, please email registrar@carleton.edu.
Your search for courses for 19/FA found 2 courses.
CS 201.01 Data Structures 6 credits
Open: Size: 34, Registered: 33, Waitlist: 0
| M | T | W | TH | F |
|---|---|---|---|---|
| 12:30pm1:40pm | 12:30pm1:40pm | 1:10pm2:10pm |
Requirements Met:
Think back to your favorite assignment from Introduction to Computer Science. Did you ever get the feeling that "there has to be a better/smarter way to do this problem"? The Data Structures course is all about how to store information intelligently and access it efficiently. How can Google take your query, compare it to billions of web pages, and return the answer in less than one second? How can one store information so as to balance the competing needs for fast data retrieval and fast data modification? To help us answer questions like these, we will analyze and implement stacks, queues, trees, linked lists, graphs, and hash tables. Students who have received credit for a course for which Computer Science 201 is a prerequisite are not eligible to enroll in Computer Science 201.
Prerequisite: Computer Science 111 or instructor permission
Sophomore Priority
Waitlist for Juniors and Seniors: CS 201.WL1 (Synonym 53201)
CS 201.02 Data Structures 6 credits
Closed: Size: 34, Registered: 28, Waitlist: 0
| M | T | W | TH | F |
|---|---|---|---|---|
| 9:50am11:00am | 9:50am11:00am | 9:40am10:40am |
Requirements Met:
Think back to your favorite assignment from Introduction to Computer Science. Did you ever get the feeling that "there has to be a better/smarter way to do this problem"? The Data Structures course is all about how to store information intelligently and access it efficiently. How can Google take your query, compare it to billions of web pages, and return the answer in less than one second? How can one store information so as to balance the competing needs for fast data retrieval and fast data modification? To help us answer questions like these, we will analyze and implement stacks, queues, trees, linked lists, graphs, and hash tables. Students who have received credit for a course for which Computer Science 201 is a prerequisite are not eligible to enroll in Computer Science 201.
Prerequisite: Computer Science 111 or instructor permission
Search for Courses
This data updates hourly. For up-to-the-minute enrollment information, use the Search for Classes option in The Hub