Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Shortest path
The dijkstra algorithms four steps to discover what it called the shortest path tree .
a.The algorithm beings to build the tree identifying its root. The root of each router tree is the router itself. The algorithm them attaches all nodes that can be reached from that root in other words. All of the other neighbour nodes and are are temporary at this step.
b.The algorithm compares the tree temporary acres and identifies the are with the lowest commutative cost. This are and the node to which it connecters are now a permanent part of shortest path tree.
c.The algorithm examines the database and identifies every node that can be reached from it chosen node. These nodes and their arcs are added temporarily to the tree.
d.The last two steps are repeated until every node in the network has become a permanent part of the tree. The only permanent arcs are those that represent the shortest route to every node.
The cost number next to each node represents the cumulative cost from the root node not the cost of the individual arc. The second third steps repeated until four more nodes have becomes permanent.
State the statements about PPP and SLIP for WAN communications? Ans) a) PPP uses its Network Control Programs (NCPs) component to encapsulate many protocols. b) SLIP
With a transaction server, the client requests remote procedures that reside on the server with an SQL database engine. These remote processes on the server execute a group of SQL
Parallel Balance Point In order to implement a parallel algorithm on a parallel computer, K number of processors is needed. It may be noted that the given input is assigned to
Computer Networks 1. Differentiate WAN and LAN. 2. Describe the TCP/IP Reference Model with diagram. 3. Explain Circuit switching and message switching. 4. List the fu
Q. Flow control in TCP? The amount of data a source is able to send before receiving an ACK from the destination Whether to send 1 byte of data as well as wait for ACK
Q. What are the important benefits of computer network? Ans: Important benefits of computer networks are: - Resource sharing - Higher reliability - Higher flexibili
What is a Associative Memory
Token Passing Station is able to send only when it receives a special frame called a token Token circulates around the ring If station wishes to sen
Linear Array: This is a most basic interconnection pattern. Processors are connected in a linear one-dimensional array. The first as well as last processors are attached with one a
Q. Show the Communication between Switches? Communication between Switches - Must know which station belongs to which VLAN as well as membership of stations connected to
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd