Scribd
Upload
3 views1 page

Parallel Algorithm Assignment 4

The document outlines an assignment for the Parallel Algorithm course at the University of Lucknow, focusing on various topics such as parallel best first search, computing models, and algorithms for finding the Kth smallest element. It includes questions on parallel searching algorithms, matrix multiplication, and solving linear equations, emphasizing their applications and challenges. Each question requires detailed explanations, examples, and performance analyses.

Uploaded by

darkside001912
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views1 page

Parallel Algorithm Assignment 4

The document outlines an assignment for the Parallel Algorithm course at the University of Lucknow, focusing on various topics such as parallel best first search, computing models, and algorithms for finding the Kth smallest element. It includes questions on parallel searching algorithms, matrix multiplication, and solving linear equations, emphasizing their applications and challenges. Each question requires detailed explanations, examples, and performance analyses.

Uploaded by

darkside001912
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

FACULTY OF ENGINEERING AND TECHNOLOGY, UNIVERSITY OF LUCKNOW

Department of Computer Science and Engineering


Parallel Algorithm (AI-8011)
CSE-AI (4th year/ 8th Sem)

Assignment#4

Q1. Explain principle of parallel best first search algorithm for planning problem on multicore
processor with suitable example. Discuss its benefits and applications?

Q2. Discuss parallel computing models and architectures for parallel search with suitable
diagram? Discuss its applications and challenges.

Q3. Describe how to find the Kth smallest element using parallel algorithms. Explain its working
on PRAM model with suitable example.

Q4. Explain the parallel searching algorithm in detail. Compare it with sequential searching and
analyze its time complexity and efficiency.

Q5. Explain the algorithm for finding the Kth element in X + Y (sum of two arrays) using
parallel computation. Discuss its steps and performance analysis.

Q6. Discuss parallel matrix multiplication algorithms on PRAM and MCC models. Compare
their performance and highlight challenges in implementation.

Q7. Explain the process of parallel matrix transposition and vector-matrix multiplication.
Illustrate with examples and analyze their computational complexity.

Q8. Describe how parallel algorithms are used to solve linear equations and root finding
problems. Explain any one method (e.g., Gaussian elimination or iterative methods) in
detail.

You might also like