This is a simple implementation of the worker/reducer model implemented in C. It accepts a number N of splits (< 11) to make on a large file (input.txt) and creates N worker processes to count the occurences of certain words (CMPS, CCE, ECE).
It then creates 3 reducers to sum the total occurences of these words accross all file splits.
The goal of this project is to learn about handling processes and shared memories.