[Solved] COM301P Lab6

$25

File Name: COM301P_Lab6.zip
File Size: 113.04 KB

SKU: [Solved] COM301P Lab6 Category: Tag:
5/5 - (1 vote)

(Q.1,2,3 & 9 are from previous fork assignment questions which are to be implemented in multithreaded fashion)

  1. Generate Armstrong number generation within a range.
  2. Ascending Order sort and Descending order sort.
  3. Implement a multithreaded version of binary search. By default, you can implement a search for the first occurrence and later extend to support multiple occurrence (duplicated elements search as well)

4.Generation of Prime Numbers upto a limit supplied as Command Line Parameter.

  1. Computation of Mean, Median, Mode for an array of integers.
  2. Implement Merge Sort and Quick Sort in a multithreaded fashion.
  3. Estimation of PI Value using Monte carlo simulation technique (refer the internet for the method..) using threads.

Optional:

  1. Computation of a Matrix Inverse using Determinant, Cofactor threads, etc.
  2. Read upon efficient ways of parallelizing the generation of Fibonacci series and apply the logic in a multithreaded fashion to contribute a faster version of fib series generation.
  3. Longest common sub sequence generation problem using threads.

Reviews

There are no reviews yet.

Only logged in customers who have purchased this product may leave a review.

Shopping Cart
[Solved] COM301P Lab6
$25