3213_Final_Winter2008_solutions

3213_Final_Winter2008_solutions - Department of Computer...

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

View Full Document Right Arrow Icon
1 Department of Computer Science and Engineering COSC 3213: Computer Networks I (Winter 2008) Instructor: N. Vlajic Date: April 8, 2008 Final Examination Instructions: Examination time: 180 min. Print your name and CS student number in the space provided below. This examination is closed book and closed notes. Calculator and one-sided cheat-sheet are allowed. There are 8 questions. The points for each question are given in square brackets, next to the question title. The overall maximum score is 100. Answer each question in the space provided. If you need to continue an answer onto the last page, clearly indicate that and label the continuation with the question number. FIRST NAME: ___________________________ LAST NAME: ___________________________ STUDENT #: ___________________________ Question Points 1 / 15 2 / 15 3 / 10 4 / 13 5 / 15 6 / 12 7 / 14 / 6 Total / 100
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 1. Multiple Choice [15 points] time: 20 min Circle the letter beside the choice that is the best answer for each question. For each question choose only ONE answer. (1.1) To deliver a message to the correct application program running on a host, the ___________ address must be consulted. (a) physical (b) IP (c) port (d) DNS (1.2) __________ is a type of transmission impairment in which the signal loses its form/shape due to the different propagation speeds of each frequency that makes up the signal. (a) attenuation (b) delay distortion (c) thermal noise (d) cross talk (1.3) A signal that is digital and periodic in time domain can be represented by __________ in frequency domain. (a) one single spike (b) a series of spikes (c) a continuous function (d) none of the above (1.4) For a _________________ , the Nyquist bit rate formula defines the theoretical maximum bit rate. (a) noiseless signal (b) noisy signal (c) noiseless channel (d) noisy channel (1.5) Which of the following encoding methods does not provide for synchronization in a long sequences of 1s? (a) NRZ-L (b) NRZ-I (c) RZ (d) Bipolar
Background image of page 2
3 (1.6) How many carrier frequencies are used in quadrature PSK (QPSK). (a) 1 (b) 2 (c) 4 (d) none of the above (1.7) Two dimensional party check can detect _____________ errors (a) 1 (b) up to 2 (c) up to 3 (d) up to 4 (1.8) To guarantee correction of up to 5 errors in all cases, the minimum Hamming distance in a block code must be __________. (a) 5 (b) 6 (c) 10 (d) 11 (1.9) The Go-Back-N strategy is (a) easier to implement than Selective Repeat (b) as efficient as Selective Repeat in case of noiseless links (c) both (a) and (b) (d) none of the above (1.10) The efficiency of a polling-based system increases as: (a) overall number of stations (active + inactive) decreases (b) number of active stations decreases (c) average load per station increases (d) polling time increases (1.11) In which of the following scenarios Token Ring can be expected to provide better performance than Ethernet? (Assume each active station sends only 1 small-sized packet at a time.) (a) a mid-size network with only a few active stations at any given time
Background image of page 3

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

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

This note was uploaded on 12/11/2010 for the course CSE 3213 taught by Professor A during the Fall '10 term at York University.

Page1 / 17

3213_Final_Winter2008_solutions - Department of Computer...

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

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