This course covers basics of algorithm design and analysis, as well as algorithms for sorting arrays, data structures such as priority queues, hash functions, and applications such as Bloom filters. Algorithms for Searching, Sorting, and Indexing can be taken for academic credit as part of CU Boulder鈥檚 Master of Science in Data Science (MS-DS) degree offered on the 糖心vlog官网观看 platform. The MS-DS is an interdisciplinary degree that brings together faculty from CU Boulder鈥檚 departments of Applied Mathematics, Computer Science, Information Science, and others. With performance-based admissions and no application process, the MS-DS is ideal for individuals with a broad range of undergraduate education and/or professional experience in computer science, information science, mathematics, and statistics. Learn more about the MS-DS program at /degrees/master-of-science-data-science-boulder.
A Simple Data Structure: The Dynamic Array
Loading...
Skills You'll Learn
Algorithms, Theoretical Computer Science, Computer Programming, Analysis of Algorithms, Data Structure Design, Hashtables, Data Structures, Python Programming, Algorithm Design
Reviews
4.7 (455 ratings)
- 5 stars79.12%
- 4 stars13.84%
- 3 stars3.29%
- 2 stars1.53%
- 1 star2.19%
SK
Oct 3, 2021
Well laid out course which is both concise and has elaborate assignments which help in learning the concepts well. Many thanks to the professor for his effort.
JO
Nov 5, 2024
Very straightforward course. Lectures and notes are clear and if you pay attention to them/do the readings, the quizzes and problem sets shouldn't be too hard.
Taught By
Sriram Sankaranarayanan
Professor