Question

For this exam review lab exercise, you will develop a program that fixes faulty data in a one-dimensional array of integers. Faulty data is represented by a value of 9999, and should be replaced by the average of the two neighboring elements, where integer casting should be applied to non-integer averages (to keep the data stored as integers). If the first or last element is faulty, it should be replaced by the value of its only neighboring element. If two adjacent neighboring elements are faulty anywhere in the array, a message should be printed to screen stating that the data cannot be fixed. The programming tasks have been segmented into levels. It is strongly recommended that you complete all lower level tasks before moving on to a higher level.

A code template has been provided for you that reads in data from the user and prints out the inputted data to screen. DO NOT MODIFY THE TEMPLATE CODE, INSTEAD ONLY ADD FUNCTIONALITY FOR THE LEVEL 1-3 TASKS AS DESCRIBED BELOW.

Programming Tasks

Level 0 Tasks

(50 points)

• Simply ensure you submit a code that compiles and runs without any errors and that the functionality of the code template has not been modified. Beyond that, you don't need to do anything else to earn these points. (To be clear, submit the template right now, and you should get at least 50 points.)

Level 1 Tasks

(25 points)

• Write the checkData() function, which takes in as parameters an integer data array, the array size, and another integer badValue. The function should return true if there are no elements in the array that contain badValue. The function should return false if the array stores badValue at any element in the array.
• Call checkData() from main() to check for faulty data in the array temps. Depending on the result, print to screen either

No Faulty Data!

OR

Fixing Faulty Data...

• Write the fixData() function, which has the same parameters as checkData(). The function should fix the data by replacing all elements that are badValue with the average of the two neighboring elements. For Level 1, you can assume that the first and last elements do not contain badValue and that no two consecutive elements contain badValue. The function should return the number of elements that originally stored badValue but have now been fixed.
• Call fixData() from main() to fix the data in temps and print the updated array to screen using the provided printData() function.

Level 2 Tasks

(15 points)

• Update fixData() for cases where badValue is stored in the first or last element. In these cases, replace the the faulty data with the only neighboring element. For Level 2, you can still assume that no two consecutive elements contain badValue.

Level 3 Tasks

(10 points )

• Update fixData() for cases where badValue is stored in two consecutive elements. In these cases, return -1 to main(), where you the following message should be printed to screen (and then the program immediately terminates):

Adjacent elements are faulty. Data cannot be fixed!

• For this final (Level 3+) task, print an asterisk (i.e. * ) underneath the elements of the fixed array (printed to screen in the last Level 1 Task) for all elements that originally were faulty, but have now been updated using the neighboring elements. You need to be careful with formatting here: the asterisk should go directly under the highest digit of the number.

Sample Output

Here are some sample outputs for your reference:

A code that achieves Level 1 Tasks:

Input:

12
2
9999
17
9999
-2
22
9999
4
11
9999
8
6

Output:

Enter size of data:
Enter data: 
Inputted data: 
2    9999 17   9999 -2   22   9999 4    11   9999 8    6    
Fixing Faulty Data...
Fixed Data: 
2    9    17   7    -2   22   13   4    11   9    8    6    

A code that achieves Level 2 Tasks:

Input:

11
9999
17
9999
-2
22
9999
4
11
9999
8
6

Output:

Enter size of data:
Enter data: 
Inputted data: 
9999 17   9999 -2   22   9999 4    11   9999 8    6    
Fixing Faulty Data...
Fixed Data: 
17   17   7    -2   22   13   4    11   9    8    6    

A code that achieves Level 3 Tasks:

Input:

10
9999
9999
-2
22
9999
4
11
9999
8
6

Output:

Enter size of data:
Enter data: 
Inputted data: 
9999 9999 -2   22   9999 4    11   9999 8    6    
Fixing Faulty Data...
Adjacent elements are faulty. Data cannot be fixed!

A code that achieves Level 3+ Tasks:

Input:

10
9999
-2
22
9999
4
11
8
9999
7
9999

Output:

Enter size of data:
Enter data: 
Inputted data: 
9999 -2   22   9999 4    11   8    9999 7    9999 
Fixing Faulty Data...
Fixed Data: 
-2   -2   22   13   4    11   8    7    7    7    
*              *                   *         * 

Here is the template:

#include <stdio.h>
#include <stdbool.h>

//readData() function provided to read in data from user input (DO NOT REMOVE or MODIFY)
void readData(int data[], int size) {
for (int i=0; i<size; ++i) {
scanf("%d",&data[i]);
}
}

//printData() function provided to print integer data array,
// reseving 4 spots for each int and a space in between (DO NOT REMOVE or MODIFY)
void printData(int data[], int size) {
for (int i=0; i<size; ++i) {
printf("%-4d ",data[i]);
}
printf("\n");
}

//LEVEL 1
bool checkData(int data[], int size, int badValue){
int i;
for(i=0;i<size;i++)
{
if(data[i] == badValue)
{
return false;
}
}
return true;
}

//developed for LEVEL 1, and extended in LEVELS 2 and 3
int fixData(int data[], int size, int badValue){
int i;
char ast[size];
for(i=0;i<size;i++)
ast[i]=' ';
for(i=0;i<size;i++)
{
if(data[0]==badValue && data[1]!=badValue)
{
data[0]=data[1];
ast[0]='*';
}
else if(data[size-1]==badValue && data[size-2] != badValue)
{
data[size-1]=data[size-2];
ast[size-1]='*';
}
else if(data[i]==badValue && data[i+1]==badValue)
return -1;
else
if(data[i]==badValue)
{
data[i]=(data[i-1]+data[i+1])/2;
ast[i]='*';
}
}
printData(data,size,ast);
return 0;
}

int main() {
  
//start of provided code to read in data and print it
int n;
int temps[100];
  
printf("Enter size of data: ");
scanf("%d",&n);
printf("\nEnter data: ");
readData(temps,n);
  
printf("\nInputted data: \n");
printData(temps,n);
//end of provided code to read in data and print it
  
//DEVELOP YOUR main() CODE HERE

return 0;
}

Answer 1

If you have any doubts, please give me comment...

#include <stdio.h>

#include <stdbool.h>

//readData() function provided to read in data from user input (DO NOT REMOVE or MODIFY)

void readData(int data[], int size) {

for (int i=0; i<size; ++i) {

scanf("%d",&data[i]);

}

}

//printData() function provided to print integer data array,

// reseving 4 spots for each int and a space in between (DO NOT REMOVE or MODIFY)

void printData(int data[], int size) {

for (int i=0; i<size; ++i) {

printf("%-4d ",data[i]);

}

printf("\n");

}

void printAst(char ast[], int size){

for (int i=0; i<size; ++i) {

printf("%-4c ",ast[i]);

}

printf("\n");

}

//LEVEL 1

bool checkData(int data[], int size, int badValue){

int i;

for(i=0;i<size;i++)

{

if(data[i] == badValue)

{

return false;

}

}

return true;

}

//developed for LEVEL 1, and extended in LEVELS 2 and 3

int fixData(int data[], int size, int badValue){

int i;

char ast[size];

for(i=0;i<size;i++)

ast[i]=' ';

for(i=0;i<size;i++)

{

if(data[0]==badValue && data[1]!=badValue)

{

data[0]=data[1];

ast[0]='*';

}

else if(data[size-1]==badValue && data[size-2] != badValue)

{

data[size-1]=data[size-2];

ast[size-1]='*';

}

else if(data[i]==badValue && data[i+1]==badValue)

return -1;

else

if(data[i]==badValue)

{

data[i]=(data[i-1]+data[i+1])/2;

ast[i]='*';

}

}

printf("Fix Data:\n");

printData(data,size);

printAst(ast, size);

return 0;

}

int main() {

//start of provided code to read in data and print it

int n;

int temps[100];

printf("Enter size of data: ");

scanf("%d",&n);

printf("\nEnter data: ");

readData(temps,n);

printf("\nInputted data: \n");

printData(temps,n);

//end of provided code to read in data and print it

if(!checkData(temps, n, 9999)){

printf("Fixing Faulty Data...\n");

if(fixData(temps, n, 9999)==-1)

printf("Adjacent elements are faulty. Data cannot be fixed!\n");

}

//DEVELOP YOUR main() CODE HERE

return 0;

}