CECS 174 Project 3 - Due in lab on Tuesday, 10/21/03
Write a C++ program to generate and count all the bit strings of length 8 that contain 4 consecutive ones,
starting with the prototype program given below.
Program prototype
//////////////////////////////////////////////////////////////
//
//
// Add prolog comments as per Documentation Guidelines
//
//
///////////////////////////////////////////////////////////////
#include <iostream>
#include <string>
using namespace std;
bool has_4ConsOnes( int i ); // finds out if i, 0<=i<255, has 3 consecutive 0s
void printbits(int i);
int main()
{
int count = 0; // count number with 4 consecutive 1s
// Find and output all bit strings of length 8 that contain four
// consecutive ones, using functions has_4ConsOnes and printbits
cout << "\nNumber of bit strings of length 8 with 4 consecutive 1s = "
<< count << endl;
cout << endl;
return 0;
}// end main
bool has_4ConsOnes( int i )
// Describe function
{
// Implement your function
}
void printbits ( int i )
// This function takes an integer i, where 0 <= i < 256, and
// outputs it in the form of an 8-bit string.
// Precondition: Parameter i is an integer with the range of [0, 255]
// Postcondition: The binary representation of I is output
{
string bits[16] = {"0000", "0001", "0010", "0011",
"0100", "0101", "0110", "0111",
"1000", "1001", "1010", "1011",
"1100", "1101", "1110", "1111"};
cout << bits[i/16] << bits[i%16] << " ";
}
…/Continued on the other side.
