Answer:
b) queue
Explanation:
Queue is also an abstract data type or a linear data structure, just like stack data structure, in which the first element is inserted from one end called the REAR(also called tail), and the removal of existing element takes place from the other end called as FRONT(also called head).
Time-to-live or TTL <span>tells a server how long the record should remain in the cache.
TTL is a mechanism that limits the lifetime of data in a network or a computer and prevents data packets from circulating indefinitely.
</span><span>It also improves the caching and privacy of networks and computers.</span>
<span>You can use the ADVANCED tab in the font dialog box to change the scale of selected characters, to alter the spacing between characters, or to raise or lower the characters.</span>
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
Answer:
B. False.
Explanation:
Troubleshooting strategy is a technique used to discover the cause of defeat in a system. The technician must learn to improvise with these strategies to solve a system problems.
Module replacement is a type of troubleshooting strategy that replaces a component with unknown status with another component with good status to determine the cause of the problem.
Removing a component from a system to get back to its basic configuration helps to eliminate factors that may make a computer problem difficult to solve.
