Exam zone
IMPORTANT QUESTIONS PARALLEL ALGORITHMS (ECS-073) Q1. Discuss the parallel computation models and explain with example PRAM and Sequential model (LMCC Model). Q2. Explain with example Fully Connected Model and Pyramid Model. Q3. Differentiate the PRAM-EREW, CREW, and CRCW model. Q4. How can you measure the efficiency of parallel algorithms? And, also discuss the optimality of parallel with an example. Q5. Explain with example parallel summation and prefix sum Algorithm/Min-Max algorithm. Q6. Given A, a parallel algorithm with computation time t, if parallel algorithms A perform M computation operations, then p processors can execute A in t+(m-t)/p. Prove it. Q7. Design a parallel algorithm for adding n numbers in minimum cost operation. You are also required to find the minimum-cost execution time. Q8. Discuss the parallel algorithm for matrix transposition and matrix multiplication algorithms with example. Q9. Discuss the parallel algorithm for searching kth element in X+Y on CREW PRAM. Q10. Explain with example vector-matrix multiplication. Q11. Consider a linked list L, the rank of each node in L is the distance from the end of the list, formally, if succ(i)=nil then rank(i)=0; otherwise rank(i)=rank(succ(i))+1. Develop a parallel algorithm for a suitable PRAM model. Q12. Explain the parallel graph algorithm for finding connected components. Q13. Design a parallel version of odd-even sorting algorithm. You are also required to comment on its time-complexity.
Q14. Design a parallel version of single-source shortest path algorithm (Dijkastra’s or Moore) with example. Q15. Design and discuss a parallel version of Depth-First-Search algorithm for P-Depth, Breadth-Depth and Breadth-First Search algorithm with example. Q16. Design a parallel algorithm for multiplying two matrices and also comment on its time complexity. Q17. Describe in detail a parallel implementation of Bi-directional Gaussian elimination algorithm. Q18. Compare between Mesh and Shuffle exchange networks in detail. Q19. Design a cost optimal algorithm for sorting on a linear array. Q20. Design an algorithm for sorting on a CREW model with an example. Also give comments on its time complexity. Q21. Design a parallel algorithm for searching an element on CREW model with example. Also explain its time complexity.