Answer:
Explanation:
Disk space is a limited resource on the spooling partition and once it is filled the will cause a deadlock. Every single block that comes into the spooling partition claims a resource, and the one behind that wants resources as well, and so on. Since the spooling space is limited and half of the jobs arrive and fill up space then no more blocks can be stored, causing a deadlock. This can be prevented allowing one job to finish and releasing the space for the next job.
Answer:
A.) True
Explanation:
Inserting a new value in the middle of a singly lnked list requires changing the pinter of the list node that follows the new node.
Answer:
Following is the program in C language :
#include <stdio.h> // header file
#define n 5 // macro
int main() main function
{
int a[n],k1; // variable and array declaration
printf("Enter the element:\n");
for(k1=0;k1<n;++k1) //iterating the loop
{
scanf("%d",&a[k1]);//Read the values by user
}
printf("Output in Reverse Order:\n");
for(k1=n-1;k1>=0;--k1)//iterating the loop
{
printf(" %d ",a[k1]); //Display the values
}
return 0;
}
Output:
Enter the element:
4
3
45
67
89
Output in Reverse Order: 89 67 45 3 4
Explanation:
Following is the description of the program
- Define a macro "n" with value 5 after the header file.
- Declared an array "a" and defined the size of that array by macro i.e "n".
- Read the value by the user by using scanf statement in the array "a"
- Finally In the last for loop display the values of array "a" by space.
Answer:
I wish but just make an administrator account in your settings
Explanation:
