University of La Salette Inc.

Dubinan East Santiago City

(Lecture)
Name:
Course/Year:
Contact number:

Part I. Identification. Answer what is being asked for. (1 pt. each). (Put your answer on the space
provided)

1. Electrically encodes and physically transfers messages between nodes. {Physical}

2. Provides reliable transit of data across a physical link, handling physical addressing, link discipline,
error detection, ordered delivery of frames and flow control. {Data Link}

3. Provides connectivity and path selection between two end systems that may be located on
geographically diverse sub-networks. {Network}

4. End- to- end control & information exchange with a level of reliability required for the applications.
{Transport}

5. Manages the connection between cooperating applications. {Session}

6. Transforms data to and from negotiated standardized formats. {Presentation}

7. Provides the window between the application process and OSI. {Application}

8. Multi-port repeater, provide connectivity, allowing attached devices a path between which they can
communicate, works on layer one. {Hub}

9. Connecting networks, can’t identify different logical networks. {Bridge}

10. ___________ transmission is the sending of information packets to a single destination. {Unicast}

11. ___________ refers to transmitting a packet that will be received (conceptually) by every device on the
broadcast domain. {=Broadcast =broadcasting}

12. ___________ is a network addressing method for the delivery of information to a group of destinations
simultaneously. {=Multicast =multicast}

13. ___________ like multicast but only one address of a set of addresses is chosen at any given time to
receive information from any given sender. {Anycast}

14. Entered manually by a system administrator. {Static routing}

15. Learned by exchange of routing information. {Dynamic routing}

17. Uses a route that a routing protocol adjusts automatically for topology or traffic changes. {Dynamic}

18. When there is only a single route to a network, this is known as a _________ network. {stub}

19. It is also common for customer networks to use a special kind of static route, known as a _________.
{default static route}

20. _________ table updates occur when the topology changes. {Routing}

21. LSAs stand for? {Link-state advertisements}

22. _________ is a small packet of routing information that is sent between routers. {=Link-state
advertisements =LSAs}

23. A _________ database is a collection of information gathered from LSAs. {topological}

24. The _________ algorithm is a calculation performed on the database resulting in the SPF tree.
{=shortest path first =SPF}

25. The _________ is the internal process used by a router to accept a packet on one interface and forward it
to a second interface on the same router. {switching function}

Part II. TRUE OR FALSE: Read each statement below carefully. Place a T on the line if you think a
statement it TRUE. Place an F on the line if you think the statement is FALSE.

1. The st of optimal routes to a particular node forms a sink tree.

2. Ler sequence numbers are rejected as obsolete.

3. Dijtra’s Shortest Path algorithm is used to determine the shortest path to each destination.

4. All mobile ats are assmed to have a pernent home lotion.

5. Pacts sent to the mobile agent are routed to the users home network.

6. The hoe agent routes the pacts to the feign agent.

7. The home agent provides the source of incoming packets with the remote address of the mobile agent.

8. EE 802.1 handles the architecture, security, management and internetworking of local area networks
(LAN), metropolitan area networks (MAN) and wide area area networks (WAN) standardized by IEEE
802.

9. A rouing algothm is a prere that lays down the roe or path to transfer data packets from source to the
destination. They help in directing Internet traffic efficiently.
10. Centralized algorithm it finds the least-cost path between source and destination nodes by using global
knowledge about the network.

11. Isolated algorithm this algorithm procures the routing information by using local information instead of
gathering information from other nodes.

12. Distributed algorithm this is a decentralized algorithm that computes the least-cost path between source
and destination iteratively in a distributed manner.

13. In flooding, when a data packet arrives at a router, it is sent to all the outgoing links except the one it has
arrived on.

14. Random walks this is a probabilistic algorithm where a data packet is sent by the router to any one of its
neighbours randomly.

15. A routed protocol is used to deliver application traffic.

16. Routing Protocols are the set of defined rules used by the routers to communicate between source &
destination.

17. A routing protocol uses software and routing algorithms to determine optimal network data transfer and
communication paths between network nodes.

18. Routing protocols facilitate router communication and overall network topology understanding.

19. Static routing protocols are used when an administrator manually assigns the path from source to the
destination network.

20. Dynamic routing protocols are another important type of routing protocol. It helps routers to add
information to their routing tables from connected routers automatically.

21. Distance Vector Protocols advertise their routing table to every directly connected neighbor at specific
time intervals using lots of bandwidths and slow converge.

22. RP is used in both LN and WN Networks. It also runs on the Applation laer of the OSI model.

23. IGRP is a btype of the disnce-vector interior gateway protocol developed by CISCO.

24. GP is a ptocol used to exange data between gateway hosts that are neighbors with each other within
autonomous systems.

25. EIRP is a hybrid routing protocol that provides routing protocols, distance vector, and link-state routing
protocols.

26. pen Shorest Pth Fit (OSPF) protocol is a link-state IGP tailor-made for IP networks using the Shortest
Path First (SPF) method.
27. PF rting allows you to maintain databases detailing information about the surrounding topology of the
network.

28. The lacy is the time required by a data packet to reach the destination from the source.

29. Neork jiter can be caused by a number of factors and sits in the same bracket of network performance
complications as latency, and packet loss.

30. The Jter and Latency are the crucial metrics to monitor and measure the network performance.
 University of La Salette Inc.
Dubinan East Santiago City
Midterm Examination

(Laboratory)
Name:
Course/Year:
Contact number:

Part I. Essay. Write your answer in the space provided. Your answer must be based on your
interpretation of what you read in this module. (30 pts. each)

Create a Simple Network setup using CiscoPacket Tracer. Record your work in an onscreen recording set up
you can use

Bandicam or whatever software you are comfortable. I want you to show your face while explaining what you
are doing on the screen I want you to first practice before you start recording.

Note I want you to create exactly this one on the video. (Don’t copy the accent of Indian guy!)

https://www.youtube.com/watch?
v=QmL0AXymS5U&fbclid=IwAR0szQKFDMG20ES6sWjRELllEpfyyWYNE1SaFHbDpxPiCsVbwlHoJH6bf
G0