by admin | Jun 7, 2015 | sem3
Communication Systems In telecommunication, a communication systems is a collection of individual communications networks,transmission systems, relay stations, tributary stations, and data terminal equipment (DTE) usually capable of interconnection and inter operation...
by admin | Jun 7, 2015 | sem3
Noise Calculation noise calculation is the process of calculating the level of noise immission using the metric dB(A). Noise immission is created by noise sources (noise emission) of various types which are propagating noise into the environment. A single source will...
by admin | Jun 7, 2015 | sem3
Floyd warshall algorithm The Floyd warshall algorithm is for solving the All Pairs Shortest Path problem. The problem for finding shortest distances between every pair of vertices in a given edge weighted directed Graph. An Example: Input: graph[][] = { {0, 5,...
by admin | Jun 7, 2015 | sem3
Dijkstra’s algorithm Dijkstra’s algorithm is very similar to Prim’s algorithm for minimum spanning tree. Like Prim’s MST, we generate a SPT (shortest path tree) with given source as root. We maintain two sets, one set contains vertices included in shortest path...
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....
