## How to do Matrix Multiplication in Python – Codewars

You may have Multiplied matrix in your linear algebra class but you know how to multiply to the matrix in python. In Today’s post, we will go through the process of How to do Matrix Multiplication in Python from scratch. Codewars Python in its 5kyu Kata has given us a problem to Multiply two Matrix. Question The … Read more

## What does ANSI Sparc mean in Databases?

An abstract design standard for DBMS is ANSI SPARC. ANSI SPARC stands for American National Standards Institute, Standards Planning And Requirements Committee started in 1975. Follow this link to know more about it HERE The ANSI SPARC paradigm never adopted as a formal standard. No current DBMS systems are entirely based on it( they usually lack complete physical independence and disallow a direct … Read more

## Dynamic Programming

Dynamic Programming is breaking up problem into series of overlapping sub-problems, and build up solutions to larger and larger sub problems. To know more about Dynamic Programming visit HERE Applications of Dynamic Programming Areas Bioinformatics. Control Theory. Information Theory. Operations Research. Computer Science: Theory, Graphics, AI, Systems, etc Some Famous Dynamic Programming Algorithms. Viterbi for … Read more

## Prim’s Algorithm

Prim’s algorithm (also known as Jarník’s algorithm) is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. Full Wikipedia Definition Here. Example of Prim’s Algorithm Remove all the Loops. Loop is going from the Same vertex and coming to the same vertext. In example above vertex F has loop. Remove that. … Read more

## Minimum Spanning Tree

Let H = (V,T) be a subgraph of an undirected graph G = (V,E). H is a Minimum Spanning tree of G if H is both acyclic and connected and removal of edge disconnects it and the sum of the edge costs is minimized. Wikipedia Definition of Minimum Spanning Tree Here. Properties of Spanning Tree … Read more

## Dijkstra Algorithm Greedy Method

Dijkstra Algorithm Greedy Method is a greedy algorithm that solves the single-source shortest path problem for a directed graph G = (V, E) with nonnegative edge weights, i.e., w (u, v) ≥ 0 for each edge (u, v) ∈ E. For the Definition and more visit HERE Greedy Approach: Maintain a set of Explored Nodes S … Read more

## Optimal Caching – Greedy Algorithm

Optimal Caching is a technique that reduces the number of cache misses compared to any other method of cache management. There is a good course on Coursera about Greedy Algorithms Check it out HERE. Cache The cache is a small and fast memory. Cache process the sequence of “page requests”. Page requests are if a … Read more

## Scheduling to Minimize Maximum Lateness

The Definition of Scheduling to Minimize Maximum Lateness is “Given a set of n jobs all of which must be scheduled on a single resource such that all jobs arrive at time s and each job has a deadline di and a length ti, minimize the maximum lateness of the resulting schedule.” To read more visit HERE … Read more

## Interval Partitioning

When data put into a table surpasses all of the existing range partitions. Interval partitioning is an extension of range partitioning that directs the database to automatically build segments of a defined interval. At least one range division must be specified. For Definition and more visit HERE Example There are 10 Lectures, each with a … Read more

## Interval Scheduling Greedy Algorithm

The concept behind Interval Scheduling Greedy Algorithm is that we have a set of jobs (tasks) that need to be scheduled on a machine, and each job j has a start time Sj and a finish time Fj. We can’t schedule two jobs at the same time if they overlap. Our objective is to fill … Read more