Answer:
Stack.
Explanation:
Topological sort requires a bit of addition to DFS algorithm.So DFS can be done by two ways that are either you can use recursion or you can use Stack data structure to implement DFS.
Since recursion uses stack memory when it makes recursive calls and if you want to do it iteratively you can stack data structure.
Answer:
Serial data access will go through all the data by order until the target data is reached
Explanation:
This is opposite of direct data access which immediately finds the desired
data
Answer:
Two systems are connected by a router. Both systems and the router have transmission rates of 1,000bps. Each link has a propagation delay of 10ms. Also, it takes router 2ms in order to process the packet (e.g. decide where to forward it). Suppose the first system wants to send a 10,000 bit packet to the second system. How long will it take before receiver system receives the entire packet.
Transmission time for first Router = 10,000 bits / 1000 bps = 10 seconds
Receiving time for seond route r= 10,000 bits / 1000 bps = 10 seconds
Propagation delay = 10ms = .01 seconds x 2 for two delays = .02 seconds
First router 2ms to process = .002 seconds
Add all the times together and we get 20.022 seconds which is the same as or 20 seconds and 22 ms
Explain what is meant by a limited data set and how this HIPAA rule may affect medical assistants
