If you are working on a document and want to have Word automatically save the document every minute, what steps should you use t
1 answer:
You might be interested in
Answer:
Here is the C++ program:
#include<iostream> // to use input output functions
using namespace std; //to identify objects like cin cout
void StartChar(string str) { // function that takes a word string as parameter and returns the first letter of that word in capital
int i;
char c;
do //start of do while loop
{
for (int i = 0; i < str.length(); i++) { //iterates through each character of the word str
if(str.length()>25){ //checks if the length of input word is greater than 25
cout<<"limit exceeded"; } //displays this message if a word is more than 25 characters long
c = str.at(i); // returns the character at position i
if (! ( ( c >= 'a' && c <= 'z' ) || ( c >= 'A' && c <= 'Z' ) ) ) { //checks if the input word is contains characters other than the alphabet
cout<<str<<" is not a word!"<<endl; break;} //displays this message if user enters characters other than the alphabet
if (i == 0) { //check the first character of the input word
str[i]=toupper(str[i]); //converts the first character of the input word to uppercase
cout<<str<<" starts with letter "<<str[i]<<endl; } // prints the letter that the word starts with in capital letter
} cout<<"Enter a word: "; //prompts user to enter a word
cin>>str; //reads input word from user
}while(str!="#"); } //keeps prompting user to enter a word until the user enters #
int main() //start of the main() function body
{ string str; //declares a variable to hold a word
cout<<"Enter a word: "; //prompts user to enter a word
cin>>str; //reads input word from user
StartChar(str); } //calls function passing the word to it
Explanation:
The program prompts the user to enter a word and then calls StartChar(str) method by passing the word to the function.
The function StartChar() takes that word string as argument.
do while loop starts. The for loop inside do while loop iterates through each character of the word string.
First if condition checks if the length of the input word is greater than 25 using length() method which returns the length of the str. For example user inputs "aaaaaaaaaaaaaaaaaaaaaaaaaaa". Then the message limit exceeded is printed on the screen if this if condition evaluates to true.
second if condition checks if the user enters anything except the alphabet character to form a word. For example user $500. If this condition evaluates to true then the message $500 is not a word! is printed on the screen.
Third if condition checks if the first character of input word, convert that character to capital using toupper() method and prints the first letter of the str word in capital. For example if input word is "Computer" then this prints the message: Computer starts with the letter C in the output screen.
The program keeps prompting the user to enter the word until the user enters a hash # to end the program.
The output of the program is attached.
Answer:
the average arrival rate \lambda in units of packets/second is 15.24 kbps
the average number of packets w waiting to be serviced in the buffer is 762 bits
Explanation:
Given that:
A single channel with a capacity of 64 kbps.
Average packet waiting time in the buffer = 0.05 second
Average number of packets in residence = 1 packet
Average packet length r = 1000 bits
What are the average arrival rate \lambda in units of packets/second and the average number of packets w waiting to be serviced in the buffer?
The Conservation of Time and Messages ;
E(R) = E(W) + ρ
r = w + ρ
Using Little law ;
r = λ × T_r
w = λ × T_w
r / λ = w / λ + ρ / λ
T_r =T_w + 1 / μ
T_r = T_w +T_s
where ;
ρ = utilisation fraction of time facility
r = mean number of item in the system waiting to be served
w = mean number of packet waiting to be served
λ = mean number of arrival per second
T_r =mean time an item spent in the system
T_w = mean waiting time
μ = traffic intensity
T_s = mean service time for each arrival
the average arrival rate \lambda in units of packets/second; we have the following.
First let's determine the serving time T_s
the serving time T_s
= 0.015625
now; the mean time an item spent in the system T_r = T_w +T_s
where;
T_w = 0.05 (i.e the average packet waiting time)
T_s = 0.015625
T_r = 0.05 + 0.015625
T_r = 0.065625
However; the mean number of arrival per second λ is;
r = λ × T_r
λ = r / T_r
λ = 1000 / 0.065625
λ = 15238.09524 bps
λ ≅ 15.24 kbps
Thus; the average arrival rate \lambda in units of packets/second is 15.24 kbps
b) Determine the average number of packets w waiting to be serviced in the buffer.
mean number of packets w waiting to be served is calculated using the formula
w = λ × T_w
where;
T_w = 0.05
w = 15238.09524 × 0.05
w = 761.904762
w ≅ 762 bits
Thus; the average number of packets w waiting to be serviced in the buffer is 762 bits