Parallel Algorithms
Get the full GTU study material, English & Gujarati textbook PDFs, syllabus curriculum, and solved previous year question papers.
English Book & Chapters
English Book Coming Soon
We are working hard to add this material. Stay tuned for updates!
Follow on Instagram for UpdatesGTU Previous Year Papers
Papers Coming Soon
We are working hard to add this material. Stay tuned for updates!
Follow on Instagram for UpdatesParallel Algorithms Syllabus — Unit-wise Content
The official GTU curriculum for Parallel Algorithms (subject code ME02000351) as prescribed for CEE · Semester 2 divides the course into 6 units, covering 29 listed topics. The unit-wise breakdown below is read from the GTU syllabus document for this subject code, so you can check what the course actually covers before deciding which papers to attempt.
Download the official syllabus PDF (ME02000351)Unit 1 Computers Models of computation, Need for parallelism,
- Complexity measure for parallel algorithms
- parallel computational models such as PRAM
- Cube Connected Cycle
- Perfect Shuffle Computers
- Tree model
- Pyramid model
- Fully Connected model
- EREW models
- simulation of one model from another one, Expressing parallel algorithms
Unit 2 Parallel combinatorial algorithms
- permutations with and without repetitions combinations
Unit 3 Maximum/Minimum, Median, Kth Largest/Smallest element,
- Matrix Vector Multiplication
- Matrix-Matrix Multiplication
- Parallel discrete event simulation Image dithering
- Dense LU factorization
Unit 4 Parallel sorting algorithms
- Hyper quick sort
- Merge sort
- Bitonic merge Sort
- odd even transposition
- Enumeration sort (sorting on the CRCW model
- CREW model and EREW model) 10 20
Unit 5 Parallel searching algorithms
- Searching on a sorted sequence (EREW
- Searching on a random sequence (EREW
- Tree and Mesh) Sequential selection algorithm
- Parallel selection algorithm (EREW parallel solution)
Unit 6 Parallel graph algorithms
- parallel graph search &
- tree traversal algorithms
- Graph coloring
- Minimal spanning tree
- Shortest path algorithm
Study on Android App:
