Answer:
I would say that if she is connected to the server and has grained access to the server, Wendy would have to use the command shortkey win+r (to run) or she could just use the "Type here to search" function.
Then you can type the words "cmd" to bring up the command prompt
Lastly, she would need to use the protocol scp to transfer files. Wendy might need to include a destination for the files to be directed to.
Answer:
The question given is incomplete as it does not contains the image. I have found the image of the question and it is attached below.
The solution of the question is also attached below in the image.
I hope it will help you!
Explanation:
<u>Answer:</u>
I am writing <em>partial code in</em> <em>c++ to calculate weighted average</em>. The weighted average should be calculated based on multiplying the test score and its <em>respective weight and finally add all the test score.</em>
<u>Explanation:</u>
<em>int arrtestscore[100];</em>
<em>int arrweight[100];</em>
<em>int n;</em>
<em>double weightedavg;</em>
<em>cout<<”Enter the number of test score for which weighted average needs to be calculated”;</em>
<em>cin>>n;</em>
<em>for(int x = 0; x <n;x++)</em>
<em>{</em>
<em> cout<<”Enter test score :” + (x+1) ;</em>
<em> cin>>arrtestscore[x];</em>
<em> count<<”Enter the respective weight:”;</em>
<em> cin>>arrweight[x];</em>
<em>}</em>
<em>for (int i=0; i<n;i++)</em>
<em>{</em>
<em> weightedavg = weightedavg + (arrtestscore[i] * arrweight[i])</em>
<em>}</em>
<em>cout<<”weighted average = “ <<weightedavg; </em>
Answer:
B. The process will be terminated by the operating system.
Explanation:
When Round Robin is used for CPU scheduling, a time scheduler which is a component of the operating system is used in regulating the operation. A time limit is set for each of the processes to be run.
So, when a process fails to complete running before its time elapses, the time scheduler would log it off and return it to the queue. This queue is in a circular form and gives each of the processes a chance to run its course.
Answer:
The minimum number of bits necessary to address 8K words is 13.
Explanation:
You have the number of words to address that is 8000 words, a word is the smallest addressable memory unit.
8000 words can be addressed with
units. Now you have to find the value of n that approximates to the number of words.
So you can see that 13 bits are needed to address 8K words.