The answer is a) It improves upon the two-phased commit by requiring that locks be acquired at the start of a transaction.
Reason: The 3PC is an extension or you can say developed from 2PC that avoids blocking of an operation. It just ensures that first n sites have intended to commit a transaction that means it acquires commits or locks before the start of any transaction to avoid any blocking.
Option b) is wrong as it does not allow coordination, it just let all the other sites do their transaction if any other site is blocked, so no coordination is there between sites that they will wait till their coordinator is corrected.
Option c) is wrong as lock operations are shared between other connections as when their coordinator fails, the new coordinator agrees to the old coordinator that they had shared locks before and they can start their transaction.
Option d) is wrong as option a) is correct.
If you like the answer, please upvote.
Answer:
import java.util.Scanner;
public class TestClock {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
System.out.println("Enter two integer numbers");
int num1 = in.nextInt();
int num2 = in.nextInt();
int newSum=num1+10;
System.out.println("The first number is "+num1);
do{
System.out.println(newSum);
newSum +=10;
}while (newSum <=num2);
}
}
Explanation:
Using Java Programming language
- Prompt user for the two inputs and save them as num1 and num2(Using the scanner class)
- Create a new Variable newSum = num1+10
- Create a do...while loop to continually print the value of newSum, and increment it by 10 while it is less or equal to num2
Answer:
#include <iostream>
using namespace std;
void swap(int *a,int *b){ //function to interchange values of 2 variables
int temp=*a;
*a=*b;
*b=temp;
}
void sort(int queue[],int n)
{
int i,j;
for(i=0;i<n;i++) //to implement bubble sort
{
for(j=0;j<n-i-1;j++)
{
if(queue[j]>queue[j+1])
swap(queue[j],queue[j+1]); //to swap values of these 2 variables
}
}
}
int main()
{
int queue[]={6,4,2,9,5,1};
int n=sizeof(queue)/4; //to find length of array
sort(queue,n);
for(int i=0;i<n;i++)
cout<<queue[i]<<" ";
return 0;
}
OUTPUT :
1 2 4 5 6 9
Explanation:
In the above code, Queue is implemented using an array and then passed to a function sort, so that the queue can be sorted in ascending order. In the sort function, in each pass 2 adjacent values are compared and if lower index value is greater than the higher one they are swapped using a swap function that is created to interchange the values of 2 variables.
