Answer:
Low sampling rate and low bit depth are the right options.
Explanation:
The low sampling rate and low bit depth can ensure less memory consumption. The musician here wants to record some initial ideas for some new song. And she is not concerned about the quality of the audio file she is going to send. And she wishes to send the size of the file that is as small as possible so that it can be quite easily downloaded by her bandmate. She can thus afford a low sampling rate and low bit depth, as the quality is not that important. And a low sampling rate and low bit depth can ensure less memory. Hence, these are the correct options here.
i think its firewall. Because the firewall can block protocols are are not allowed by an administrator. especially over a remote connection
Answer:
18, 13, 19
Explanation:
Number of computer programmers proficient only in Java = 45 - ( 1+1+6) = 37
Number of computer programmers proficient only in C++ = 30 - (6+1+5) = 18
Number of computer programmers proficient only in python = 20 - ( 1+1+5) = 13
Number of computer programmers are not proficient in any of these three languages = 100 - ( 37 + 18 + 13 + 1+ 1+ 5+ 6 ) = 100 - 81 = 19
Answer:
b) Bounded Waiting
Explanation:
int currentThread = 1;
bool thread1Access = true;
bool thread2Access = true;
thread1 { thread2 {
While (true) {
While (true)
{
while(thread2Access == true)
{
while(thread1Access == true)
{
If (currentThread == 2) {
If (currentThread == 1)
{
thread1Access = false; thread2Access = false;
While (currentThread == 2);
While (currentThread == 1);
thread1Access = true; thread2Access = true;
} }
/* start of critical section */ /* start of critical section */
currentThread = 2 currentThread = 1
… ...
/* end of critical section */ /* end of critical section */
thread1Access = false; thread2Access = false;
… ...
} }
} }
} }
It can be seen that in all the instances, both threads are programmed to share same resource at the same time, and hence this is the bounded waiting. For Mutual exclusion, two threads cannot share one resource at one time. They must share simultaneously. Also there should be no deadlock. For Progress each thread should have exclusive access to all the resources. Thus its definitely the not the Progress. And hence its Bounded waiting.