by admin | Jun 7, 2015 | sem3
Bellman Ford algorithm Bellman Ford algorithm is also simpler than Dijkstra and suites well for distributed systems. But time complexity of Bellman Ford algorithm is O(VE), which is more than Dijkstra. Algorithm Following are the detailed steps. Input: Graph...
by admin | Jun 7, 2015 | sem3
Prim’s algorithm Prim’s algorithm is also a greedy algorithm. It starts with an empty spanning tree. The idea is to maintain two sets of vertices. The first set contains the vertices already included in the MST, the another set contains the vertices not yet included....
by admin | Jun 7, 2015 | sem3
Kruskal’s Minimum Spanning Tree Algorithm What is Minimum Spanning Tree? Given a connected and undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all the vertices together. A single graph can have many different spanning trees. A...
by admin | Jun 6, 2015 | sem3
Topological sort Topological sort : an ordering of the vertices in a directed acyclic graph, such that: If there is a path from u to v, then v appears after u in the ordering. Types of graphs: The graphs must be directed: otherwise for any edge (u,v) there could be a...
by admin | Jun 6, 2015 | sem3
Internal Noise Electrical interference generated within a device or circuit itself. This is due to the functioning of active and passive component inside the device itself. Internal noise can be reduced by proper receiver design. Internal noise can be further...
by admin | Jun 6, 2015 | sem3
External Noise External Noise : It is external to the communication equipment like radio receiver ,television ,telephone ,etc… External nose are uncontrollable at a given geographical location. External noise can be further classified into three types as...
