Smart Buildings

     Discrete Structure Class: FYMCA   Members:  36. Onkar Kulkarni. 26. Kunal Ingale. 31. Rutik kadam . 25. Shantanu Inamdar.     Blog: Prim’s Algorithm   Introduction: Prim's Algorithm is a greedy algorithm that is used to find the minimum spanning tree from a graph Prim's algorithm finds the subset of edges that includes every vertex of the graph such that the sum of the weights of the edges can be minimized   Prim's algorithm starts with the single node and explores all the adjacent nodes with all the connecting edges at every step. The edges with the minimal weights causing no cycles in the graph got selected   History: Prim's Algorithm was initially developed in 1930 by Czech mathematician Vojtěch Jarník. Robert Clay Prim independently discovered it in 19571957, and in 19591959 it was rediscovered once more by Edsger Wybe Dijkstra. For these reas...

  Databases for web developers Members who have contributed in this blog Onkar Kulkarni Shantanu Inamdar Kunal Ingale Rutik kadam Do you know that there are more than 300 databases available!!!   Quite surprising. Among these databases, few of them are popular based on their category. Yes, there are categories in databases as well, this will seem confusing while selecting perfect database. This blog is going to answer all of your questions and will give you the idea of most of the databases. But first of all, let us first understand what is database and why it is needed.   For any application to work there is a need of data. According to an article on ‘Forbes’ we produce approximately 2.5 quintillion bytes of data  each day. You can understand this like, we are producing 2.5 billion gigabytes of data each day, and this number is going on increasing. Of course, we need some way to organise this data; such that we can store it and retrieve it faster. Bas...