Design Patterns and Data Structures (CS4106.01)

Justin Vasselli

In this class, students will learn common patterns used to solve problems found in software, and gain a deeper knowledge about common ways that data is stored and accessed. Students will learn about the design and implementation of data structures, including inked lists, stacks, queues, and trees. Students will also study common algorithms used to populate and query these data structures. Students will learn how to compare both the computational and memory efficiency of different algorithms and data structures, and will leave the class with a clear understanding of how and when to use each one.

Prerequisites: At least 1 semester of programming experience. Email instructor at prior to registration with short statement of background/interest; if multiple CS courses desired, please indicate priority
Credits: 4
W 8:30-12:10
Maximum Enrollment: 12
Course Frequency: Every 2-3 years
This course is categorized as All courses, Computer Science.