C++ for Engineers and Scientists
C++ for Engineers and Scientists
4th Edition
ISBN: 9781133187844
Author: Bronson, Gary J.
Publisher: Course Technology Ptr
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:

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
Please no AI! Or if you do use AI, Check the work please! Thank you!
(Dynamic Programming.) Recall the problem presented in Assign- ment 3 where given a list L of n ordered integers you're tasked with removing m of them such that the distance between the closest two remaining integers is maxi- mized. See Assignment 1 for further clarification and examples. As it turns out there is no (known) greedy algorithm to solve this problem. However, there is a dynamic programming solution. Devise a dynamic programming solution which determines the maximum distance between the closest two points after removing m numbers. Note, it doesn't need to return the resulting list itself. Hint 1: Your sub-problems should be of the form S(i, j), where S(i, j) returns the maximum distance of the closest two numbers when only considering removing j of the first i numbers in L. As an example if L [3, 4, 6, 8, 9, 12, 13, 15], then S(4, 1) = 2, since the closest two values of L' = [3,4,6,8] are 6 and 8 after removing 4 (note, 8-6 = = 2). = Hint 2: For the sub-problem S(i, j),…
(Dynamic Programming.) A group of friends is visiting a number of attractions located along a highway, starting at kilometre 0, placed at distances ɑ1 < A2 < ···

Chapter 5 Solutions

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
SEE MORE 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
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
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