The aim of this assignment is to acquaint you with the concepts of parallelization, concurrency and multithreading using Java. This assignment contains two parts –
Part A
Congratulations on building the IIITD Placement Cell management portal “Future Builder”, which was made in Assignment-1!!!!! . However, the number of registered students has grown manifold, and some functionalities are working too slow. IIITD Placement cell wants the functionality of arranging students in the descending order of their CGPA. This functionality will be making use of Odd Even Transposition Sort (search what this is)
You have to do the following:
- – Compare the execution time with and without parallelization by varying the CGPA of the students (number of students should be [1, 10, 100, 1000, 10000])
- – the CGPA of students should be randomly generated (ensure it’s between 0.000 and 10.000)
Part B
Implement a recursive balanced binary tree package with and without parallelization. You are allowed to use Java Collection Framework in this part.
The number of input nodes ‘N’ should be [10, 1000, 106], and total number of threads ‘T’ should be {2, 4} i.e. you have to show 3*2 = 6 simulations of your implementation for the parallelization variant and 3 simulations for different values of ‘N’ for the non-parallelization variant, thus making the total simulations as 9 (6 for parallelization and 3 otherwise). For the elements of the tree you can choose integers randomly from [-109, 109] and create the balanced binary tree. Ensure that for any given ‘N’ and ‘T’, the elements in the tree should be the same for both the cases for fair comparison.
For each combination of ‘N’, ‘T’ and the implementation technique (parallel or not) (total 9), you have to report –
- – time taken to construct the tree
- – height of the tree
- – time taken to search for an element in the constructed tree (note that for any given ‘N’
and ‘T’, the element should be the same for fair comparison across both variants of parallelization)
