Answer:
Promiscuous mode
Explanation:
You decide to use a packet sniffer to identify the type of traffic sent to a router. You run the packet sniffing software on a device connected to the same hub that is connected to the router. When you run the software, you only see frames addresse…
✓ Promiscuous mode
Explanation:
People have feelings and emotions because evolved emotions as ways of helping us to rapidly reorganise our mental and bodily resources to help us prepare for anything the world might throw at us. During our lives, each of us experiences millions of emotional reactions either consciously or unconsciously.
Hope this helps
Answer:
Redundant paths can be available without causing logical Layer 2 loops.
Explanation:
- Spanning Tree Protocol is used to allow redundancy in the Layer 2 switched networks without creating cycles/circles also called loops.
- These loops are called physical loops.
- When two parts of the switched network are connected via two or more Layer 2 switches this result in a loop.
- This affects the performance of the network as the result of broadcast packets flooding.
- STP puts one port of the switch to forward mode and the rest of the ports within the same part of the network to the blocking mode to avoid broadcast packet flooding. STP puts all the ports that are allowing redundant paths to block mode and the one port that is left after this is placed in forward mode.
- Spanning Tree Algorithm is used by STP to determine the optimal path of switch to the network.
- Bridge Protocol Data Units are used to share the information about the optimal path determined by the spanning tree algorithm with other switches.
- This information helps STP to eliminate the redundant paths.
- So this is how STP tracks all the links in the switched network and eliminates redundant loops by allowing only one active path to the destination while blocking all other paths.
Answer:
See explaination
Explanation:
The reasons why indexed sequential search structure is better are:
1. In index sequential search any field of the records can be used as the key. This key field can be numerical or alphanumerical.
2. Since each record has its data block address, searching for a record in larger database is easy and quick. There is no extra effort to search records. But proper primary key has to be selected to make efficient.
3. This method gives flexibility of using any column as key field and index will be generated based on that. In addition to the primary key and its index, we can have index generated for other fields too. Hence searching becomes more efficient, if there is search based on columns other than primary key.
The reasons why 5 B-tree is better:
1.The B-tree Provides support for range of queries in an efficient manner and You can iterate over an ordered list of elements.
2. B-Tree algorithms are good for accessing pages (or blocks) of stored information which are then copied into main memory for processing. In the worst case, they are designed to do dynamic set operations in O(lg n) time because of their high "branching factor" (think hundreds or thousands of keys off of any node). It is this branching factor that makes B-Trees so efficient for block storage/retrieval, since a large branching factor greatly reduces the height of the tree and thus the number of disk accesses needed to find any key.
3. It is a generalization of a BST in that a node can have more than two children. These are self-balancing and hence the average and worst complexities is logarithmic. We opt for these when the data is too huge to fit in main memory. These structures are used in database indexing and help in faster operations on disk
the additional informations is we should first decide to choose which structure is suiatable for which algoritm in terms of space and time and then use the appropriate search algorithm.
Answer:
C communication software
Explanation:
C communication software IS THE ANSWER