DSA
Recurrence relation time complexity questions
Q1Quick sort recurrence relation is T(n)=T(n-1)+n find worst case time complexity . T(n)=T(n-1)+n Find T(n-1) T(n-…
Read more
DSA
Mergesort implementation in C
Mergesort implementation in C Mergesort based on divide and conquer technique. so first divide the array element recursively void mergesort ( int…
Read more
DSA
Dijkstra algorithm to find shortest path C code
Dijkstra algorithm to find shortest path C code Using dijkstra shortest path is Output enter number of node3 enter cost matrix 0 1 3 1 0 1 3 1 0 d…
Read more
DSA
Matrix chain multiplication using dynamic programming C code
Matrix chain multiplication using dynamic programming C code Consider three matrices of matrix Order A 5*4 B …
Read more
DSA
Longest common subsequence using dynamic programming C code
Longest common subsequence using dynamic programming C code Let S1=abcca S2=abcc Longest common subsequence between S1 and S2 is length 4. #i…
Read more
DSA
Greedy Algorithm and Knapsack problems
Greedy Algorithm and Knapsack problems Greedy Algorithm is used to solve knapsack problem.Fractional knapsack problem in which fractions of items c…
Read more
DSA
Dynamic Programming Characteristic & Application of Dynamic Programming
Dynamic Programming Characteristic and Applications Dynamic programming is a problem solving technique that like divide and conquer solves problem …
Read more
DSA
Maximum Flow and Ford-Fulkerson Algorithm.
Max Flow and Ford-Fulkerson Algorithm Some real life problems like those involving the flow of liquids through pipes,current through wires and deli…
Read more
DSA
Hashing with open addressing with Quadratic probing
Hashing with open addressing Quadratic probing and double hashing In open addressing all elements are stored in the hash table itself .That is eac…
Read more
DSA
Hash Function and Hashing with open addressing(Linear probing)
Hash function and hashing with open addressing(Linear probing) Hash function Hash function is a function which when applied to the key produces an i…
Read more
DSA
Hashing and Methods used to implement hashing(Hashing with chaining)
Hashing and Methods used to implement hashing(Hashing with chaining and hashing with open addressing) Hashing is a widely used class of data struct…
Read more
DSA
Greedy Algorithm and Activity selection problem
Greedy Algorithm and Activity selection problem Greedy algorithm is used to solved greedy algorithm.Greedy algorithm may provide a solution that is…
Read more
DSA
Traversing graph using Breath first search
Traversing using breath first search Graph algorithm require one systematically examine the nodes and edges of a graph.One way of traversing is call…
Read more
DSA
Minimum spanning tree prim's algorithm to find minimum spanning tree.
Minimum spanning tree and prim's algorithm to find minimum spanning tree. Spanning tree of a graph is just a sub graph that contains all the ver…
Read more
DSA
Spanning tree and Kruskal algorithm to find minimum spanning tree.
Spanning tree and Kruskal algorithm to find minimum spanning tree. Spanning tree is a sub-graph that contains all the vertices and is a tree. A gra…
Read more
Social Plugin