Info 290
Practical Data Structures and Algorithms
2 units
Course Description
This course covers the fundamental data structures and algorithms found in many technical interviews. These data structures include (but are not limited to): lists, stacks, queues, trees, heaps, hashes, and graphs. Algorithms, such as those for sorting and searching, will also be covered, along with an analysis of their time and space complexity. Students will learn to recognize when these data structures and algorithms are applicable, implement them in a group setting, and evaluate their relative advantages and disadvantages.
Signing Up for I School Classes
Instructions for Berkeley undergrads, graduate students, and community members