Randomized Algorithms
Indian Institute of Technology Guwahati and NPTEL via Swayam
-
40
-
- Write review
Overview
INTENDED AUDIENCE : Senior UG students, PG students and Ph.D candidates interested in computer science, combinatorics, etc.PRE-REQUISITES : Basic Understanding of Algorithms and ProbabilitylINDUSTRY SUPPORT : Google, Microsoft
Syllabus
COURSE LAYOUT
Week 1 : Introduction to Randomized AlgorithmsWeek 2 : Probability Review
Week 3 : Moments and Deviation
Week 4 : The Probabilistic Method
Week 5 : Markov Chains - I
Week 6 : Markov Chain - II
Week 7 : Number Theoretic Algorithms
Week 8 : Graph Algorithms
Week 9 : Approximate Counting
Week 10: Data Structures
Week 11: Computational Complexity
Week 12: Review of the course
Taught by
Prof. Benny George K
Related Courses
-
Introduction to Graduate Algorithms
Georgia Institute of Technology
-
Algorithms and Data Structures
University of California, San Diego
-
Data Structures: An Active Learning Approach
University of California, San Diego
5.0 -
Algorithms
Stanford University
-
Data Structures and Algorithms
Georgia Institute of Technology
-
Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms
Georgia Institute of Technology
Reviews
0.0 rating, based on 0 reviews