Minimal Spanning Tree using Prim's Algorithm
BunksAllowed
June 30, 2022
0
Prim's algorithm starts from any vertex of the graph and marks it as a visited vertex. It selects a minimum weighted edge from the ...
Read More
Single Source Shortest Path: Dijkstra's Algorithm
BunksAllowed
June 30, 2022
0
Dijkstra's algorithm is used to solve the single-source shortest-path problem for a graph having non-negative weights of edges. Thi...
Read More
Fractional Knapsack using Greedy Approach
BunksAllowed
June 30, 2022
0
Let us consider that there are n items in a store. The weight of item i is wi (where wi > 0) and the worth of the item is vi (where...
Read More
Greedy Method
BunksAllowed
June 30, 2022
0
Greedy algorithms always go for the seemingly best next thing, without any regard for the future, and never change your mind about the ...
Read More
All Pair Shortest Path: Floyd-Warshall Algorithm
BunksAllowed
June 30, 2022
0
The Floyd-Warshall Algorithm is a fundamental method employed to address the all-pairs shortest path issue, which calculates the sho...
Read More
Single Source Shortest Path: Bellman-Ford Algorithm
BunksAllowed
June 30, 2022
0
The Bellman-Ford Algorithm is a single-source shortest path algorithm used to find the shortest path from a source vertex to all other...
Read More
Finding Longest Common Subsequence (Dynamic Programming)
BunksAllowed
June 30, 2022
0
Dynamic programming can be effectively applied to solve the Longest Common Subsequence (LCS) problem. The LCS is the longest substring...
Read More
Matrix Chain Multiplication (Dynamic Programming)
BunksAllowed
June 30, 2022
0
This problem is the most popular example of DP. In this problem, we determine the optimal sequence of multiplication operations for a s...
Read More
Dynamic Programming Method
BunksAllowed
June 30, 2022
0
Dynamic programming is a design technique similar to divide and conquer, but with a big difference. In Divide-and-Conquer algorithms a p...
Read More
Quick Sort (Divide and Conquer Technique)
BunksAllowed
June 30, 2022
0
Source code for Quick Sort #include<stdio.h> #include<stdlib.h> #include<math.h> void swap(int *a, int *b) { in...
Read More
Merge Sort (Divide and Conquer Technique)
BunksAllowed
June 30, 2022
0
Merge sort is a highly efficient sorting method that is particularly effective at organizing enormous datasets. The methodology employe...
Read More
Max-Min Problem (Divide and Conquer Technique)
BunksAllowed
June 30, 2022
0
MaxMin is a recursive algorithm to find the largest and smallest elements from a set of elements. Let us consider an array ...
Read More
Binary Search (Divide and Conquer Technique)
BunksAllowed
June 30, 2022
0
Binary Search is the simplest and most well-known example of this paradigm. If a set of n elements is given where the numbers are...
Read More
Divide and Conquer Technique
BunksAllowed
June 30, 2022
0
This is a top-down technique for designing algorithms in which a problem is divided into smaller sub-problems, the sub-problems are ...
Read More
Complexity Analysis of an Algorithm
BunksAllowed
June 30, 2022
0
The efficiency of an algorithm is measured based on space usage and time consumption . We will say that this algorithm is efficient i...
Read More
Introduction to Algorithms
BunksAllowed
June 30, 2022
0
An algorithm is a set of steps defined for solving a problem in finite time and space. Generally, an algorithm is written to express th...
Read More
MySql Database Backup & Restore
BunksAllowed
June 29, 2022
0
Sometimes, you may want to keep a backup copy of the mysql database. There are several methods to back up a MySQL database, one of which i...
Read More
MySQL Event Scheduling
BunksAllowed
June 29, 2022
0
In large applications, like shopping carts, a huge volume of data is managed. This huge volume of data makes the database overloaded. Thus, ...
Read More
Group By in MySQL Queries
BunksAllowed
June 29, 2022
0
In the previous books table, we have added one more attribute category to differentiate between Programming Languages and Theory Papers. The...
Read More
Stored Procedures and Functions In MySQL
BunksAllowed
June 29, 2022
0
In MySQL, a stored procedure is nothing but a set of SQL statements that are stored in the server. The advantage of using a stored procedure...
Read More
Aggregate Functions in MySQL
BunksAllowed
June 29, 2022
0
Many aggregate functions are available in MySQL. The commonly used functions are discussed in this chapter. In this chapter, we are consider...
Read More
Order By in MySQL Queries
BunksAllowed
June 29, 2022
0
Using a select query, if you want to fetch data in the order of an attribute, the order by the statement is necessary. Let us retrieve the n...
Read More
Posts
![Distributed Compute and Data Management Across an IoT System [Role of Edge, Fog, Cloud Computing]](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEicDbPPMTY3P4TtMt9Mdq9G1SQFmwWMC3-a_7LaJHfXdZbvMDxuiyXCwG_wa0ppPxIMjw1SBpCRhDahA2uMOxA4uUkqpBiPOFDRY1KMG01ZVJjjsgmJrW98LU04FTZLRzdw_rUmYg_Elfa0M7_PWwkf20kRdnV0Q7FTHpNT8G_oE4ct5qqexYBPUNrC6PkC/s72-c/brunette-computer-computer-key.jpg)
