diff options
| author | mo khan <mo@mokhan.ca> | 2025-01-20 13:22:12 -0700 |
|---|---|---|
| committer | mo khan <mo@mokhan.ca> | 2025-01-20 13:22:12 -0700 |
| commit | b162344c0234b5515fb0e6cd2e099310c02e96e6 (patch) | |
| tree | 91988d0e3f32b62e6b2e1c674af0cb5767f6da52 | |
| parent | 61d516917c954644eaf0270eec6bb040ed2f26e6 (diff) | |
Try Chapter 7 question 16
| -rw-r--r-- | assignments/3-solution.md | 12 |
1 files changed, 9 insertions, 3 deletions
diff --git a/assignments/3-solution.md b/assignments/3-solution.md index efc10f8..637aca7 100644 --- a/assignments/3-solution.md +++ b/assignments/3-solution.md @@ -6,9 +6,7 @@ Choose ONE exercise each from Chapters 6, 7, and 8 Chapter 6: -13. Write a complete assembly language program (including all necessary -pseudo-ops) that reads in a series of integers, one at a time, and outputs the -largest and smallest values. The input will consist of a list of integer values +> 13. Write a complete assembly language program (including all necessary pseudo-ops) that reads in a series of integers, one at a time, and outputs the largest and smallest values. The input will consist of a list of integer values main.c ```c @@ -22,5 +20,13 @@ main.s Chapter 7: +> 16. Given the following diagram, where the numbers represent the time delays across a link: +> a. How many simple paths (those that do not repeat a node) are there from node A to G? +> b. What is the shortest path from node A to node G? What is the overall delay? +> c. If node E fails, does that change the shortest path? If so, what is the new shortest path? + + +> 18. What are some of the specific responsibilities performed by the device called a gateway (diagrammed in Figure 7.21) that is placed between two different types of networks to allow them to communicate? + Chapter 8: |