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.
One gallon is 3.7854 liter so 4 liters are more than one gallon.
Answer:
anycast
Explanation:
Anycast -
It refers to as the routing methodology and the networking address where only one destination address has more than two pathway for the end destination , is referred to as an anycast .
In this case , the router has the capability to select the pathway to reach the destination , depending on the latency measurement , cost , distance and hops .
Hence , from the given information of the question ,
The correct answer is anycast .
Answer:
It is a spreadsheet application. the second should be leadership
Answer:
The system that will be more prone to attack or vulnerability is the bank that has ten branches spread throughout California with the data being stored on a mainframe in San Francisco.
Explanation:
Solution
If the databases are not shared by all the branches throughout the network, they could not be hacked or accessed easily. but when the systems are in a network and share databases or resources,then these could be more vulnerable to unauthorized persons or individuals.
The data been stored on a mainframe in San Francisco that is a centralized access by 10 branches of another bank. what this implies is that networking is involved or used to share data.
With this example, the chances of vulnerability or attacks increases from the following :
- Accounts payable could be disturbed by changing cash in payment false.
- Entering incorrect data into the system. such transactions can be altered, deleted by unauthorized persons.
- Transaction fraud like hacking, masquerading are very common in a networked system.
