Answer:
numInsects = 16
while numInsects < 200:
print(str(numInsects) + " ", end="")
numInsects *= 2
Explanation:
*The code is in Python.
Set the numInsects as 16
Create a while loop that iterates while numInsects is smaller than 200. Inside the loop, print the value of numInsects followed by a space. Then, multiply the numInsects by 2.
Answer:
Written in Java
public static void printArray(int myarr[], String s){
for(int i = 0; i<myarr.length;i++){
System.out.print(myarr[i]+s);
}
}
Explanation:
This defines the static method alongside the array and the string variable
public static void printArray(int myarr[], String s){
The following iteration iterates through the elements of the array
for(int i = 0; i<myarr.length;i++){
This line prints each element of the array followed by the string literal
System.out.print(myarr[i]+s);
}
}
The method can be called from main using:
<em>printArray(myarr,s);</em>
Where myarr and s are local variables of the main
The parts of the presentation that he should design first is Slide master
Slide master is a slide that enables you to do the following:
•Modify your presentation to suit your taste
•It enables you to make a partial or minor change on the slide layout of your presentation
•Slide master help you to create a perfect and special presentation.
•With Slide master you can easily modify your slide text color.
Inconclusion The parts of the presentation that he should design first is Slide master.
Learn more about Slide master here:
brainly.com/question/12600334
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.
