CS 4873 Computer Networks Final Exam Review
Most of this is from the midterm exams.
- Network Layers
- Chapter 2, The Physical Layer
- Concept of bandwidth limited signals
- Fourier series
- Sampling Theorem: bandwidth H, 2H exact samples to reconstruct
the signal
- Nyquist theorem: maximum data rate is 2H lg V bits/sec
- Shannon theorem: maximum data rate is H lg (1 + S/N)
- Using dB
- Relation between frequency and wavelength
- Modems and codecs
- T1 carrier, PCM
- Circuit, message, and packet switching
- Chapter 3, the Data Link Layer
- Character stuffing
- Bit stuffing
- Error detection and correction
- Hamming distance
- Hamming code
- Error detection using parity and CRC
- Protocols 1-6
- Introduction to Queueing Theory
- M/M/1 queues
- Poisson formula
- mean number of customers
- average time in the system
- Chapter 4, The Medium Access Sublayer
- Static channel allocation
- ALOHA
- pure infinite
- slotted infinite
- slotted finite
- CSMA: 1-persistent, non-persistent, p-persistent
- CSMA/CD: contention slot, contention interval
- Limited contention protocols
- Manchester and differential Manchester encoding
- 802.3 and Ethernet
- frame size, cable length and propagation delay
- binary exponential backoff
- performance under heavy load
- 802.4: Token Bus
- distinction between logical and physical topology
- token passing
- ring entry and exit
- 802.5: Token Ring
- physical length of a bit
- listen and transmit mode
- wire controllers
- token size and delays
- FDDI
- Fast Ethernet
Chapter 5, The Network Layer
- Services provided to the transport layer
- Connectionless
- Connection-oriented
- Implementations
- Datagrams
- Circuit Switching
- Routing Algorithms
- Adaptive vs. non-adaptive
- Optimality Principle
- Shortest Path Routing