Answer and explanation :
the three control problems associated with competing process are
- MUTUAL EXCLUSION : We know that some resources are shareable and some are not shareable. which means only one process can access the resource at a time this type of resources are called critical resources this code can be access at only one process at a time. the other process if required to access should not be allowed
- DEADLOCK: this hold the process without complete for example suppose there are two resources R1 and R2 and two process P1 and P2 and P1 use R1 and P2 use R2 but after some time when P1 needs R2 but R2 is not available as it is used by P2 so the all process will be on hold
- STARVATION : when priorities are given to the process as high priorities and low priorities. And high priorities process always competing then low priorities process have to wait for very long time this is called starvation
Answer:
Explanation:
Data security is the process of protecting your most critical business assets (your data) against unauthorized or unwanted use.
This not only involves deploying the right data security products, but also combining people and processes with the technology you choose to protect data throughout its lifecycle. Enterprise data protection is a team sport.
Best practices for effective data security include taking a risk-based approach to protecting data, using a unified platform that integrates data security information across your entire enterprise and ensuring scalability across environments of any size across public cloud, on-premises and hybrid cloud deployments.
Explanation:
The program that merges two lists or two arrays is written below;
Code :
void main void
{
char [] arr1= {'1','2','3'};
char [] arr2= {'a','b','c','d','e'};
int l1= arr1.length;
int l2=arr2.length;
int l3=l1+l2;
char [] arr3=new char[l1+l2];
int i=0;
int j=0;
int k=0;
int m=0;
int r=0;
if(l1<l2)
r=l1;
else
r=l2;
while(m<r)
{
arr3[k++]=arr1[i++];
arr3[k++]=arr2[j++];
m++;
}
while(k<l3)
{
if(l1<l2)
arr3[k++]=arr2[j++];
else
arr3[k++]=arr1[i++];
}
for(int n=0;n<l3;n++)
{
System.out.print(arr3[n]+" ");
}
}
Answer:
I the domain already purchased?
Explanation:
