Answer:
There are up to 12 lights and or plugs on that circuit. A 1000w HPS or Metal Halide light takes 9 amps at 120 volts so you can only run one on a wall outlet circuit. A standard dryer outlet is 220 volts and 30 amps so you can power up to six 1000 watt lights on that circuit.
Answer: C
Explanation:
That way she can have slides for her advance class and leave out slides that her normal class doesn’t need
i think it would be the investment with high risk and high return such as Stocks.When
investing in stock, investor analyze whether a specific company will be
doing well in the time of investment (which will increase the market
price of the stock) and take a profit from it.
Answer:
The rules which could trigger at any period in time are referred to as the conflict set. A programming bug/conflict can occur when two programs compete for the same resource such as memory or register etc.
A Conflict Resolution Strategy is is a protocol which highlights which decision will be triggered first.
The best way to resolve conflict is to first determine the kind of conflict it is. Hardware conflicts can be resolved by first troubleshooting the hardware and in some instances unplugging the hardware causing the conflict.
When hardware creates conflicts it may be due to a driver issue. reverting to an old driver or updating the existing one may solve the problem.
Software conflicts can be resolved by installing updates or complete uninstallation.
Cheers!
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.
