MCQOPTIONS
Saved Bookmarks
| 1. |
Most efficient paths between source and destination nodes of a message can be calculated by |
| A. | Data sequencing |
| B. | Data indexing |
| C. | Data routing |
| D. | Data dandling |
| Answer» D. Data dandling | |