ASSIGNMENT 1
Write a parallel C program that returns the answer for the following problem:
Given a nonempty set S, with elements {a1, a2, a3, ...}, and a integer N,
find the number of nonempty subsets of S, such that the sum of all elements
in this subset equals to N.
This problem is NP-complete, meaning that currently there is no way
to sovle it efficiently. However, since this assignment is targeted for
parallel computing, the algorithm is not an important part.
You only need to take the simplest approach:
enumerate all the subset of S, add up the elements and compare to N,
count one if there is a match, and finally return the total number of counts.
ASSIGNMENT 2
Write a parallel C program that reads an image from a binary BMP file on disk, inverts all of the pixels, and saves the image as a new BMP file
Hello,
I can write for you a parallel C code that will generates all subsets of a given set, calculate their sum and check which is equal to N. I will also write a parallel C code to invert the pixels from a BMP file.
Thanks for considering me,
Paul