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. The Design of an Analogy to digital converted
  4. Circuits for quadrature signals. (IQ signals) and their limitations and sources of error.
  5. Thinking about IQ samples as complex numbers.
  6. Baud Rate Calculations, Given some baud rate (Symbols per second) how many bits be second. (Other examples and questions along this line_
  7. Strategies for Error detection and error correction.
  8.  Parity checking single bit/ and two dimensional bit parity
  9. CRC checking.
  10. Media Access Protocols.  (Design trade-offs )
  11. Analyzing Media Access Protocols.
  12. Calculating Back-off Times for CSMA/CD
  13. Calculating Minimum Frame Length Ethernet based on propagation delay.
  14. Collecting Mac addresses over wifi.
  15.  Arp Tables and Arp poisoning.
  16.  Basics of the ARP protocol. (Design limitation and advantages)
  17. Routing to another Lan Through a router
  18. Ethernet. (Over and topologies, trade-off between topologies.)
  19. Manchester Encoding Ethernet. Why does the preamble exist)
  20. Advantages of manchester encoding. Clock recovery
  21. Self Learning Switches.  How are the tables constructed?
  22. Interconnecting Switching, how are the tables constructed.
  23. Difference between switches and routers.
  24. How thinking in context of software changes how we view networks. (Virtual Lan)
  25. The concept of Trunk Ports.
  26. How virtual land affects the underlining link layer frame structure. (More fields)
  27.  Subneting and subnet masks. (Identifying subnets) CDIR notations
  28. DHCP protocol/ Trade-Offs optimizations redundant messaging.
  29.  Hierarchical addressig: How ISP are assign Subnets By ican and how the intern assign subnets to other groups.
  30. Network address translation (port-based) How it works and what problem it solves.
  31. IP fragmentation.
  32. Tunneling. (How does it work )  Why. And the direction of the encapsulation.
  33. Control vs Data plain.
  34. Routing vs Forwarding.
  35. Router Architecture overview. (line cards and what the contain)
  36. Trade-off between different switchig fabric designs
  37. Cross Bar switches.
  38. Longest Prefix match
  39. TCAM (Trade offs
  40. Banyan Switches
  41. Scheduling policies and their trade offs.
  42. Distance vector algorithm.
  43. Automous Systems.
  44. BGP protocol (Advertizing routes)
  45. BGP Highjacking