0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
How do you use p2p on LimeWire?
limewire is a p2p program the only thing it does is download via p2p
Advantage and distadvantage in hash table?
ANSWER A hash table is a way to find data in an array, when you have a known key and an unknown value that corresponds to the key. You use a hashing function on the key to create an index into the hash table containing the value. In the ideal case, this directly returns the corresponding value. In the usual case, a collision can occur. This means that the hashed key points to multiple possible values. A hash table is usually used on large arrays that would take a long time to search using other methods. A hash table can be very fast and use very little memory, and does not require the array to be sorted. The source code is slightly more complicated than some search methods. With a poorly designed hashing function when the hashed keys do not correspond one-to-one with the values, the secondary search after a hash collision can take a large amount of time.
How do you optimize network performance?
take a inventroy of applications that use the internet make sure you have no torrents or p2p software running upgrade older network hard for example upgrade switch from hub
What are the peripheral devices does the peer to peer network uses?
A peer-to-peer (P2P) network is a type of computer network in which each computer, or node, in the network acts as both a client and a server, allowing for decentralized sharing of resources and information. P2P networks can use a variety of peripheral devices to connect and share data between nodes. One common peripheral device used in P2P networks is the network interface card (NIC), which allows computers to connect to a network and communicate with other devices. The NIC is responsible for transmitting and receiving data over the network, and can be either wired or wireless. Wired NICs use an Ethernet cable to connect to a router or switch, while wireless NICs use Wi-Fi technology to connect to a wireless network. Another peripheral device commonly used in P2P networks is the external hard drive. External hard drives allow users to store and share large amounts of data, such as documents, photos, and videos, between nodes in the network. External hard drives can be connected to a computer through a USB or FireWire port, and can be accessed by other computers in the network through file sharing software or a network-attached storage (NAS) device. The use of external hard drives in P2P networks allows for easy sharing and backup of important data, without the need for expensive and complex server systems.
Is p2p illegal?
Like the Web, your browser, and the Internet itself, yes it is. It's simply another way to use the network. The individual files shared on P2P, or anywhere on the Internet, may or may not be legal.
What els can you use the internet for besides using web browser?
The internet has a wide array of uses. One of them being the P2P or peer to peer network system. This network allows you to download files that other peers, or internet users, have for download. One software that uses this network is FrostWire.
Are P2P payments systems developed by Apple or Google for use on their mobile devices a threat to Paypal?
Are P2P systems developed by Apple or Google
Why hash are use?
4 narcosis.
Why do they call a pound sign hash tag?
why do people use hash sign in texting and facebook
P2P is prohibited on DoD computers or networks?
According to a memo from the Department of Defense, issued November 23rd, 2004: Section 5; "P2P networks (File sharing) results in significant vulnerabilities to information systems including unauthorized access to information and compromise of network configurations." Its use is therefore prohibited without DAAS approval for use (REF D & E)
What is hashing and its concepts in data structure?
Hashing allows us to map data of arbitrary length to data of fixed length. If we consider a table that contains thousands of objects, searching for a particular object could have a significant runtime cost if the objects require complex comparisons. Binary search would reduce that cost, however the cost of sorting the objects and then maintaining the order can be just as significant. Instead, we use a hash table. With a suitable hashing function, any object can be reduced to a single value. The range of output values is usually much smaller than the range of input values, thus two or more objects may well produce the same hash value. However, with an appropriate hash function, objects can be evenly distributed throughout the range of hash values. If we suppose that a single hash might be associated with up to n objects, then the size of the hash table will be up to n times smaller than the object table and can therefore be sorted and maintained n times more quickly than the object table. We then only need to sort n objects per hash to create an efficient hash lookup table. To search for an individual object, we pass the object through the hash function to obtain its hash and then search the hash table using a trivial binary search. If the hash exists (with a fixed-length table it is guaranteed to exist), we then use the more complex object comparisons to binary search the n objects associated with that hash value. The end result is that we narrow the search down to a much smaller subset of objects, thus significantly reducing the cost of searching. Hashing has other uses, particularly in cryptography. While it is possible to reverse engineer a hash value to produce n possible values for a given hash, cryptographic hashing is one-way only; we cannot use the hash to reproduce the input. Thus instead of storing passwords, we need only store the hashes produced by those passwords. Even knowing the precise implementation details of the hashing function won't help an attacker because in order to produce a particular hash value you'd still need to know which input actually produces it and that means testing each potential input individually. Doing it for just one input is hard enough, but doing it for two or more is nigh-on impossible (usernames, IP addresses, secret questions and answers and all other security information can also be hashed).
How do you use hash table?
In computer science, a hash table, or a hash map, is a data structure that associates keys with values. The primary operation it supports efficiently is a lookup: given a key (e.g. a person's name), find the corresponding value (e.g. that person's telephone number). It works by transforming the key using a hash function into a hash, a number that is used as an index in an array to locate the desired location ("bucket") where the values should be. Hash tables support the efficient insertion of new entries, in expected O(1) time. The time spent in searching depends on the hash function and the load of the hash table; both insertion and search approach O(1) time with well chosen values and hashes.
