CS610 Midterm Past Paper 3

CS610 Mid Term

_______ computes shortest paths in a graph by using weights on edges as a measure of distance.

1. Greedy algorithm
2. Distance vector algorithm
3. Dijksta’s algorithm (Computer Networks and Internets, page112) rep
4. None of the given
5. Constant Bit Rate (CBR) service
6. Variable Bit Rate (VBR) service (Page 71)
7. Available Bit Rate (ABR) service
8. None of the given

Basic LAN technologies such as Ethernet, Token Ring, and FDDI use a _____.

1. Connectionless service paradigm (Computer Networks and Internets, page112)
2. Connection-oriented service paradigm
3. Both Connectionless and Connection-oriented service paradigm
4. None of the given

CS610 Mid Term

1. Area
2. Volume (Page 80)
3. Length
4. None of the given

A network with throughput T and delay D has a total of ________ bit in transit at any time.

1. T / D
2. T x D (Computer Networks and Internets, page203) rep
3. T + D
4. None of the given

One repeater _______, two repeaters ________ the maximum cable length limitation.

1. doubles, triple (Page 49)
2. square roots, cude roots
3. and, triple
4. doubles, cancel

CS610 Mid Term

A network uses a ------ if all computers attach to a central point

1. Star Topology (Page 25)
2. Ring Topology
3. Bus Topology
4. None of the given

Computers attached to an Ethernet use ------ in which a computer waits for the other to be idle before transmitting a frame.

1. CSMA/CD (Computer Networks and Internets, page 93) rep
2. CSMA/CA
3. TOKEN PASSING
4. None of the given

A typical port on an ATM switch operates at __________ or higher.

1. OC-2 speed (155Mbps)
2. OC-3 speed (100Mbps)
3. OC-3 speed (155Mbps) (Page 72)
4. OC-3 speed (155Gbps)