Answer:
C. Resistor
Explanation:
A discrete component can be defined as any electronic component that are built as an individual or single unit.
Basically, a discrete component comprises of a single circuitry element, either an active element such as a vacuum tube, transistor etc or a passive element such as a resistor, diode, capacitor, inductor etc.
Hence, a discrete component is different from an integrated circuit (IC) or hybrid circuits because it is typically constructed or built with a single circuit element while integrated or hybrid circuits are constructed as a multiple unit.
Additionally, most discrete component are mainly semiconductors and as such consume large amounts of current.
It will take 8 times more time to sort a 40-element list compared to the time spent on a 5-element list.
We can arrive at this answer as follows:
- We can see that if we divide a group of 40 elements into groups containing 5 elements, we will have 8 groups.
- In this case, the time it would take to sort the list of one group of 5 elements would be repeated 8 times so that we could sort all the groups and their elements.
Another way to do this is to divide the number 40 by 5. We would have the number 8 as a result, which indicates that we would need 8 times more time to sort a list of 40 elements, compared to a list of 5 elements.
You can get more information about lists at this link:
brainly.com/question/4757050
Answer:
Event procedure
Explanation:
Whenever a user perform certain action, such as press a button on the keyboard or click the mouse, etc. such action are called an event. when an event occurs, Visual Basic looks for BASIC instructions to tell the object in the program how to behave to the user event. The Visual Basic instructions that responds to this specific event is called an event procedure.
Answer:
File History utility and System Protection utility for windows 8;
And then Backup and Restore utility and System Protection utility for windows 7.
Answer:
For undirected graph n(n-1) for directed graph 
Explanation:
The maximum number of edges for a undirected graph is given by 
, where n is number of vertices
The maximum number of edges in directed graph is given by , where n is number of vertices
The maximum number of edges is greater in undirected graph than directed graph
