Sourajeet MohantyData Synchronization: operating systems.Processes can be Synchronous, Asynchronous and Independent. Often there occurs a Race Condition. A race condition occurs when multiple…3 min read·Nov 9, 2020----
Sourajeet MohantyPairs whose sum is divisible by a given numberIn this article at OpenGenus, we shall see how to find the number of pairs in the array of length N whose sum is divisible by a certain…5 min read·Jul 8, 2020----
Sourajeet MohantyFundamentals of Euler path in Graph TheoryAn Euler path is a path that uses every edge of the graph exactly once. Edges cannot be repeated. This is an important concept in…5 min read·Jul 8, 2020----
Sourajeet MohantyBreadth first search (BFS)Breadth first search (BFS) is one of the most used graph traversal techniques where nodes at the same level are traversed first before…5 min read·Jul 8, 2020----
Sourajeet MohantySTACKS: a genesis of data structurestacks come under linear data structure.They follow LIFO operations.Now lifo operations simply refer that any data elements entered form a…3 min read·Sep 2, 2019----
Sourajeet MohantyGreedy Algorithm’s: activity selection.We may never appreciate being greedy, we may still be greedy and be trolled or insulted by others for being so.But in coding we got to be…3 min read·Jul 29, 2019----
Sourajeet MohantyHeap’s algorithm: permutation of ‘ n’ different objects.Heap’s algorithm generates all possible permutations of n objects. It was first proposed by B. R. Heap in 1963. It works by the principle…2 min read·Jul 25, 2019----
Sourajeet MohantyEuclid’s GCD Method: iterative and recursive.Gcd of two numbers is the greatest common divisor existing between them.For example the gcd of 30 and 50 is 10.it seems easy to work out…2 min read·Jul 23, 2019----
Sourajeet MohantyDijkstra’s algorithm: shortest path finding algorithmDijkstra’s algorithm is an algorithm for finding the shortest path between nodes in a graph, which may represent, for example, road…4 min read·Jul 22, 2019----