Answer:
The solution code is written in Python 3
- count = 0
- sum = 0
-
- num = input("Enter a number: ")
-
- while(num != ''):
- sum += float(num)
- count += 1
- num = input("Enter a number: ")
-
- print("Sum : " + str(sum))
- print("Average: " + str(sum / count))
Explanation:
Firstly, we declare two variables count and sum to hold the number of input number and the total of the input number, respectively (Line 1-2)
Next, we prompt user to input the first number (Line 4). While the num is not ' ' (This means it is not "Enter" key), accumulate the num to sum variable and increment count by one (Line 6-8) and then prompt the user to input the next number (Line 9).
At the end, display the sum and average using print function (Line 11 -12).
Answer:
The following code is written in java programming language:
//set if statement
if (((modelYear >= 1999) && (modelYear <= 2002) && (modelName == "Extravagant")) || ((modelYear >= 2004) && (modelYear <= 2007) && (modelName == "Guzzler")))
{
recalled = true; //initialized Boolean value
}
else //set else statement
{
recalled = false; ////initialized Boolean value
}
Explanation:
Here, we set the if statement and set condition, if the value of modelYear is greater than equal to 1999 and less that equal to 2002 and modelName is equal to "Extravagant" or the value of modelYear is greater than equal to 2004 and less than equal to 2007 and the model year is equal to "Guzzler", than "recalled" initialized to "true".
Otherwise "recalled" initialized to "true".
Answer:
See explanation below
Explanation:
Previos concepts
First Come First Serve (FCFS) "is an operating system scheduling algorithm that automatically executes queued requests and processes in order of their arrival".
Shortest job next (SJN), or the shortest job first (SJF) or shortest "is a scheduling policy that selects for execution the waiting process with the smallest execution time".
Shortest remaining time (SRF) "is a scheduling method that is a preemptive version of shortest job next scheduling'".
Round robin (RR) is an algorithm where the time parts "are assigned to each process in equal portions and in circular order, handling all processes without priority"
Solution for the problem
Assuming the dataset given on the plot attached.
Part a
For this algorithm the result would be:
Job A 0-6
Job B 6-(6+3) = 6-9
Job C 9-(9+1) = 9-10
Job D 10-(10+4) = 10-14
Part b
For this algorithm the result would be:
Job A 0-6
Job C 6-(6+1) = 6-7
Job B 7-(7+3) = 7-10
Job D 10-(10+4) = 10-14
Part c
For this algorithm the result would be:
Job A 0-1 until 14
Job B 2-(2+3) = 2-5
Job C 3-(3+2) = 3-5
Job D 9-(9+5) = 9-14
Part d
For this algorithm the result would be:
Job A 0-2 , 7-9, 12-14
Job B 2-4, 9-10
Job C 4-(4+1) = 4-5
Job D 5-7, 10-12
There’s 3 main ones accelerometer, gyroscope, and magnetometer.
Answer:
The program to this question as follows:
Program:
quote="You can always edit a bad page. You can’t edit a blank page."
name="Jodi Picoult"
print("Quote:\n",quote)
print ('\t\t\t\t\t\t\t',"Author name-", name)
Output:
Quote:
You can always edit a bad page. You can’t edit a blank page.
Author name- Jodi Picoult
Explanation:
In the above python code, two variable "quote and name" is defined, in which variable both variable holds some string value.
- In the next line, the print function is defined, that first print "Quote" as a message, and for line breaking "\n" is used, then print quote variable value.
- In the last step, first, we use "\t" for line spacing then message "Author name-", and then name variable value.
