Course Name: Randomized Algorithms

Course abstract

Algorithms are required to be correct" and fast". In a wide variety of ap- plications, these twin objectives are in conflict with each other. Fortunately, neither of these ideals are sacrosanct. Therefore we can often try to optimize one of these goals by incurring a small penalty on the other. This takes us to the field of Randomized Algorithms. Often, the randomized variants, in addition to being faster than their deterministic counterpart, are simpler to understand and implement. In this course, we will study this trade off between correctness and speed. We will be learning a number of methods to design and analyze randomized algorithms.

Course Instructor

Media Object

Prof. Benny George K

Dr Benny George K is an Assistant Professor in the Department of Computer Science and Engineering at IIT Guwahati. He is interested in theoretical aspects of computer science.
More info

Teaching Assistant(s)

No teaching assistant data available for this course yet
 Course Duration : Jan-Apr 2020

  View Course


 Enrollment : 18-Nov-2019 to 03-Feb-2020

 Exam registration : 16-Dec-2019 to 20-Mar-2020

 Exam Date : 25-Apr-2020




Certificate Eligible

Will be announced

Certified Category Count


Will be announced


Will be announced

Successfully completed

Will be announced


Will be announced





Final Score Calculation Logic

Toppers list will be updated shortly....!

Enrollment Statistics

Total Enrollment: 1561

Registration Statistics

Total Registration : 105

Assignment Statistics

Assignment Score

Graph will be updated shortly...!

Score Distribution Graph - Legend

Assignment Score: Distribution of average scores garnered by students per assignment.
Exam Score : Distribution of the final exam score of students.
Final Score : Distribution of the combined score of assignments and final exam, based on the score logic.