Final_exam_sample2_Solution

Final_exam_sample2_Solution - CS118...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 118 Computer Networking Fundamentals Sample Final Exam Fall 2007 Professor Mario Gerla Question Points Score 1 20 2 25 3 25 4 15 5 15 Total: 100 Name: _________________________ Student ID #:  _____________________ Instructions: - Closed book, two double sided 8.5”x11” sheet of notes - Calculators are allowed
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
- 2 - - This exam has 12 pages, including this cover page
Background image of page 2
- 3 - 1)  (20)   Answer the following True/False.  You do not need to explain your answer. a) Token Bucket is not suitable to handle bursts of traffic.  F   b) CSMA/CA allows multiple transmissions at the same time within the same area of  coverage. F c) When a collision happens in a CSMA/CD network the sender is able to stop the  transmission immediately saving precious time . T d) Weight Fair queuing always transmits the higher priority traffic first.   F e) DiffServ is a QoS model for the Internet that requires a per flow state in each edge router  but reduces the load in the core network. F f) Integrated Services provides QoS support in terms differential behavior among different  traffic class. F g) The playout buffer for a multimedia application should follow the rule: The large the  better in any case. F h) SIP can be used to start a session that requires a codec negotiation.  T i) In Link State routing, every node needs to know the complete network topology before  computing the path to each destination. T j) RTP is the panacea for multimedia applications since provides a reliable QoS support.  F
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
- 4 -
Background image of page 4
- 5 - 2)  (25)  Answer each of the following questions concisely. a) (5) Briefly Describe the CSMA algorithm  (In your explanation, include an example).  Sense before transmit, like in Ethernet b) (10)  Describe the CSMA/CA and CSMA/CD Algorithms; point out differences and  similarities. How these two MAC protocols differ from the original CSMA? CSMA/CD: allow accidental collisions, but detect early to minimize waste
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/15/2012 for the course CS 111 taught by Professor Staff during the Fall '98 term at UCLA.

Page1 / 9

Final_exam_sample2_Solution - CS118...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online