0
Add your answer:
Earn +20 pts
How do you search a particular element from the vector?
To search a particular element from the vector, use the find() algorithm. If the vector is sorted, you can use the binary_search() algorithm to improve efficiency. Both algorithms can be found in the <algorithm> header in the C++ standard library.
What type of routing algorithm does BGP use?
Best Path Algorithm, also known as Path-Vector Routing Internetworking with Cisco and Microsoft Technologies pg. 297 If you are in net+ 3rd edition like me, I do not belive this protocol is mention which leads me to believe the answer we are looking for in the study guide is Distance Vector, since BGP is a distance vector protocol. It can only be one of two in this case afaik, distance vector or Link State. :)
Where we can use dijkstra's algorithm?
A practical application is in certain routing protocols, like OSPF. The problem it solves is to search for the "shortest" path to each destination - "shortest" meaning the one that has the lowest "distance" or "metric" according to the criteria used. Dijkstra's algorithm is easy to use and is a good graph search algorithm to use when it is hard to calculate the heuristics.
How are LSAs used to manage updates to the routing topology in a link state protocol environment?
Link-state advertisements (LSAs) -- A link-state advertisement (LSA) is a small packet of routing information that is sent between routers.Topological database -- A topological database is a collection of information gathered from LSAs.SPF algorithm (Dijkstra algorithm) -- The shortest path first (SPF) algorithm is a calculation performed on the database resulting in the SPF tree.Routing tables -- A list of the known paths and interfaces.Link State Routing Protocols converge more quickly and they are less prone to routing loops than Distance Vector algorithms. On the other hand, Link State Routing Protocols require more CPU power and memory than distance vector algorithms. Link State Protocols use a hierarchical structure that limits the distance that a Link-State Advertisement (LSA) need to travel. Link State Protocols use multicasts to share the routing information. Only the routers which run Link State protocol only process the updates. Link State routers send updates only when there is a change in the state of the network (incremental updates).
What routing protocol depends on the dual algorithm to calculate the shortest path?
Enhanced Interior Gateway Protocol It is a Cisco proprietary protocol. It uses bandwidth and delay by default to calculate the best path. It can also use load and delay, but these are usually not used. It is a distance vector routing protocol. It keeps a topology map, but it is only similar to the topology map of link state routing protocols.
Determining cost in IP routing?
Determining the cost metric of a hop in a route can be done many different ways, depending on the protocol you are using. The simplest would be purely distance, which is what distance-vector protocols such as RIP will use.You can get more complicated by using several factors, such as distance, speed of the link, traffic on the link, the actual router models used at both ends, etc. This is what link-state algorithms use, such as OSPF.
List down the names of any three parameters on which you analyze an algorithm?
what is algorithm and its use there and analyze an algorithm
What does protocols use?
pop3
What does the Cisco IOS use to calculate the OSPF cost to a destination network?
OSPF stands for open shortest path first. OSPF is an exterior routing protocol. OSPF uses Path vector routing algorithm.
Why in dot product you use cos and in vector product sin?
We use the dot product cos and in vector we use the vector product sin because of the trigonometric triangle.
Is the use of an algorithm to scramble data into a format that can be read only by reversing the algorithm?
Encryption
An algorithm to find whether a directed graph is connected or not?
You can use a The Depth-First Search algorithm.
