Janice can actually used both knowledge as an advantage. She can use her background in farming while learning more about medicine. In such a way, she can have a strong advantage in medicinal farming - like learn ways to create good and effective drugs from plants, etc.
Answer:
The method in python is as follows:
class myClass:
def printRange(min,max):
for i in range(min, max+1):
print("{"+str(i)+"} ", end = '')
Explanation:
This line declares the class
class myClass:
This line defines the method
def printRange(min,max):
This line iterates from min to max
for i in range(min, max+1):
This line prints the output in its required format
print("{"+str(i)+"} ", end = '')
Answer:
Explanation:
Farmers are always both directly and indirectly connected to each other
Their network is mostly strong
Networks become weak only on the edges (ends) of the river but doesn't completely dimnish
With the available network length, the center of river bank forms the strongest network of all and becomes a key player in defining the balance property of overall network
The network is very well structurally balanced and we can see that through the below image
20 miles 10 20 30 40 50
See attachment file for diagram
Considering the total length of river as 50miles and and the center of the whole length will be at 25th mile. From that point, if we consider a farmer will be be having friends for a length of 20miles both along upstream and downstream.
By this he'll be in friend with people who are around 80% of the total population. As me move from this point the integrity increases and this results in a highly balanced structural network.
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.
