Algorithms Cayley’s formula In this article, we have explained the idea of Cayley’s formula which is used to find the number of trees with N nodes and M connected components. We have presented an implementation to calculate Cayley’s formula.
Compiler Design Design of a Lexical Analyzer During the first phase of a compiler, a lexical analyzer is used to scan the input and identify tokens. We can either hand code a lexical analyzer or use a lex program to automatically generate one. In this article we discuss how the lexical analyzer is designed to perform its function.
computational geometry Check if 4 Line Segments form a Rectangle In this article, we will solve the problem of Check if 4 Line Segments form a Rectangle. This is a core problem of Computational Geometry.
Python Rename Conda Environment (2 commands) In this article, we have demonstrated commands using which you can rename a Conda environment. It is not directly possible to rename a conda environment but there are work-arounds.
Python Clone Conda Environment (3 techniques) In this article, we have presented commands to clone a Conda environment that is to create a duplicate conda environment with a new name. There are multiple options like using clone command, update command or copy files directly.
Python Delete Conda Environment (7 commands) In this article, we have explained and presented 7 commands to delete a Conda environment permanently. We can delete a conda environment either by name or by path.
Web Development Clearfix in Bootstrap Clearfix is a straightforward way for removing the floating of an element in a container that is linked to its child element without the need of any additional markup.
C++ Return value of main() in C / C++ The return value of main() function shows how the program exited. The normal exit of program is represented by zero return value. If the code has errors, fault etc., it will be terminated by non-zero value.
Machine Learning (ML) Image compression using K means clustering In this article, we will look at Image Compression using K-means Clustering which is an unsupervised learning algorithm. This is a lossy Image Compression technique.
Culture "Problems on Array: For Interviews and Competitive Programming" book This book "Problems on Array: For Interviews and Competitive Programming" is a deep dive into Array Data Structure, important algorithms and Practice problems on Array. There is no other book like this in the market. A must read.
Compiler Design Constant Folding and Constant Propagation in Compiler Design In this article, we discuss two compiler optimizations (Constant Folding and Constant Propagation) which enable the compiler to produce high performance and efficient assembly code.
Compiler Design Syntax Analysis in Compiler Design In this article, we discuss the second phase in compiler design where written code is evaluated for correctness.
Machine Learning (ML) Xavier Initialization In this article, we have explained the concept of Xavier Initialization which is a weight initialization technique used in Neural Networks.
Machine Learning (ML) Understanding Inception-ResNet V1 architecture In this article, we have explored the architecture of Inception-ResNet v1 model and understand the need for the model.
Compiler Design Lazy code motion in Compiler Design In this article, we will cover the basics of lazy code motion in compiler design. This is the idea of reducing redundant calculations or code size, saving resources or other optimizations.
System Design Basics of Rich Text Format (RTF) In this article, we have explored Rich Text Format (RTF) which is used for transferring documents between word processing software.
Machine Learning (ML) ReLU (Rectified Linear Unit) Activation Function We will take a look at the most widely used activation function called ReLU (Rectified Linear Unit) and understand why it is preferred as the default choice for Neural Networks. This article tries to cover most of the important points about this function.
Time Complexity Time and Space Complexity of Circular Linked List In this article, we have explored Time and Space Complexity of Circular Linked List. We have covered different cases like Worst Case, Average Case and Best Case.
Time Complexity Time and Space complexity of Binary Search Tree (BST) In this article, we are going to explore and calculate about the time and space complexity of binary search tree operations.
Time Complexity Time and Space Complexity of Red Black Tree In this article, we will look at the Time and Space Complexity analysis of various Red-Black Tree operations including searching, inserting, and deleting for worst, best, and average cases.
Time Complexity Time and Space Complexity of Stooge Sort In this article, we will be discussing the time and space complexity of Stooge Sort covering various cases like Worst, Best and Average Case.
Compiler Design Different phases of Compiler In this article, we discuss the different phases of a Complier such as Lexical Analysis, Syntax Analysis, Intermediate Code Generation and others.
Data Structures Array Data Structure In this article, we have explored Array Data Structure in depth. We explore key ideas in Array and how we develop our own custom implementation of Array along with different Array operations.
System Design System Design of Instagram In this article, we have explained the System Design of Instagram which is one of the most used Internet services today with over a Billion users. We have mentioned the technologies used in Instagram.
Algorithms Quick Sort with two pivots (Dual-Pivot) Quick Sort is a Sorting Algorithm that takes a divide-and-conquer approach. We will be looking at how to do this while selecting two pivots points instead of one.
