0
It is a basic algorithm for generating lines on computer screen.
line is generated between given 2 endpoints
Wiki User
∙ 14y ago
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.
Distance Vector protocols use what algorithm?
Distance Vector protocols use the Bellmanâ??Ford algorithm. The ARPANET system relied on Distance Vector protocols as their main routing technique in the early 80s.
How does the bellman ford algorithm work?
This distance-vector algorithm works by computing the shortest path , and considers weights. The algorithm was distributed widely in the RIP protocol.
Space vector modulation for matrix converter?
space vector modulation id an algorithm of the control of the control of pulse width modulation
What is the drawback of distance vector algorithm?
The distance vector algorithm does not take into account current traffic, type of link, speed of link, type of endpoint routers, etc. It cannot adjust for changes in network traffic and bottlenecks.
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. :)
Why rip protocol is known as didtance vector algorithm can any one explain?
The reason RIP is called a distance-vector algorithm is because of the way it determines the "best path" from one route to another. This is accomplished by something called a "cost metric", meaning that the "cost" of a route determines whether a path is a better path than some other route. A path may be more "costly" than another based on the distance it must travel, or the number of networks it must go through to reach the source. Since the cost metric is based primarily on distance and no other factors, it is known as a distance vector algorithm when determining route cost.
What happens after 15 hops for rip routing method?
what happens in RIP ROUTING method after the 15 hop
What is the main difference between OSPF and RIP?
Both uses Distance vector algorithm...... . updates the routing table for every 30 seconds. and in OSPF requires hoping reneval of routing table
What are the applications of Eigenvalue and Eigen vector in computer science?
Eigenvectors and eigenvalues are important for understanding the properties of expander graphs, which I understand to have several applications in computer science (such as derandomizing random algorithms). They also give rise to a graph partitioning algorithm. Perhaps the most famous application, however, is to Google's PageRank algorithm.
Explain what the count-to-infinity problem is with distance vector routing?
I am not too good with the details yet but here is what I know... In the distance vector routing algorithm, when the link cost for any link drops this good news travels very fast. But when the link cost for any link increases, this bad news takes many iterations of the algorithm to travel. This problem that the distance vector algorithm has with propagation of bad news is called the count to infinity problem. When I learn more about the details of this, I would come back to this page and add more details. oh btw, I found this great link for a short explanation See related links You might also want to check out poison-reverse and horizon-splitting
What is the difference between a high frequency UPS and a Low frequency UPS?
The difference is in sine wave generation algorithm. In HI freq - it is 30kHz signal, modulated by 50Hz.
