Worst and average case analysis. Recurrences and asymptotics. Efficient algorithms for sorting, searching, and selection. Data structures: binary search trees, heaps, hash tables. Algorithm design techniques: divide-and-conquer, dynamic programming, greedy algorithms, amortized analysis, and randomization. Algorithms for fundamental graph problems: minimum-cost spanning tree, connected components, topological sort, and shortest paths. Possible additional topics: network flow, and string searching. Prerequisite: 103 or 103B; 109 or STATS 116.
Details
CS 161
- 班级编号：15470
- Course Cost: $6860.00
- Population: Undergraduate, Graduate
- Units: 5
- Interest Area: Computer Science and Engineering
- Course Format & Length: In-person, 8 weeks
- 指导老师：Hosgur，E.，Ivkov，M.
- Dates: June 22, 2024 - August 18, 2024
- 先决条件：CS 106B 或 CS 106X；CS 103 或 CS 103B；CS 109 或 STATS 116
- 时间安排：周一、周三、周五 上午 10:30 - 下午 12:15
Events and Engagement
Workshops
Hosted through the Summer Academic Resource Center (SARC), we offer a variety of educational workshops to complement your academic pursuits. Presenters varying from Stanford affiliates, community partners, and graduate tutors will cover a wide range of topics from academic skills to career exploration. Past workshops included college preparedness, software exploration, and building your professional network.
Stanford Spaces
Explore the intellectual ecosystem of the Stanford campus. Tour museums like the Cantor Arts Center, visit unique campus spaces like the d.school, Frost Amphitheater, and O’Donohue Family Farm, and get to know the unique community of companies and innovators that gather at Stanford Research Park.
Stanford Voices
These small gatherings give you an opportunity to connect with Stanford faculty, fellows, and alumni to hear about their work or research, as well as the road that brought them there. Ask questions and continue your intellectual exploration—whether you're taking a course on the topic this summer or just curious.