Parallel Algorithms

CS646A

 

3-0-0-9

 

Courses with significant overlap with this course:

Semester of last offering:

Date of approval: dd-mmm-yyyy

Prerequisites:  

Course Contents

Complexity measure for parallel algorithms. Parallel combinatorial algorithms: permutations with and without repetitions, combinations, derangements. Parallel searching algorithms: maximum/minimum, median, Kth largest/smallest element. Parallel sorting algorithms. Parallel graph algorithms: parallel graph search and tree traversal algorithms, parallel algorithms for connectivity problems, parallel algorithms for path problems. 

Topics  

Instructor(s):
Number of sections:

Tutors for each section:

Schedule for Lectures:

Schedule for Tutorial:

Schedule for Labs:

 
 
 

 

 
Birds at IIT Kanpur
Information for School Children
IITK Radio
Counseling Service