Stanford Algorithms group for beginners
Hey, everyone. I'm a software engg. from India, and I host study groups where we study online courses together. I'll be starting the groups within a few days. We will study Algorithms course (Stanford Uni.) on Coursera. Format: Each week, members go through the course material. We will conduct the group on Discord. We discuss the course materials, solve the weekly quizzes, and have a real peer-review session of our assignments. On weekends, I'll host video call to provide assignment walkthroughs The group will last for 4 weeks. Target Audience: No Prerequisites This is a beginner-centric course Non-cs/it folks are encouraged to join!
Proficient English
Description
The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).
Syllabus
- Week 1
- Introduction; "big-oh" notation and asymptotic analysis.
- Week 2
- Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
- Week 3
- The QuickSort algorithm and its analysis; probability review.
- Week 4
- Linear-time selection; graphs, cuts, and the contraction algorithm.
Hosted By
Hosted By
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Get notified about new study groups every week!
Stanford Algorithms group for beginners
Hey, everyone. I'm a software engg. from India, and I host study groups where we study online courses together. I'll be starting the groups within a few days. We will study Algorithms course (Stanford Uni.) on Coursera. Format: Each week, members go through the course material. We will conduct the group on Discord. We discuss the course materials, solve the weekly quizzes, and have a real peer-review session of our assignments. On weekends, I'll host video call to provide assignment walkthroughs The group will last for 4 weeks. Target Audience: No Prerequisites This is a beginner-centric course Non-cs/it folks are encouraged to join!
Proficient English
-
TypeOnline Courses
-
ProviderCoursera
-
PricingFree to Audit
-
Duration16 hours 39 minutes
-
DifficultyIntermediate
-
CertificatePaid Certificate
- Week 1
- Introduction; "big-oh" notation and asymptotic analysis.
- Week 2
- Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
- Week 3
- The QuickSort algorithm and its analysis; probability review.
- Week 4
- Linear-time selection; graphs, cuts, and the contraction algorithm.
Hosted By
Learning is better with Cohorts
Frequently asked questions
Get notified about new study groups every week!