Found 547 Articles for Algorithms

Carrier Sense Multiple Access with Collision Detection (CSMA/CD) is a network protocol for carrier transmission that operates in the Medium Access Control (MAC) layer. It senses or listens whether the shared channel for transmission is busy or not, and defers transmissions until the channel is free. The collision detection technology detects collisions by sensing transmissions from other stations. On detection of a collision, the station stops transmitting, sends a jam signal, and then waits for a random time interval before retransmission.AlgorithmsThe algorithm of CSMA/CD is:When a frame is ready, the transmitting station checks whether the channel is idle or busy.If ... Read More

P-persistent CSMA is an approach of Carrier Sense Multiple Access (CMSA) protocol that combines the advantages of 1-persistent CMSA and non-persistent CMSA. Using CMSA protocols, more than one users or nodes send and receive data through a shared medium that may be a single cable or optical fiber connecting multiple nodes, or a portion of the wireless spectrum.In p-persistent CSMA, when a transmitting station has a frame to send and it senses a busy channel, it waits for the end of the transmission, and then transmits with a probability p. Since, it sends with a probability p, the name p ... Read More

1-persistent CSMA is an aggressive version of Carrier Sense Multiple Access (CMSA) protocol that operates in the Medium Access Control (MAC) layer. Using CMSA protocols, more than one users or nodes send and receive data through a shared medium that may be a single cable or optical fiber connecting multiple nodes, or a portion of the wireless spectrum.In 1-persistent CSMA, when a transmitting station has a frame to send and it senses a busy channel, it waits for the end of the transmission, and transmits immediately. Since, it sends with a probability 1, the name 1 – persistent CSMA is ... Read More

Non-persistent CSMA is a non – aggressive version of Carrier Sense Multiple Access (CMSA) protocol that operates in the Medium Access Control (MAC) layer. Using CMSA protocols, more than one users or nodes send and receive data through a shared medium that may be a single cable or optical fiber connecting multiple nodes, or a portion of the wireless spectrum.In non-persistent CSMA, when a transmitting station has a frame to send and it senses a busy channel, it waits for a random period of time without sensing the channel in the interim, and repeats the algorithm again.AlgorithmThe algorithm of non-persistent ... Read More

In this section we will see some common mathematical problems and their possible way solve using different computational algorithms. We will see how to solve differential equations, integrations and some other complex mathematical problems. In this Section We are going to cover − Convert Infix to Postfix Expression Convert Infix to Prefix Expression Evaluate Postfix Expression Secant method to solve non-linear equation Trapezoidal Rule for definite integral Simpson's 1/3 Rule for definite integral Linear Regression Lagrange Interpolation Runge-Kutta 4th order rule for differential equation Lucky Numbers Decimal to Binary conversion Find LCM of two numbers Find ... Read More

In theoretical analysis of algorithms, it is common to estimate their complexity in the asymptotic sense, i.e., to estimate the complexity function for arbitrarily large input. The term "analysis of algorithms" was coined by Donald Knuth. Algorithm analysis is an important part of computational complexity theory, which provides theoretical estimation for the required resources of an algorithm to solve a specific computational problem. Most algorithms are designed to work with inputs of arbitrary length. Analysis of algorithms is the determination of the amount of time and space resources required to execute it. Usually, the efficiency or running time of an ... Read More

The graph is a non-linear data-structure, which consists finite number of nodes and a set of edges which are used to connect a pair of nodes. The graphs are used to solve some real-time problems to represent network etc. In different social networks, the graphs are used. In this Section We are going to cover − Bi-Connected Graph Checking Breadth First Search (BFS) for a Graph Bridges in a Graph Check if a given graph is tree or not Connectivity in a directed graph Depth First Search (DFS) for a Graph Detect Cycle in a an Undirected Graph Detect ... Read More

The Dynamic Programming is one of the different algorithm paradigm. In this approach, the problems can be divided into some sub-problems and it stores the output of some previous subproblems to use them in future. It helps to reduce the computational time for the task. There are two types of the Dynamic Programming Technique − Overlapping Subproblem Optimal Substructure In this Section We are going to cover − Box Stacking Problem Collect maximum points in a grid using two traversals Compute sum of digits in all numbers from 1 to n Count Binary String without Consecutive ... Read More

Greedy algorithm is designed to achieve optimum solution for a given problem. In greedy algorithm approach, decisions are made from the given solution domain. As being greedy, the closest solution that seems to provide an optimum solution is chosen. Greedy algorithms try to find a localized optimum solution, which may eventually lead to globally optimized solutions. However, generally greedy algorithms do not provide globally optimized solutions. In this Section We are going to cover − Activity Selection Problem Dijkstra’s Algorithm for Adjacency List Representation Dijkstra’s Shortest Path Algorithm Huffman Coding Algorithm Efficient Huffman Coding for Sorted Input Job Sequencing ... Read More

Sorting refers to arranging data in a particular format. Sorting algorithm specifies the way to arrange data in a particular order. Most common orders are in numerical or lexicographical order. The importance of sorting lies in the fact that data searching can be optimized to a very high level, if data is stored in a sorted manner. Sorting is also used to represent data in more readable formats. In this Section We are going to cover − Bubble Sort Bucket Sort Comb Sort Counting Sort Cycle Sort Heap Sort Insertion Sort Merge Sort Pigeonhole Sort Quick Sort Radix Sort ... Read More