CSE/EE 461 Final Review Questions, Part 2

Wetherall, Autumn 2001.

These questions are intended to give you an idea of the kinds of questions you will face on the final. But note, I have not picked them to give carefully balanced coverage of all relevant material, and you should consider them to in addition to reviewing the material probed by the assigned homework questions.

Sample Multiple Choice

Again, these questions were taken from a prior exam.


7. Quality of Service guarantees cannot be made for a flow or user without:

  1. Mechanisms such as ECN that signal congestion without loss
  2. Traffic shaping algorithms that smooth bursty traffic
  3. Admission control mechanisms that limit load
  4. Mechanisms such as WFQ that improve fairness at routers


11. The key benefit of Random Early Detection is that:

  1. Congestion is detected and signaled before it occurs
  2. Packet loss is not used to signal congestion
  3. Larger bursts can be absorbed without loss
  4. Fairness is improved

12. Circle all that are true. The DNS is a hostname database that is:

  1. Distributed in terms of management
  2. Replicated to increase availability
  3. Cached to improve performance
  4. Consistent to increase availability

13. What is the primary reason that TCP connection establishment exchanges a different initial sequence number (ISN) between the two sides?

  1. To prevent packets from previous connections being confused with the new connection
  2. To provide mutual authentication
  3. To distinguish packets from other concurrent flows
  4. To protect against loss

14. In a public key cryptography system the secrecy of messages sent from A to B is achieved by:

  1. Encrypting the message at A with A's private key
  2. Encrypting the message at A with B's private key
  3. Encrypting the message at A with A's public key
  4. Encrypting the message at A with B's public key

15. Select the best answer below. Message digests are designed so that the digest value is:

  1. Provably unique
  2. Computationally intensive to compute
  3. Computationally infeasible to reverse
  4. Robust against random message errors


Sample Short Answer

As well as multiple choice questions, the final will contain short answer questions. These Peterson questions give you a good idea of what you will face, except that some are longer/harder than the exam questions will be because of time constraints.


6.9, 6.10, 6.14, 6.18, 6.29, 6.31, 6.43, 6.45