Skip Navigation
Home Syllabus Schedule Assignments Labs Reading

image of paper and pen


SPARK Assignments

Following every lecture (except the Introduction lecture), there will be a online assignment on SPARK ( This assignment must be completed before the next lecture. The scores from these assignments are used to determine the homework assignment portion of the final course grade.

Exam Preparation

The following lists of problems from the textbook are suggested in preparation for the exams. None of these questions need to be turned in and none of them will be graded. Note that the problems below do not cover all topics that are studied in class.

Preparation for Exam I

Consider (some of) the following problems from the textbook:

  • Chapter 1: P1, P3, P4, P5, P6, P9, P10
  • Chapter 2: P1, P3, P7, P8, P10
  • Chapter 3: P1, P2, P5, P6, P7, P8, P9, P10, P13, P14, P20, P21, P23, P24, P28
  • Chapter 4: P1, P2, P5, P8, P9, P10, P11, P14, P15, P18
  • Chapter 5: P9, P12, P13, P14, P15, P16, P19

Old exam: PDF

Preparation for Exam II

Consider (some of) the following problems from the textbook:

  • Chapter 3: P32, P33, P34, P36, P37
  • Chapter 4: P22, P23, P24, P25, P26, P27, P29
  • Chapter 8: P2, P3, P4, P5, P6, P8, P10, P11, P13

Old exam: PDF

Preparation for Exam III

Consider (some of) the following problems from the textbook:

  • Chapter 4: P35, P36
  • Chapter 7: P20, P21, P2

Also consider examples from these areas:

  • Queueing theory: steady state probabilities for DTMC and CTMC, Little's law, birth-death processes, queuing delay for M/M/1
  • Interconnects: types and tradeoffs, output queuing, input queuing, virtual output queuing
  • Spanning tree algorithm
  • Prefix lookup algorithms: binary tree, path compressed tree, prefix expansion, multibit trie
  • Packet classification algorithms: hierarchical tries, set-pruning tries, grid-of-tries
  • Scheduling: DRR, WFQ, WF^2Q

Old exam: PDF (note that this was a 120 min. exam - our exam will be 75 min.)