(Q.1,2,3 & 9 are from previous fork assignment questions which are to be implemented in multithreaded fashion)
- Generate Armstrong number generation within a range.
- Ascending Order sort and Descending order sort.
- 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.
- Computation of Mean, Median, Mode for an array of integers.
- Implement Merge Sort and Quick Sort in a multithreaded fashion.
- Estimation of PI Value using Monte carlo simulation technique (refer the internet for the method..) using threads.
Optional:
- Computation of a Matrix Inverse using Determinant, Cofactor threads, etc.
- 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.
- Longest common sub sequence generation problem using threads.
