Programming, Algorithms and Data Structures
computer science
about this course
The course builds on the first course in programming to serve as a gentle introduction to more
advanced ideas in programming with more advanced data structures. Further, it ties up the
practice of programming with reasoning about program performance and correctness. The
questions that motivate the course include:
(1) What does it mean for a program or an algorithm to run at a particular time or
consume a certain amount of space?
(2) What do data structures have to do with run-time and space? How do we build more
efficient data structures, which can computationally capture a range of objects?
(3) How do we make them more efficient? Or handle complex trade-offs that are involved
in this regard.
(4) How do we use all that we know about programming to build implementable interactive
programs of intermediate scale?
in these programmes
- computer science
required · 4-year major, 4-year double major, 3-year major, 3-year double major, 4-year minor, 3-year minor, concentration (4-year), concentration (3-year)
planning & teaching
recently taught by
- Prathamesh T V HAssistant Professor, Computer Science
Recorded in 2026 T2, 2025 T2, 2024 T2. Instructors may change.