I.

Identify, Define, or Enumerate

1. Criteria at which network routes are measured immediate neighbors. The incomplete- trees are exchanged
2. IPV4 between immediate neighbors to make the trees more and more
3. IPV6 complete and to represent the whole internet.
4. Address Space 16. The total number of addresses used by the protocol
5. This host address in IPV4 17. The practice of dividing a network into two or more smaller
6. Subnetting networks
7. Loop-back address in IPV4 18. This routing algorithm associates cost with an edge to
8. Loop-back address in IPV6 define the state of a link. Links with lower costs are preferred to
9. Global unicast address in IPV6 links with higher costs. To compute the best route a node has a
10. What is a packet forwarding technique that is collection of states for all links that represents a complete map of
based on a label. the network
11. What provide services to the transport layer 19. Link state routing depends on this algorithm to compute the
and receives services from the link layer. best route.
Concerned with packetizing, routing, and 20. This routing technique depends on distance vector algorithm to
forwarding of packets. compute the best route. It is capable of handling graphs in which
12. A mode of data transmission in which a some of the edge weights are negative numbers.
message is broken into a number of parts 21. a packet forwarding technique that is based on the destination
which are sent independently, over whatever address.
route is optimum for each packet, and 22. To direct and deliver a datagram from its source to its
reassembled at the destination. destination or destinations
13. An internet addressing technique that 23. One-to-one delivery: a datagram is directed and delivered to
uses 32 bits only one destination
14. An internet addressing technique that uses 128 24. Give an example of class A IPV4 Address
bits 25. Give an example of class B IPV4 Address
15. A routing algorithm that determines the 26. Give an example of class C IPV4 Address
best or least-cost routes by creating least-cost 27. Give an example of class D IPV4 Address
tree with the information a node has about its 28. Give an example of class E IPV4 Address

II. Solve: 19. last address

70.110.19.17/19
An organization is granted the block 24.0.0.0/17. The
administrator wants to create 256 fixed-length subnets. 20. first address
1. The subnet mask. 21. last address
2. The address space of each subnet.
3. The first addresses in the first subnet. Abbreviate:
4. The first addresses in the 256th subnet.
5. The last addresses in the first subnet. 22. 0000:FFFF:FFFF:0000:0000:0000:0000:0000
6. The last addresses in the 256th subnet. 23. 1234:2346:3456:0000:0000:0000:0000:FFFF

In a block of addresses, the IP address of one host is 24. 0000:0001:0000:0000:0000:FFFF:1200:1000

24.35.13.58/16. 25. 0000:0000:0000:0000:FFFF:FFFF:187B:0C06
7. Give the net mask Write the un-abbreiviated form of these IPV6 addresses :
8. the first address (network address) and
26. ::2
9. the last address (limited broadcast).
27. 0:23::
Write the following subnet masks in slash notation (/n)
28. 0:A::3
10. 255.255.255.0
11. 255.0.0.0 29. 123.56.77.0
12. 255.255.192.0 Find the link local address / interface identifier of the
13. 255.255.128.0 following Ethernet physical addresses using EUI
14. 255.255.248.0
30. (F5-A9-23-12-7A-B2)16
15. 255.255.252.0
31. (F4-A9-23-12-7A-B2)16
Each of the following addresses belongs to a block. Find the 32. (F8-A9-23-12-7A-B2)16
first and the last address of the block where the following
addresses belong to: Given the network with the subnet prefix
14.12.72.8/23 2000:1456:ABCD:0000 find the global unicast address for the
following:
16. first address
33. (F5-A9-23-12-7A-B2)16
17. last address
34. (F4-A9-23-12-7A-B2)16
200.107.16.17/18
18. first address 35. (F8-A9-23-12-7A-B2)16

IP, ICMP, IGMP, CIDR, AS, RIP,

II. Spell-out the following acronyms: OSPF, BGP, EUI, LSDB, MTU, IS-IS,
EIGRP, ARP