#include #include int main) // Array declaration int ARRSIZE = 6; int MARKJARRSIZEJ, INDX, SMALLEST, BIGGEST; float TOT = 0.0, AVG, VARIAN, TNUM_M AVG_P2 = 0.0, STD: // Read an array for (INDX = 0; INDX <= ARRSIZE-1; INDX ++) printf("Please enter a number "): scanf("%d", &MARK[INDX]): // Calculate total numebr for (INDX - 0; INDX <= ARRSIZE-1; INDX ++) тот - тот - МARKINDX // Calculate average AVG = TOT / float (ARRSIZE): // Find smallest and bigest number SMALLEST - MARK[0): BIGGEST - MARK[0]: for (INDX = 1; INDX <= ARRSIZE-1; INDX ++) if (SMALLEST > MARK[INDX]) SMALLEST = MARK[INDX): if (BIGGEST < MARK[INDXI) BIGGEST = MARK[INDX): // Calculate VARIAN and STD for (INDX - 0; INDX <- ARRSIZE-1; INDX ++) TNUM_M AVG_P2 = TNUM_M AVG_P2 + pow(float(MARK[INDX]) - AVG), 2.0); VARIAN = TNUM_MAVG_P2 / float (ARRSIZE-1);: STD = sqrt(VARIAN): // Print number and results for (INDX = 0; INDX <= ARRSIZE-1; INDX ++) printf("\nNumber entered %d", MARK[INDX): printf("\nTotal %, TOT): printf("\nAverge %f", AVG): printf("\nThe smallest %d", SMALLEST): printf("\nThe biggest %d", BIGGEST): printf("\nThe varian %f", VARIAN): printf("\nThe STD %F, STD): return 0;
#include #include int main) // Array declaration int ARRSIZE = 6; int MARKJARRSIZEJ, INDX, SMALLEST, BIGGEST; float TOT = 0.0, AVG, VARIAN, TNUM_M AVG_P2 = 0.0, STD: // Read an array for (INDX = 0; INDX <= ARRSIZE-1; INDX ++) printf("Please enter a number "): scanf("%d", &MARK[INDX]): // Calculate total numebr for (INDX - 0; INDX <= ARRSIZE-1; INDX ++) тот - тот - МARKINDX // Calculate average AVG = TOT / float (ARRSIZE): // Find smallest and bigest number SMALLEST - MARK[0): BIGGEST - MARK[0]: for (INDX = 1; INDX <= ARRSIZE-1; INDX ++) if (SMALLEST > MARK[INDX]) SMALLEST = MARK[INDX): if (BIGGEST < MARK[INDXI) BIGGEST = MARK[INDX): // Calculate VARIAN and STD for (INDX - 0; INDX <- ARRSIZE-1; INDX ++) TNUM_M AVG_P2 = TNUM_M AVG_P2 + pow(float(MARK[INDX]) - AVG), 2.0); VARIAN = TNUM_MAVG_P2 / float (ARRSIZE-1);: STD = sqrt(VARIAN): // Print number and results for (INDX = 0; INDX <= ARRSIZE-1; INDX ++) printf("\nNumber entered %d", MARK[INDX): printf("\nTotal %, TOT): printf("\nAverge %f", AVG): printf("\nThe smallest %d", SMALLEST): printf("\nThe biggest %d", BIGGEST): printf("\nThe varian %f", VARIAN): printf("\nThe STD %F, STD): return 0;
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Give me full code with attached output. Do it in 15 min. I have less time
Thank you
![#include <stdio.h>
#include <math.h>
int main)
{
// Array declaration
int ARRSIZE = 6;
int MARK[ARRSIZEJ, INDX, SMALLEST,
BIGGEST;
float TOT = 0.0, AVG, VARIAN,
T_NUM_M_AVG_P2 = 0.0, STD:
// Read an array
for (INDX = 0; INDX <= ARRSIZE-1; INDX ++)
printf("Please enter a number "):
scanf("%d", &MARK[INDXI):
// Calculate total numebr
for (INDX = 0; INDX <= ARRSIZE-1; INDX ++)
{
TOT = TOT + MARK[INDX):
// Calculate average
AVG = TOT / float (ARRSIZE):
// Find smallest and bigest number
SMALLEST = MARK[0]:
BIGGEST = MARK[0]:
for (INDX = 1; INDX <= ARRSIZE-1; INDX ++)
{
if (SMALLEST > MARK[INDXI) SMALLEST = MARK[INDX]:
if (BIGGEST < MARK[INDX]) BIGGEST = MARK[INDX):
// Calculate VARIAN and STD
for (INDX = 0; INDX <= ARRSIZE-1; INDX ++)
T_NUM_M_AVG_P2 = T_NUM_M_AVG_P2 +
pow((float(MARK[INDX]) - AVG). 2.0):
VARIAN = T_NUM_M_AVG_P2 / float (ARRSIZE-1):
STD = sqrt(VARIAN):
// Print number and results
for (INDX = 0; INDX <= ARRSIZE-1; INDX ++)
{
printf("\nNumber entered %d", MARK[INDX]):
printf("\nTotal %f", TOT):
printf("\nAverge %f", AVG):
printf("\nThe smallest %d", SMALLEST):
printf("\nThe biggest %d", BIGGEST):
printf("\nThe varian %f, VARIAN):
printi("\nThe STD %F, STD):
return 0
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F241833db-d3aa-4ad8-951c-c9cab5acab3c%2F16f9e538-a67a-4f70-815b-6d37c33bc0b5%2Fpk1st6b_processed.png&w=3840&q=75)
Transcribed Image Text:#include <stdio.h>
#include <math.h>
int main)
{
// Array declaration
int ARRSIZE = 6;
int MARK[ARRSIZEJ, INDX, SMALLEST,
BIGGEST;
float TOT = 0.0, AVG, VARIAN,
T_NUM_M_AVG_P2 = 0.0, STD:
// Read an array
for (INDX = 0; INDX <= ARRSIZE-1; INDX ++)
printf("Please enter a number "):
scanf("%d", &MARK[INDXI):
// Calculate total numebr
for (INDX = 0; INDX <= ARRSIZE-1; INDX ++)
{
TOT = TOT + MARK[INDX):
// Calculate average
AVG = TOT / float (ARRSIZE):
// Find smallest and bigest number
SMALLEST = MARK[0]:
BIGGEST = MARK[0]:
for (INDX = 1; INDX <= ARRSIZE-1; INDX ++)
{
if (SMALLEST > MARK[INDXI) SMALLEST = MARK[INDX]:
if (BIGGEST < MARK[INDX]) BIGGEST = MARK[INDX):
// Calculate VARIAN and STD
for (INDX = 0; INDX <= ARRSIZE-1; INDX ++)
T_NUM_M_AVG_P2 = T_NUM_M_AVG_P2 +
pow((float(MARK[INDX]) - AVG). 2.0):
VARIAN = T_NUM_M_AVG_P2 / float (ARRSIZE-1):
STD = sqrt(VARIAN):
// Print number and results
for (INDX = 0; INDX <= ARRSIZE-1; INDX ++)
{
printf("\nNumber entered %d", MARK[INDX]):
printf("\nTotal %f", TOT):
printf("\nAverge %f", AVG):
printf("\nThe smallest %d", SMALLEST):
printf("\nThe biggest %d", BIGGEST):
printf("\nThe varian %f, VARIAN):
printi("\nThe STD %F, STD):
return 0
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY