Daniel G. Graham Ph.D

Office Rice 411

List of Topics for Midterm 1

The midterm will be a multiple-choice exam. There will be about 30 – 45 questions.  The questions will be grouped into three buckets.

  1. C style questions. These are the easiest.
  2. B style questions. These are the more difficulty
  3. A Style questions. These are the most difficulty ( These are designed to challenge you_

The topics that will be covered are outlined below.

  1. Difference between simplex, half-duplex and full-duplex.
  2. FM and AM modulations.
  3. Baud Rate Calculations, Given some baud rate (Symbols per second) how many bits be second. (Other examples and questions along this line_
  4. Strategies for Error detection and error correction.
  5.  Parity checking single bit/ and two dimensional bit parity
  6. CRC checking.
  7. Media Access Protocols.  (Design trade-offs )
  8. Analyzing Media Access Protocols.
  9. Calculating Back-off Times for CSMA/CD
  10. Collecting Mac addresses over wifi.
  11. Arp Tables and Arp poisoning.
  12.  Basics of the ARP protocol. (Design limitation and advantages)
  13. Routing to another Lan Through a router
  14. Manchester Encoding Ethernet. Why does the preamble exist)
  15. Advantages of Manchester encoding. Clock recovery
  16. Self Learning Switches.  How are the tables constructed?
  17. Interconnecting Switching, how are the tables constructed.
  18. Difference between switches and routers.
  19. How thinking in context of software changes how we view networks. (Virtual Lan)
  20. How virtual land affects the underlining link layer frame structure. (More fields)
  21.  Subneting and subnet masks. (Identifying subnets) CDIR notations
  22. DHCP protocol/ Trade-Offs optimizations redundant messaging.
  23.  Hierarchical addressing: How ISP are assign Subnets By ican and how the intern assign subnets to other groups.
  24. Network address translation (port-based) How it works and what problem it solves.
  25. IP fragmentation.
  26. Tunneling. (How does it work )  Why. And the direction of the encapsulation.
  27. Control vs Data plain.
  28. Routing vs Forwarding.
  29. Router Architecture overview. (line cards and what the contain)
  30. Trade-off between different switchig fabric designs
  31. Cross Bar switches.
  32. Longest Prefix match
  33. TCAM (Trade offs with new SDN architecture)
  34. Scheduling policies and their trade offs.
  35. Distance vector algorithm.
  36. Automous Systems.
  37. BGP protocol (Advertizing routes)
%d bloggers like this: