Student Detais:-Abhishek Gupta - 2014A7PS026PHarshit Jain - 2014A7PS101PSubmission Details:-Problems chosen:-1.) Knapsack2.) Travelling Salesman problemTwo solutions to each of the above problem have been coded in C using OpenMP and MPI respectively.Code files are the present in the following subfolders:-1.) tsp_mpi2.) tsp_openmp3.) knapsack_mpi4.) knapsack_openmpThe name of code file is same as of that of subfolder.FOR MPI:-Code files in the subfolders use blocking send and blocking receive. We modified the same code to usenon-blocking send and blocking receive as well to calculate time values. Non-blocking send and blockingreceive code is kept in EXTRA folderFOR OpenMP:-For the OpenMP assignment, serial code was taken from the web and changes were done on them toparallize them using OpenMP.For 1,2,3 optimal value of the solution and the solution has been calculated. For 4, only optimalvalue has been calculatedTo test the code, move the subfolder in terminal and run the following command:-make < [testcase_file_name.in]E.g. make < t1.inTo print the communication messages in case of MPI as use, make debug < [testase_file_name.in]Number of threads can be changed by changing the number in "omp_set_num_threads" function call. Itis the first statement in the main function.Number of processors in MPI can be changed by changing the argument n in the MakefileTesting was done on test_cases taken from web as well as some randomly generated test cases.Testcases for each problem is present is the respective subfolderExecution times were recorded for each problem. You can find them in records.txt in the problemsubfolder.