Algorithms Cycle in a graph using degree of nodes of the graph There are different ways of detecting cycle in a graph. Let us understand how to detect cycles in an undirected graph using the degree of each vertex.
Algorithms Transpose Graph In this article, we will explore the idea of Transpose Graph along with the basics of Graph Data Structures. We have presented an algorithm to get the transpose of a graph as well.
Algorithms Find path with maximum average value in a 2D matrix Given a square matrix of size N * N, where each cell is associated with a specific cost. Find the path with maximum average value in the 2D matrix. The path should start from top left point and end at bottom right point.
Data Structures LogLog (Probabilistic Data Structure for Cardinality) LogLog is a Probabilistic Data Structure that uses the idea of hashing to compute Cardinality of a given set.
Data Structures MinHash (Probabilistic Data Structure for Similarity) MinHash was originally an algorithm to quickly estimate the jaccard similarity between two sets but can be designed as a probabilistic data structure that quickly estimates how similar two sets are.
Algorithms Tomohiko Sakamoto Algorithm Tomohiko Sakamoto Algorithm is used to find the Day of the week for a given date. The date is provided according to the Gregorian Calendar.
Software Engineering Tough Interview questions on C Programming These are some of the most tough Interview questions on C Programming which tests your knowledge on how well you know the language. Even if you are not a master of C, you must try it once.
Contribute and grow 🌱 with Hacktoberfest 2020 Hacktoberfest is a month long virtual event where you can make four contributions towards your favorite Open Source project (such as Cosmos by OpenGenus). You will not only get to learn new things but also get free goodies delivered to you at your doorstep.
Data Structures Count Min Sketch A count min sketch data structure is a probabilistic data structure (a data structure that provides an approximate solution) that keeps track of frequency.
Data Structures Radix Tree [Compact version of Trie] radix tree is a compact version of a trie. It takes advantage of this and will store multiple characters / string of text in an edge instead to reduce the number of extra edges and nodes needed.
Data Structures Two Stack Model / Split Buffer for Text Editors In two stack model, one stack will represent all the contents left of the cursor while the other stack will represent all the contents right of the cursor. Similar is the idea behind Split buffer.
Data Structures Data Structures used in Text Editors A text editor uses a wide range of data structures to implement different features like search, replacing text and much more. These include char buffer, gap buffer, two stack model, doubly linked list and much more.
Algorithms Reverse a doubly linked list in C++ In this article, we are going to see how to reverse a doubly linked list by reversing the links of each node (without swapping values of nodes) and have implemented the solution using C++.
Algorithms To check if the linked list is a circular linked list (2 methods) We will be seeing two efficient methods to determine whether the given linked list is a circular linked list or not. With this, we solve the problem in linear time.
Software Engineering Chrome Dinosaur (T-Rex 🦖) game with Processing in Java We have designed and developed the Chrome dinosaur game (T-Rex game) and implemented it in Java using Processing.
Software Engineering Basics of Hyper Text Transfer Protocol (HTTP) In this article, we have discussed about HTTP. HTTP stands for Hyper Text Transfer Protocol and is the backbone of the Internet.
Algorithms Travelling Salesman Problem (Bitmasking and Dynamic Programming) In this article, we will start our discussion by understanding the problem statement of The Travelling Salesman Problem perfectly and then go through the basic understanding of bit masking and dynamic programming.
Algorithms Travelling Salesman Problem (Basics + Brute force approach) In this article we will start our discussion by understanding the problem statement of The Travelling Salesman Problem perfectly and then go through the naive bruteforce approach for solving the problem using a mathematical concept known as "permutation"
Algorithms Cycle Detection Algorithms A cycle in a data structure as we have already seen is a condition with no end. A few popular cycle detection algorithms are Floyd's cycle detection algorithm and Brent’s Cycle Detection Algorithm.
Data Structures Finding the length of a loop in linked list In this article, we will look at the method of finding the length of a loop in a linked list. For that you should be able to understand Floyd's loop detection algorithm.
Data Structures Detect a loop in a linked list (3 methods) A Loop in a linked list is a condition when a Linked list does not have any end. We have explored different ways to detect loop in a linked list like by marking visited nodes, using hashmap and Floyd's cycle finding algorithm.
Machine Learning (ML) Calculate output size of Convolution In this article, we have illustrated how to calculate the size of output in a convolution provided we have the dimensions of input data, kernel, stride and padding.
CS History Computer History on 20th February 20th February is an important day in Computer History as Ken Olsen was born on this day in 1926 and he is the man behind the World's first commercial computer and DEC.
CS History Computer History on 19th February Today (19th February) is an important day in Computer History as today the war between Blu-ray and HD DVD ended, the first warrant to search a computer was issued and several other historic events.
CS History Computer History on 18th February We covered some of the major events that took place on 18th February with respect to Computer history such as birth of Alessandro Volta, the man behind the first electric battery and the opening of the first ComputerLand franchise in 1977.
