Great Deal! Get Instant \$10 FREE in Account on First Order + 10% Cashback on Every Order Order Now

# COP-4338: Systems Programming Programming Assignment 4 PART II In this assignment, you are asked to write a program that gets a series of string chars followed by EOF from user through console,...

COP-4338: Systems Programming
Programming Assignment 4
PART II
In this assignment, you are asked to write a program that gets a series of string chars
followed by EOF from user through console, alphabetically sorts them using bucket sort,
and prints the sorted strings using printf function.
1 Bucket Sort
Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of a
list into a number of buckets. Each bucket is then sorted individually and then the sorted
list is obtained by merging all the sorted buckets together. To sort each bucket in this
assignment, you need to use any algorithm that you want. If you have no preference, you
can use bu
le sort algorithm which is fairly easy to implement. Also, to compare strings
with one another, you need to use function strcmp.
â†’
Figure 1: Example of bucket sort for sorting numbers 29, 25, 3, 49, 9, 37, 21, 43. Numbers
are distributed among bins (left image). Then, elements are sorted within each bin (right
image).
1
In order to implement bucket sort algorithm for strings, you need to have an a
ay of buckets
such that bucket is a C structure defined in the following way:
struct bucket{
int minInitial;
int maxInitial;
int numWords;
};
and node is another C structure defined in the following way:
struct node{
char* string;
struct node* next;
};
The a
ay of buckets must be defined and initialized in the following way:
struct bucket list[NUMBUCKS] = {
â€™aâ€™, â€™bâ€™, 0, NULL,
â€™câ€™, â€™câ€™, 0, NULL,
â€™dâ€™, â€™fâ€™, 0, NULL,
â€™gâ€™, â€™kâ€™, 0, NULL,
â€™lâ€™, â€™oâ€™, 0, NULL,
â€™pâ€™, â€™râ€™, 0, NULL,
â€™sâ€™, â€™sâ€™, 0, NULL,
â€™tâ€™, â€™zâ€™, 0, NULL
};
where NUMBUCKS represents 8. Therefore, you have eight buckets in your program. Each
ucket contains four variables:
Âˆ int minInitial: determines the minimum ASCII code of the initial letter which the
Âˆ int maxInitial: determines the maximum ASCII code of the initial letter which the
Âˆ int numWords: determines the number of strings placed in the bucket.
Âˆ struct node* chainHead: points to a singly linked list which is a chain of nodes con-
taining the strings in the bucket.
2
3 Program Input
Assume that user enters a series of string chars followed by an EOF. Also, assume that every
input string only contains letters of English Alphabet in lowercase format. Every string of
chars that user passes to the program must be stored in the format of a char string. To
allocate memory for storing a char string in memory, you can use expression char* aWord =
(char *)malloc(strlen(inputString)+1); in which inputString is a char * pointing to the a
ay
of letters given by the user, strlen and malloc are functions defined in stdlib.h li
ary (note
that +1 in the mentioned expression allocates an extra memory cell for \0 that specifies the
end of a char string).
After allocating enough memory cells for each input string and copying the string into
them, you need to allocate memory for storing a variable of type struct node containing a
char * (pointing to the string) and a struct node * pointing to the next node in the linked
list of appropriate bucket.
4 Program Output
Your program must print out the sorted list of strings in an alphabetical order using printf
function.
5 Submissions
You need to submit a .zip file compressing the C source file(s) related to the assignment (.c
files) along with a readme.txt file explaining which sorting algorithm you used for sorting
each bucket and listing parts of the assignment has been implemented completely/partially.
3

COP-4338 Systems Programming
Programming Assignment 5:
PART II
Due Date: June 16 at 11:55 PM
In this assignment, you are asked to write a program that converts a file format to
another. It should support the following formats:
Âˆ .csv (comma separated values) file: stores tabular data in plain text. Each line of the
file represents a table row containing one or more cells separated by commas.
Âˆ .tl5 file: stores tabular data in plain text. Each line of the file represents a table row
containing one or more cells separated by â€™|â€™ character. Each cell is 5-characters long
and contains a left-aligned string. If the string stored in a cell has n < 5 characters,
the rest of it will be filled with spaces; i.e. there will be 5âˆ’n extra space characters in
the field after the string. However, if a string with more than 5 characters is supposed
to be placed in a cell, only its first 5 characters is stored in the cell.
1 50% Bonus Part
As the bonus part, the program must support the following formats specified below:
Âˆ .tr9 file: stores tabular data in plain text. Each line of the file represents a table row
containing one or more cells separated by â€™|â€™ character. Each cell is 9-characters long
and contains a right-aligned string. If the string stored in a cell has n < 9 characters,
the rest of it will be filled with spaces; i.e. there will be 9âˆ’n extra space characters in
the cell before the string. However, if a string with more than 9 characters is supposed
to be placed in a cell, only its last 9 characters is stored in the cell.
Âˆ .tc9 file: stores tabular data in plain text. Each line of the file represents a table row
containing one or more cells separated by â€™|â€™ character. Each cell is 9-characters long
and contains a center-aligned string. If the string stored in a cell has n < 9 characters,
the rest of it will be filled with spaces; i.e. there will be b9âˆ’n
2
c extra space characters in
the cell before the string and d9âˆ’n
2
e extra space characters in the field after it. However,
if a string with more than 9 characters and odd length is supposed to be placed in a
cell, only its middle 9 characters is stored in the cell. In the case that the length of
original string is even and greater than 9, its middle 8 characters must be stored in the
cell (plus an extra space character).
1
2 Program Input
Assume that user first enters the name and address of a file which he/she wants to convert.
Then, the program gets the name and address of the file in which the user wants to store
the result of format conversion.
3 Program Output
Your program must print out a message showing whether the file conversion is successful.
It also must halt with an e
or message if the file format is not consistent with the filename
extension.
4 Submissions
You need to submit a .zip file compressing the C source file(s) related to the assignment (.c
files) and a readme file specifying which of the following conversions are supported by you
program:
from/to csv tl5 tr9 tc9
csv Y/N Y/N Y/N Y/N
tl5 Y/N Y/N Y/N Y/N
tr9 Y/N Y/N Y/N Y/N
tc9 Y/N Y/N Y/N Y/N
2
Answered Same Day Jul 22, 2021

## Solution

Arun Shankar answered on Jul 25 2021
#include #include #include * A helper function to extract the
extension from the filename *
char* extract_extension(char* filename)
{
char* word = (char*)(malloc(sizeof(char)*3));
strcpy(word,filename+strlen(filename)-3);
word[3] = '\0';
return word;
}
* Helper function to find the length of a
word *
int length(char word[100])
{
int len = 0;
for(;word[len]!='\0';len++);
return len;
}
* Helper function to pad a string with char c to a total of make the entire string num long *
void pad(char word[100], int len, char c)
{
int l = length(word);
if(l==len)
do nothing
return;
word[len] = '\0';
if(l>len)
return;
for(int i=l;i word[i]= ' ';
}
{
int i=0;
for(;word[i]==' ';i++);

if(i>0)
{
int j;
for(j=0;j word[j] = word[i+j];
word[j] = '\0';
}
}
void remove_trailing_spaces(char word[100])
{
int j = 0,i;
for(i = strlen(word)-1;word[i]==' ';--i);
word[i+1] = '\0';
}
void process_tl5(char* word)
{
}
void process_tr9(char word[100])
{
remove_trailing_spaces(word);
int l = length(word);

if(l==9)
nothing to do
return;
else if(l<9)
pad with spaces to the left
{
int i,j = 9-l;
for(i=0,j=8;j>=9-l;j--,i++)
word[j] = word[l-1-i];
for(int i=0;i<9-l;i++)
word[i] = ' ';
}
else
for(int...
SOLUTION.PDF