Learn different algorithms & computer science related topics. Also Get familiar with core developments in various fields of computer science.
Minimum spanning tree is a tree which spans through all nodes with minimum aggregate cost. It is important to find minimum spanning tree due to multiple reasons, which includes finding approximation algorithms for NP-hard problems, learning salient features in real time face verification, routing protocols, etc.
A community is a structure which is densely intra-connected and sparsely inter-connected. Community Detection is the process of finding community in the given network.
Semantic networks are graphical representation of the interconnection between different nodes. They are useful in representing knowledge and is heavily used in the field of Artificial Intelligence.
Graphs are set of vertices connected to each other using edges, anything related to study of Networks comes under graph theory. Its an important field in computer science and an interesting one at that.
A Markov chain is a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event.
Linked list is a fundamental data structure which is used multitude of applications and can be used almost everywhere. It is a fundamental data structure using which multiple different datastructure can be formed.
Merge sort is a sorting algorithm which uses divide and conquer paradigm. It primarily divides the sorting into parts and stitches up the solution together. To know more about Merge sort, check out the post.