TRƯỜNG ĐẠI HỌC GIAO THÔNG VẬN TẢI

THÀNH PHỐ HỒ CHÍ MINH ĐỀ THI KẾT THÚC HỌC PHẦN

Tên học phần: ………Mạng Máy Tính…..…

Mã đề thi : 02 Mã học phần : 0101035108 Số TC : 02

Họ và tên SV :................. Thời gian : 60’ Hệ : Đại học
Mã sinh viên :................. Trưởng BM : ThS. Phan Thanh Minh
Chữ ký :

Câu 1 (2 điểm): An ISP is granted a block of addresses starting with 190.68.0.0/17. The ISP wants to distribute these
blocks to 100 organizations with each organization receiving just 1024 addresses. Design the subblocks and give the
slash notation for each subblock. Find out how many addresses are still available after these allocations.

Câu 2 (3 điểm):

How does the router manages the IP packets with the following IP estination addresses?
• 147.26.50.30
• 145.80.14.26
• 135.11.80.21
Câu 3 (3 điểm):
a) Show the operation of Dijkstra’s (Link State) algorithm for computing the least cost path from E to
all destinations.

b) From these results, show the least cost path from E to A, and briefly describe (in a sentence) how you
got that answer from your work in part a).
c) What are distance vectors in nodes E, D, and C? In one or two sentences, explain how the least cost
path from E to A was determined by E based on these three distance vectors

1/2
 d) Let us focus again on node E and distance vector routing. Suppose all distance vectors have been
computed in all nodes and now suppose that the link from E to B goes down. Approximately how
many distance vector messages will be sent by node E as a result of this link going down? Explain
your answer
Câu 4 (2 điểm): A host with IPv4 address 222.5.7.19 receives an IGMP query. When it checks its routing
table, it finds two entries in its table: 227.4.3.7 and 229.45.6.23. What action should the host take? Should it
send any messages? If so, what type and how many?

- Cán bộ coi thi không được giải thích đề thi

- Thí sinh không được phép sử dụng tài liệu
- Ghi số của đề thi vào bài làm, nộp kèm theo bài làm trước khi rời phòng thi.

2/2