Answer:
C++ code given below with appropriate comments
Explanation:
pattern.cpp
#include<iostream>
using namespace std;
void printCross(int n)
{
int i,j,k;
if(n%2) //odd number of lines
{
for(int i=n;i>=1;i--)
{
for(int j=n;j>=1;j--)
{
if(j==i || j==(n-i+1))
cout<<j;
else
cout<<" ";
}
cout<<"\n";
}
}
else //even number of lines
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(j==i || j==(n-i+1))
{
cout<<" "<<j<<" ";
}
else
cout<<" ";
}
cout<<"\n";
}
}
}
void printForwardSlash(int n)
{
if(n%2)
{
for(int i=n;i>=1;i--)
{
for(int j=n;j>=1;j--)
{
if(j==n-i+1)
{
cout<<j;
}
else
cout<<" ";
}
cout<<"\n";
}
}
else
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(j==(n-i+1))
{
cout<<j;
}
else
cout<<" ";
}
cout<<"\n";
}
}
}
void printBackwardSlash(int n)
{
if(n%2) // odd number of lines
{
for(int i=n;i>=1;i--)
{
for(int j=n;j>=1;j--)
{
if(j==i)
{
cout<<j;
}
else
cout<<" ";
}
cout<<"\n";
}
}
else //even number of lines
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(j==i)
{
cout<<j;
}
else
cout<<" ";
}
cout<<"\n";
}
}
}
int main()
{
int num;
char ch;
cout<<"Create a numberes shape that can be sized."<<endl;
cout<<"Input an integer [1,50] and a character [x,b,f]."<<endl;
cin>>num>>ch;
if(ch=='x' || ch=='X')
printCross(num);
else if(ch=='f' || ch=='F')
printForwardSlash(num);
else if(ch=='b' || ch=='B')
printBackwardSlash(num);
else
cout<<"\nWrong input"<<endl;
return 0;
}
Answer:
See Explaination
Explanation:
Separating this critical section into two sections:
void transaction(Account from, Account to, double amount)
{
Semaphore lock1, lock2;
lock1 = getLock(from);
lock2 = getLock(to);
wait(lock1);
withdraw(from, amount);
signal(lock1);
wait(lock2);
deposit(to, amount);
signal(lock2);
}
will be the best solution in the real world, because separating this critical section doesn't lead to any unwanted state between them (that is, there will never be a situation, where there is more money withdrawn, than it is possible).
The simple solution to leave the critical section in one piece, is to ensure that lock order is the same in all transactions. In this case you can sort the locks and choose the smaller one for locking first.
The best option that will suite is that there will be no major issues since the offshore leads and the onsite members participated in the demo with the Product Owner/Stakeholders they can cascade the feedback to the offshore members
Explanation:
Iteration demo is the review which is done to gather the immediate feedback from the stakeholders on a regular basis from the regular cadence. This demo will be one mainly to review the progress of the team and the and to cascade and show their working process
They show their working process to the owners and they and the other stakeholders and they get their review from them and so there will be no issues if the members are not able to participate
Answer:
Advantages of DHT with mesh overlay topology
- A single hop is used to route a message to the peer, the nearest key is used route message between points
- There are bi-directional links between each pair of peers other than the broadcasting peer therefore creating a multiple delivery paths from source to other peers
Disadvantages of DHT with mesh overlay topology
- complexity of the design of a Mesh overlay Topology
- Consuming process ( tracking of all peers by each peer )
Advantages of circular DHT ( with no shortcuts )
- less consuming process ( each peer tracks only two peers )
Disadvantages of Circular DHT ( with no short cuts )
- The number of messages sent per query is minimized
- 0(N) hopes are required to route message to a peer responsible for the key
Explanation:
Advantages of DHT with mesh overlay topology
- A single hop is used to route a message to the peer, the nearest key is used route message between points
- There are bi-directional links between each pair of peers other than the broadcasting peer therefore creating a multiple delivery paths from source to other peers
Disadvantages of DHT with mesh overlay topology
- complexity of the design of a Mesh overlay Topology
- Consuming process ( tracking of all peers by each peer )
Advantages of circular DHT ( with no shortcuts )
- less consuming process ( each peer tracks only two peers )
Disadvantages of Circular DHT ( with no short cuts )
- The number of messages sent per query is minimized
- 0(N) hopes are required to route message to a peer responsible for the key
Distributed hash table (DHT) is a distributed system that provides a lookup service similar to a hash table. in the DHT key-value are stored in it
