You have to ask you teacher to show you which ones you got wrong and the answers to them.
Answer:
Computers in the office environment significantly enhance productivity. According to the Reference for Business Web site, computers in the office increase productivity not only in areas such as word processing, data management and information access, but also in information creation, collation and ultimately storage. The amount of time most office workers spend at the computer has, however, given rise to a number of repetitive strain health problems on eyes, wrists and hands
hope it helps (^^)
# Cary on learning
Answer: The goals of computer security are to protect computers and users from data theft or loss as well as damage to any part of the computer.
Explanation: Common means of achieving computer security are firewalls, anti-virus software and this can fail due to hardware problems or
weaknesses that prevent malicious attacks.
To answer this question, think of a time when you experienced any one of these. For example, personally, I was once an unfortunate victim of a general malicious attack that took advantage of a weakness in my anti-virus software. After clicking on a link on a dodgy website, a virus was installed on my computer. My computer finally crashed, without any hope of restarting it. I lost all my data and I had to buy a new computer. This was a malicious attack.
However, sometimes people can be specifically targeted to steal their data or monitor their activities.
Nand stands for "not and". The truth table for a nand is:
a b | a nand b
0 0 | 1
0 1 | 1
1 0 | 1
1 1 | 0
Hopefully this helps you answer your question.
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);
