this is my code to count the frequency of words in a text file #define _GNU_SOURCE #include #include #include #include /****************************** here is the Structure for storing words received from each thread ******************************/ struct return_vall{ char wordlist[100][100]; int count[100]; } *arr; pthread_t *threads; int lines; /***************************** here are Aggregates Frequency Sum of different threads *****************************/ int aggregate(char *a) { int sum = 0; int i=0; while(1) { if(i==lines) break; int count = 0; while(1) { if(arr[i].count[count] == -1) { break; } if(strcmp(a,arr[i].wordlist[count]) == 0) { sum += arr[i].count[count]; arr[i].count[count] = 0; } count++; } i++; } return sum; } /************************** Function thta are executed by each thread on seperate line. **************************/ void *word_count(void* num) { int *ln = num; unsigned int line_number = *ln; line_number++; //printf(\"Thread %d\ \",line_number); char cmd_p1[9] = \"sed -n \'\\0\"; char cmd_p2[2]; sprintf(cmd_p2,\"%d\",line_number); char cmd_p3[14] = \"p\' \'file.txt\'\\0\"; char command[100]; command[0] = \'\\0\'; strcat(command,cmd_p1); strcat(command,cmd_p2); strcat(command,cmd_p3); //usleep(line_number); char cmd[100] = \" | tr [:space:] \'\\\ \' | grep -v \'^\\\\s*$\' | sort | uniq -c | sort\\0\"; strcat(command,cmd); //printf(\"%s\ \",command); //fflush(stdout); FILE *in; in= popen(command, \"r\"); rewind(in); char buff[50]; int counter = 0; while(fgets(buff,sizeof(buff),in)) { char c=\' \'; int i = 0; int cnt = atoi(buff); arr[line_number-1].count[counter] = cnt; while(c!=\'\\0\') { c=buff[i]; buff[i]=buff[i+6]; i++; } int cnnt = 0; while(c!=\' \') { c = buff[cnnt]; cnnt++; } i=0; while(c!=\'\\0\') { c=buff[i]; buff[i]=buff[i+cnnt]; i++; } sprintf(arr[line_number-1].wordlist[counter],\"%s\",buff); //printf(\"%d %s\",arr[line_number-1].count[counter],arr[line_number- 1].wordlist[counter]); counter++; } arr[line_number-1].count[counter] = -1; fclose(in); return NULL; } int main(void) { FILE *fp; fp = fopen(\"file.txt\",\"r\"); char a[200]; lines = 0; void *status = NULL; while(fgets(a,sizeof(a),fp) !=NULL) { lines++; } fclose(fp); arr = (struct return_vall*) calloc(lines, sizeof(struct return_vall) * lines); threads = malloc(sizeof(pthread_t)*lines); int i; for(i=0;i= 0) { if(arr[i].count[ctr] > 0) { strcpy(final[final_ctr],arr[i].wordlist[ctr]); final_cnt[final_ctr] = arr[i].count[ctr]; arr[i].count[ctr] = 0; int sum = aggregate(arr[i].wordlist[ctr]); final_cnt[final_ctr] += sum; printf(\"%d %s\",final_cnt[final_ctr],final[final_ctr]); } ctr++; final_ctr++; } i++; if(i==lines) { break; } } free(arr); return 0; } Solution this is my code to count the frequency of words in a text file #define _GNU_SOURCE #include #include #include #include /****************************** here is the Structure for storing words received from each thread ******************************/ struct return_vall{ char wordlist[100][100]; .

1. this is my code to count the frequency of words in a text file
#define _GNU_SOURCE
#include
#include
#include
#include
/******************************
here is the Structure for storing words
received from each thread
******************************/
struct return_vall{
char wordlist[100][100];
int count[100];
} *arr;
pthread_t *threads;
int lines;
/*****************************
here are Aggregates Frequency Sum of
different threads
*****************************/
int aggregate(char *a)
{
int sum = 0;
int i=0;
while(1)
{
if(i==lines) break;
int count = 0;
while(1)
{
if(arr[i].count[count] == -1)
{
break;
}

2. if(strcmp(a,arr[i].wordlist[count]) == 0)
{
sum += arr[i].count[count];
arr[i].count[count] = 0;
}
count++;
}
i++;
}
return sum;
}
/**************************
Function thta are executed by each
thread on seperate line.
**************************/
void *word_count(void* num)
{
int *ln = num;
unsigned int line_number = *ln;
line_number++;
//printf("Thread %d ",line_number);
char cmd_p1[9] = "sed -n '0";
char cmd_p2[2];
sprintf(cmd_p2,"%d",line_number);
char cmd_p3[14] = "p' 'file.txt'0";
char command[100];

3. command[0] = '0';
strcat(command,cmd_p1);
strcat(command,cmd_p2);
strcat(command,cmd_p3);
//usleep(line_number);
char cmd[100] = " | tr [:space:] ' ' | grep -v '^s*$' | sort | uniq -c | sort0";
strcat(command,cmd);
//printf("%s ",command);
//fflush(stdout);
FILE *in;
in= popen(command, "r");
rewind(in);
char buff[50];
int counter = 0;
while(fgets(buff,sizeof(buff),in))
{
char c=' ';
int i = 0;
int cnt = atoi(buff);
arr[line_number-1].count[counter] = cnt;
while(c!='0')
{
c=buff[i];
buff[i]=buff[i+6];
i++;
}
int cnnt = 0;
while(c!=' ')
{

4. c = buff[cnnt];
cnnt++;
}
i=0;
while(c!='0')
{
c=buff[i];
buff[i]=buff[i+cnnt];
i++;
}
sprintf(arr[line_number-1].wordlist[counter],"%s",buff);
//printf("%d %s",arr[line_number-1].count[counter],arr[line_number-
1].wordlist[counter]);
counter++;
}
arr[line_number-1].count[counter] = -1;
fclose(in);
return NULL;
}
int main(void)
{
FILE *fp;
fp = fopen("file.txt","r");
char a[200];
lines = 0;
void *status = NULL;
while(fgets(a,sizeof(a),fp) !=NULL)
{

5. lines++;
}
fclose(fp);
arr = (struct return_vall*) calloc(lines, sizeof(struct return_vall) * lines);
threads = malloc(sizeof(pthread_t)*lines);
int i;
for(i=0;i= 0)
{
if(arr[i].count[ctr] > 0)
{
strcpy(final[final_ctr],arr[i].wordlist[ctr]);
final_cnt[final_ctr] = arr[i].count[ctr];
arr[i].count[ctr] = 0;
int sum = aggregate(arr[i].wordlist[ctr]);
final_cnt[final_ctr] += sum;
printf("%d %s",final_cnt[final_ctr],final[final_ctr]);
}
ctr++; final_ctr++;
}
i++;
if(i==lines)
{
break;
}
}
free(arr);
return 0;

6. }
Solution
this is my code to count the frequency of words in a text file
#define _GNU_SOURCE
#include
#include
#include
#include
/******************************
here is the Structure for storing words
received from each thread
******************************/
struct return_vall{
char wordlist[100][100];
int count[100];
} *arr;
pthread_t *threads;
int lines;
/*****************************
here are Aggregates Frequency Sum of
different threads
*****************************/
int aggregate(char *a)
{
int sum = 0;
int i=0;
while(1)
{
if(i==lines) break;
int count = 0;
while(1)
{
if(arr[i].count[count] == -1)

7. {
break;
}
if(strcmp(a,arr[i].wordlist[count]) == 0)
{
sum += arr[i].count[count];
arr[i].count[count] = 0;
}
count++;
}
i++;
}
return sum;
}
/**************************
Function thta are executed by each
thread on seperate line.
**************************/
void *word_count(void* num)
{
int *ln = num;
unsigned int line_number = *ln;
line_number++;
//printf("Thread %d ",line_number);
char cmd_p1[9] = "sed -n '0";
char cmd_p2[2];

8. sprintf(cmd_p2,"%d",line_number);
char cmd_p3[14] = "p' 'file.txt'0";
char command[100];
command[0] = '0';
strcat(command,cmd_p1);
strcat(command,cmd_p2);
strcat(command,cmd_p3);
//usleep(line_number);
char cmd[100] = " | tr [:space:] ' ' | grep -v '^s*$' | sort | uniq -c | sort0";
strcat(command,cmd);
//printf("%s ",command);
//fflush(stdout);
FILE *in;
in= popen(command, "r");
rewind(in);
char buff[50];
int counter = 0;
while(fgets(buff,sizeof(buff),in))
{
char c=' ';
int i = 0;
int cnt = atoi(buff);
arr[line_number-1].count[counter] = cnt;
while(c!='0')
{
c=buff[i];
buff[i]=buff[i+6];
i++;
}

9. int cnnt = 0;
while(c!=' ')
{
c = buff[cnnt];
cnnt++;
}
i=0;
while(c!='0')
{
c=buff[i];
buff[i]=buff[i+cnnt];
i++;
}
sprintf(arr[line_number-1].wordlist[counter],"%s",buff);
//printf("%d %s",arr[line_number-1].count[counter],arr[line_number-
1].wordlist[counter]);
counter++;
}
arr[line_number-1].count[counter] = -1;
fclose(in);
return NULL;
}
int main(void)
{
FILE *fp;
fp = fopen("file.txt","r");
char a[200];
lines = 0;
void *status = NULL;

10. while(fgets(a,sizeof(a),fp) !=NULL)
{
lines++;
}
fclose(fp);
arr = (struct return_vall*) calloc(lines, sizeof(struct return_vall) * lines);
threads = malloc(sizeof(pthread_t)*lines);
int i;
for(i=0;i= 0)
{
if(arr[i].count[ctr] > 0)
{
strcpy(final[final_ctr],arr[i].wordlist[ctr]);
final_cnt[final_ctr] = arr[i].count[ctr];
arr[i].count[ctr] = 0;
int sum = aggregate(arr[i].wordlist[ctr]);
final_cnt[final_ctr] += sum;
printf("%d %s",final_cnt[final_ctr],final[final_ctr]);
}
ctr++; final_ctr++;
}
i++;
if(i==lines)
{
break;
}
}

11. free(arr);
return 0;
}