Answer:
(a) someFunc(3) will be called 4 times.
(b) For non negative number n someFunc method calculates 2^2^n.
Explanation:
When you call someFunc(5) it will call someFunc(4) two time.
So now we have two someFunc(4) now each someFunc(4) will call someFunc(3) two times.Hence the call to someFun(3) is 4 times.
someFunc(n) calculates someFunc(n-1) two times and calculates it's product.
someFunc(n) = someFunc(n-1)^2..........(1)
someFunc(n-1)=someFunc(n-2)^2..........(2)
substituting the value form eq2 to eq 1.
someFunc(n)=someFunc(n-2)^2^2
.
.
.
.
= someFunc(n-n)^2^n.
=2^2^n
2 raised to the power 2 raised to the power n.
Answer:
On-site food services is the INDEPENDENT variable and the weight gain is the DEPENDENT variable
Explanation:
Variables can be dependent or independent. An independent variable is the one used by the researcher to test its degree of influence on the dependent variable. The dependent variable, as the name implies, relies on changes in the independent variable to effect its own changes.
In the question, it is obvious that weight gain among the first year students is dependent on on-site food services
Answer:
#include<stdio.h>
//declare a named constant
#define MAX 50
int main()
{
//declare the array
int a[MAX],i;
//for loop to access the elements from user
for(i=0;i<MAX;i++)
{
printf("\n Enter a number to a[%d]",i+1);
scanf("%d",&a[i]);
}
//display the input elements
printf("\n The array elements are :");
for(i=0;i<=MAX;i++)
printf(" %d ",a[i]);
}
Explanation:
PSEUDOCODE INPUTARRAY(A[MAX])
REPEAT FOR I EQUALS TO 1 TO MAX
PRINT “Enter a number to A[I]”
READ A[I]
[END OF LOOP]
REPEAT FOR I EQUALS TO 1 TO MAX
PRINT A[I]
[END OF LOOP]
RETURN
ALGORITHM
ALGORITHM PRINTARRAY(A[MAX])
REPEAT FOR I<=1 TO MAX
PRINT “Enter a number”
INPUT A[I]
[END OF LOOP]
REPEAT FOR I<=1 TO MAX
PRINT A[I]
[END OF LOOP]
<span>Microsoft Excel is a spreadsheet developed by Microsoft for Windows, Mac OS X, Android and iOS.</span>
Based on the information given, it is important to give higher priority to the queue that contains the high priority thread.
<h3>
</h3><h3>
What is the Important Fact?</h3>
- A lot of interrupts can take place at any time, and due to that, they cannot always be ignored as the part of code affected by interrupts need to be guarded from constant use.
- So, the load-balancing requirements for keeping about the same number of threads would need to be taken or retained and the important case of top priority thread would also be kept.
- An priority-based scheduling algorithm can handle this situation if one run queue had all high-priority threads and a second queue had all low-priority threads because if giving greater priority to the two queue that has the national priority comment section as well as, so, first method is the thread in all of the queue.
- Multi-level queue scheduling algorithm is used in scenarios where the processes can be classified into groups based on property like process type, CPU time, IO access, memory size, etc. One general classification of the processes is foreground processes and background processes.
To learn more about multi-level refer to:
brainly.com/question/16902508
#SPJ4
