EBK C++ FOR ENGINEERS AND SCIENTISTS
EBK C++ FOR ENGINEERS AND SCIENTISTS
4th Edition
ISBN: 8220100444968
Author: Bronson
Publisher: YUZU
bartleby

Videos

Textbook Question
Book Icon
Chapter 5, Problem 1PP

(Probability) The probability that a phone call will last less than t minutes can be pproximated by the exponential probability function:

Probability that a call lasts less than t m i n u t e s   =   1     e   t / a

a   i s   t h e   a v e r a g e   c a l l   l e n g t h . e   i s   E u l e r s   n u m b e r   ( 2.71828 ) .

For example, assuming the average call length is 2 minutes, the probability that a call will last

less than 1 minute is calculated as 1     e 1 / 2   =   0.3297. Using this probability equation, write a

C++ program that calculates and displays a list of probabilities of a call lasting less than 1 minute to less than 10 minutes, in 1-minute increments.

Expert Solution & Answer
Check Mark
Program Plan Intro

Program plan:

  • Include the header files and using the namespace for standard I/O.
  • Define the main function.
  • Declare the variables x and z of integer type and y of double data type.
  • Declare the essential variables.
  • Use the loop to iterate.
  • Calculate the probability that the call last less than t minutes.
  • Display the list of probabilities in tabular format

Program description:

The main purpose of the program is to calculate theprobability of that a call will last less than one minute. This is calculated by the below formula: -

  p=1etaeistheEuler'snumber(2.71828)aistheaveragecalllengthtistheminutes

Explanation of Solution

Program:

//Importing the essential headers
#include <iostream>
#include <iomanip>
#include <math.h>
//Using the namespace for standard I/O
usingnamespacestd;
//Defining the main function
intmain()
{
//Declaring the essential variables 
double p;//to store the Probability
double e =2.71828;//to store the Euler’s number
int a=2;//to store the average call length
cout<<"Call Time\tProbability\n";
//Using the loop to iterate 
for(int t =1; t <10; t++)
{
//Calculating the probability that the call last less than t minutes
        p =1-pow(e,(-1*t)/(a));
//Displaying the list of probabilities in tabular format 
cout<<setprecision(0)<< fixed << t <<"\t\t"<<setprecision(4)<< p <<endl;
}
}

Sample output:

EBK C++ FOR ENGINEERS AND SCIENTISTS, Chapter 5, Problem 1PP

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
1] Minimize the following boolean function- F(W, X, Y, Z) = Σm(1, 3, 4, 6, 9, 11, 12, 14) 2] This function is independent ________ number of variables. Fill in the blank.
12. Simplify the following Boolean function F, together with the don’t-care conditions d :
Prove the following functions by using the Boolean laws? xy + x’z + yz = xy + x’z

Chapter 5 Solutions

EBK C++ FOR ENGINEERS AND SCIENTISTS

Knowledge Booster
Background pattern image
Computer Science
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
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Boolean Algebra - Digital Logic and Logic Families - Industrial Electronics; Author: Ekeeda;https://www.youtube.com/watch?v=u7XnJos-_Hs;License: Standard YouTube License, CC-BY
Boolean Algebra 1 – The Laws of Boolean Algebra; Author: Computer Science;https://www.youtube.com/watch?v=EPJf4owqwdA;License: Standard Youtube License