Answer:
Some computer experts create computer viruses to prove certain a process will work
Explanation:
Answer:
It's due to damage of goods
i believe this will be false
Answer:
def isdivisible():
maxint=input("Enter the Max Int")
int1=0
int2=0
int1=input("Enter the first Integer")
int2=input("Enter the second Integer")
tup1=(int1, int2)
print(tup1)
i = 1
for i in range(1, int(maxint)-1):
if int(tup1[0])%i==0 & int(tup1[1])%i==0:
print(i)
else:
continue
isdivisible()
1.2 Outputs
First test case:
Enter the Max Int6
Enter the first Integer2
Enter the second Integer8
('2', '8')
1
2
Second test case: returning empty list
Enter the Max Int2
Enter the first Integer13
Enter the second Integer27
('13', '27')
Test case 3:
Enter the Max Int4
Enter the first Integer8
Enter the second Integer10
('8', '10')
1
2
Explanation:
The program is as above, and the three test cases are also mentioned. We have created a tuple out of two input integer, and performed the output as required.
Answer:
Chord is a set of rules for a peer-to-peer distributed hash table it collects key-value sets by allotting keys to several computers (known as "nodes"); a node will collect the values for all the keys for which that is reliable. Chord defines how keys are allocated to the nodes, and how a node can determine the value for a distributed key by first locating the node liable for such key.
Explanation:
A chord is a peer-to-peer lookup service. It Resolves the difficulty of establishing a data item in a combination of shared nodes, considering various node arrivals and removals The most crucial operation in most peer-to-peer method is the efficient position of data objects.
It is able of supporting only one operation i.e. given a key, it maps the key on a link.
Algorithm:
Algorithm shows working of the chord:
// x is a node used to find successor of id
x.find_successor(id)
if (id (x; successor])
return successor;
else
// query is being delivered around the circle
entrance successor.find_successor(id);
