Let G be a directed graph with weights on the edges (the weights can be positive...

Transcribed Image Text:

Let G be a directed graph with weights on the edges (the weights can be positive or negative). The graph G has n vertices and m edges. Computing the shortest simple path between two vertices in G can be done in: This is not defined if there are negative (a) cycles in the graph. As such, it can not be computed. (b) This can be solved in O(nm) time using Bellman-Ford. (c) No other answer is correct. (d) This is NP-Hard. (e) This can be solved in O(n logn + m) time using Dijkstra. 01. Which is the technology to push the data analytics closer to the loT devices? A. Edge Computing B. Full function device C. Multi-hop Routing D. Clustered Topology 02 Which is the messaging mechanism used by MQTT for connecting loT devices to the Broker? A. Production/Consumption B. Multicast/Broadcast C. Write/Read D. Publish/Subscribe Let G be a directed graph with weights on the edges (the weights can be positive or negative). The graph G has n vertices and m edges. Computing the shortest simple path between two vertices in G can be done in: This is not defined if there are negative (a) cycles in the graph. As such, it can not be computed. (b) This can be solved in O(nm) time using Bellman-Ford. (c) No other answer is correct. (d) This is NP-Hard. (e) This can be solved in O(n logn + m) time using Dijkstra. 01. Which is the technology to push the data analytics closer to the loT devices? A. Edge Computing B. Full function device C. Multi-hop Routing D. Clustered Topology 02 Which is the messaging mechanism used by MQTT for connecting loT devices to the Broker? A. Production/Consumption B. Multicast/Broadcast C. Write/Read D. Publish/Subscribe