CS 225

CS 225 - Data Structures

Spring 2025

TitleRubricSectionCRNTypeHoursTimesDaysLocationInstructor
Data StructuresCS225AL131208LEC41100 - 1150 M W F  AUD Foellinger Auditorium Carl Evans
Data StructuresCS225AL259777LEC41100 - 1150 M W F  AUD Foellinger Auditorium Carl Evans
Data StructuresCS225AYA31234LBD00900 - 1050 R  3031 Campus Instructional Facility Yuchen Mo
Justin Hu
Madhav Jivrajani
Saad Alam
Data StructuresCS225AYC31222LBD01100 - 1250 R  4029 Campus Instructional Facility Trisha Choudhary
Thrivikraman Varadharajan
Data StructuresCS225AYD31225LBD01100 - 1250 R  4025 Campus Instructional Facility Divya Koya
Saloni Vaishnav
Data StructuresCS225AYE31227LBD01300 - 1450 R  4029 Campus Instructional Facility Kartik Ramesh
Rishabh Adiga
Data StructuresCS225AYF31229LBD01300 - 1450 R  4025 Campus Instructional Facility Vlas Zyrianov
Data StructuresCS225AYG31231LBD01500 - 1650 R  4029 Campus Instructional Facility Carl Evans
Data StructuresCS225AYH59778LBD01500 - 1650 R  4025 Campus Instructional Facility Kendall Koe
Data StructuresCS225ZJ168283LBD4 -    Volodymyr Kindratenko

Official Description

Data abstractions: elementary data structures (lists, stacks, queues, and trees) and their implementation using an object-oriented programming language. Solutions to a variety of computational problems such as search on graphs and trees. Elementary analysis of algorithms. Course Information: Credit is not given for CS 277 if credit for CS 225 has been earned. Prerequisite: CS 126 or CS 128 or ECE 220; One of CS 173, CS 413, MATH 213, MATH 347, MATH 412, or MATH 413. Class Schedule Information: Students must register for one lecture-discussion and one lecture section.