Answer:
Great!
Explanation:
I use mobile phone and i use it as exmergency phone
Answer:
Be polite and open to ideas
Explanation:
Before going make a list of things you need to know for sure. You could also provide some samples. Make sure you take many notes on what they want! Speak with your client and ask them how and when they want to be updated on progress, some might want to know once a week others may want to receive a progress report every day. Communication is always key and will always help you provide good service.
Hopefully, this helps!
Answer:
A domestic air carrier airplane lands at an intermediate airport at 1815Z. The latest time it may depart without a specific authorization from an aircraft dispatcher is <u>1915Z (1 hour)</u>.
Explanation:
Under the domestic operations, an airplane landed on intermediate airport can remain their for not more than one hour so the time would me 1 hour.
Here the time represented by 1815Z and 1915Z is in Zulu Time Zone as depicted from letter "Z". The first two digits represent the hour (0-24) and the next two represent the minutes (0-59).
- Here the landing time is 6:15 pm while departing time is after one hour that is 7:15 pm (1915Z).
i hope it will help you.
I believe this is Insert Controls
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