Syllabus

CS40008
Course name	Parallel Algorithms
Offered by	Computer Science & Engineering
Credits	3
L-T-P	3-0-0
Previous Year Grade Distribution
	{{{grades}}}
Semester	Spring

Syllabus mentioned in ERP

Parallel Models (SIMD, MIMD, PRAMs, Interconnection Networks); Performance Measures (Time, Processors, Space, Work); Interconnection Architectures (Linear Array, Meshes, Trees, Mesh of Trees, Hypercubes, Butterfly Networks, Cube Connected Cycles, Benes Networks); Techniques (Balanced Trees, Pointer Jumping, Divide and Conquer, Partitioning, Pipelining, Systolic Computation, Accelerated Cascading, Prefix Computation, List Ranking, Euler Tour, Tree Contraction); Sorting, Searching, Merging; Matrix Operations; Graph Algorithms (Connected Components, Spanning Trees, Shortest Paths); Complexity (Lower bounds, NC Class and P-Completeness).

Concepts taught in class

Student Opinion

How to Crack the Paper

Classroom resources

Additional Resources