#include #include using namespace std; int main () const int arraysize = 13; int counter [13], sum-0; for (int i-0; i<13; i++) counter [i] - 0; int diel; int die2; 0; roll1 <= 36000; roll1++ ) ( for (int roll1 diel = 1 + rand () % 6; die2 = 1 + rand () % 6; counter [diel+die2]++; cout<< "sum of faces"<
#include #include using namespace std; int main () const int arraysize = 13; int counter [13], sum-0; for (int i-0; i<13; i++) counter [i] - 0; int diel; int die2; 0; roll1 <= 36000; roll1++ ) ( for (int roll1 diel = 1 + rand () % 6; die2 = 1 + rand () % 6; counter [diel+die2]++; cout<< "sum of faces"<
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
100%
Base on the C++ code below, create the mean, median and mode functions for the program. Please submit screenshot of successful output
![#include <iostream>
#include <iomanip>
using namespace std;
int main ()
{
const int arraysize = 13;
int counter[13], sum=0;
for (int i=0; i<13; i++)
counter [i] = 0;
int diel;
int die2;
for (int roll1 = 0; roll1 <= 36000; roll1++ ) {
diel = 1 + rand () % 6;
die2 = 1 + rand () % 6;
counter [diel+die2]++;
cout<< "sum of faces"<<setw(13) <<"Frequency"<<endl;
for (int face=2; face<arraysize;face++)
{
cout<<setw (7) <<face<<setw (13)<<counter[face]<<endl;
sum+= counter[face];
cout << "sum:
<< sum;
return 0;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fba13667f-f60c-45eb-87f2-7662478f2e6d%2F64610dfb-b1a4-481a-8bfe-512cddf7ecb0%2Fxsag89_processed.jpeg&w=3840&q=75)
Transcribed Image Text:#include <iostream>
#include <iomanip>
using namespace std;
int main ()
{
const int arraysize = 13;
int counter[13], sum=0;
for (int i=0; i<13; i++)
counter [i] = 0;
int diel;
int die2;
for (int roll1 = 0; roll1 <= 36000; roll1++ ) {
diel = 1 + rand () % 6;
die2 = 1 + rand () % 6;
counter [diel+die2]++;
cout<< "sum of faces"<<setw(13) <<"Frequency"<<endl;
for (int face=2; face<arraysize;face++)
{
cout<<setw (7) <<face<<setw (13)<<counter[face]<<endl;
sum+= counter[face];
cout << "sum:
<< sum;
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 4 steps with 3 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