The program below simulates tossing a fair coin N times. The program computes the longest sequence of consecutive heads. Or it should compute the longest sequence of consecutive heads. It does not compute the longest sequence of consecutive because one statement is missing and one statement is in the wrong place in the program. Supply the missing statement and move the out of place statement to the right position in the program. If you toss the coin a hundred times the longest sequence of consecutive heads is usually 5 or 6.   #include #include #include #include using namespace std; int main() {     const int HEADS = 0;     const int TAILS = 1;     int seed = (int)time(nullptr);     default_random_engine e(seed);     uniform_int_distribution u(HEADS, TAILS);     int prevCoin = -1;     int N = 100;     int maxlength = 0;     int length = 0;     for (int n = 1; n <= N; ++n)     {         if (coin == HEADS)         {             if (prevCoin == coin)                 length++;             else                 length = 1;         }         else         {             if (length > maxlength)                 maxlength = length;             prevCoin = coin;         }     }     if (length > maxlength)         maxlength = length;     cout << "Maxlength = " << maxlength << endl; }

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
icon
Concept explainers
Question

The program below simulates tossing a fair coin N times. The program computes the longest sequence of consecutive heads. Or it should compute the longest sequence of consecutive heads. It does not compute the longest sequence of consecutive because one statement is missing and one statement is in the wrong place in the program. Supply the missing statement and move the out of place statement to the right position in the program.

If you toss the coin a hundred times the longest sequence of consecutive heads is usually 5 or 6.

 

#include <ctime>
#include <iostream>
#include <random>
#include <string>
using namespace std;

int main()
{
    const int HEADS = 0;
    const int TAILS = 1;
    int seed = (int)time(nullptr);
    default_random_engine e(seed);
    uniform_int_distribution<int> u(HEADS, TAILS);
    int prevCoin = -1;
    int N = 100;
    int maxlength = 0;
    int length = 0;
    for (int n = 1; n <= N; ++n)
    {
        if (coin == HEADS)
        {
            if (prevCoin == coin)
                length++;
            else
                length = 1;
        }
        else
        {
            if (length > maxlength)
                maxlength = length;
            prevCoin = coin;
        }
    }
    if (length > maxlength)
        maxlength = length;

    cout << "Maxlength = " << maxlength << endl;


}

 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Knowledge Booster
Operators
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education