OpenGenus Tech Review Team

Machine Learning (ML)

Boosting, an Ensemble Method

We have covered the idea of Boosting in depth along with different types of Boosting algorithms, benefits and challenges of Boosting.

Time Complexity

Basics of Time Complexity Analysis [+ notations and Complexity class]

We have explored the Basics of Time Complexity Analysis, various Time Complexity notations such as Big-O and Big-Theta, ideas of calculating and making sense of Time Complexity with a background on various complexity classes like P, NP, NP-Hard and others.

Time Complexity

Time Complexity for non-comparison based Sorting

We have explained why the minimum theoretical Time Complexity of non-comparison based sorting problem is O(N) instead of O(N logN). This is a must read. It will open up new insights.

Time Complexity

Time & Space Complexity of Binary Search [Mathematical Analysis]

We have presented the Mathematical Analysis of Time and Space Complexity of Binary Search for different cases such as Worst Case, Average Case and Best Case. We have presented the exact number of comparisons in Binary Search.

Time Complexity

Time & Space Complexity of Linear Search [Mathematical Analysis]

We have presented the Mathematical Analysis of Time and Space Complexity of Linear Search for different cases such as Worst Case, Average Case and Best Case. We have presented the exact number of comparisons in Linear Search.

Software Engineering

How to use Console in Chrome DevTools?

We have covered how to use Console which is one of the development tools in the Chrome browser. The Console in Chrome DevTool helps to debug webpages and investigate external webpage as well.

Algorithms

Probability of Collision in Hash Function [Complete Analysis]

We present the Mathematical Analysis of the Probability of Collision in a Hash Function. You will learn to calculate the expected number of collisions along with the values till which no collision will be expected and much more.

Algorithms

Inside Outside Test [2 algorithms: Even-Odd and Winding Number]

In Computer Graphics, Inside Outside is performed to test whether a given point lies inside of a closed polygon or not. Mainly, there are two methods to determine a point is interior/exterior to polygon: Even-Odd / Odd-Even Rule or Odd Parity Rule and Winding Number Method.

Algorithms

Invert / Reverse a Binary Tree [3 methods]

Inverting a binary tree is one of the most common questions asked in the interviews of many companies. In this article, we will see in detail as to how one can understand and tackle this task of inverting a binary tree using recursion, stack and queue.

Algorithms

Construct BST from pre-order traversal (using monotonic stack; no recursion)

This article discusses on a way in which, Binary Search Tree (BST) can be reconstructed when corresponding pre-order traversal of the tree is input, using a concept of monotonic stack.

Machine Learning (ML)

Architecture of DenseNet-121

We have explored the architecture of a Densely Connected CNN (DenseNet-121) and how it differs from that of a standard CNN. DenseNet-121 has 120 Convolutions and 4 AvgPool.

Algorithms

Why O(1) time complexity does not exist? + Memory Model

We have taken an in-depth look at the operations or algorithms that have a constant time in terms of asymptotic notation of time complexities. Is O(1) really a practical way of representing the time complexity of certain algorithms/ operations?

Algorithms

Reversal Algorithm to rotate an array

We have discussed Reversal algorithm. It is widely used for rotating arrays. This algorithm is specifically useful for rotating array by any number of places because it efficiently does the operation in O(N) time and O(1) auxiliary space.

Software Engineering

RPC vs REST

We have covered the differences between REST and RPC. REST stands for Representational State Transfer and RPC stands for Remote Procedural Call.

Algorithms

Deleting Duplicate Characters of String

We have explored the problem of Deleting Duplicate Characters of String such that the resulting string is lexicographically the smallest among all possibilities.

Algorithms

k-th Largest Element in a stream

In this article, we will discuss the problem Kth largest Element in a stream, and understand the different methods that can be used to solve the problem efficiently.

Algorithms

Shuffle an array [2 approaches]

We have explored two approaches to shuffle an array. The first approach uses an auxiliary array while the second approach is in-place and is known as Fisher Yates Algorithm.

Software Engineering

2D list in C++ STL (Defining and Sorting)

In this article, we will begin with a brief recap of what lists are, followed by an introduction to 2-dimensional lists (2D list), where we shall explore creating and defining 2D lists in C++ STL and sorting them.

Data Structures

Array Interview Questions [MCQ with answers]

This is the list of Interview Questions based on Array Data Structure. You must practice these Multiple Choice Questions. This will help you master Array Coding Questions for Interviews at companies like Google and Microsoft.

Algorithms

Brian Kernighan's Algorithm

In this article, we will learn what are set bits and how to count them. And we will also learn about Brian Kernighan's algorithm a famous algorithm to find the number of set bits in a number.

Algorithms

Number of sub-strings with each character occurring even times

This article discusses different algorithmic approach which we can use to find number of sub-strings with each character in it occurring even number times for a given string.

Machine Learning (ML)

Basics of Gradient descent + Stochastic Gradient descent

We have explained the Basics of Gradient descent and Stochastic Gradient descent along with a simple implementation for SGD using Linear Regression.

System Design

System Design of a Firewall

We have explored the System Design of a Firewall along with the basics of Firewall and a sample Firewall Design in a real system.

Software Engineering

Best Coding Practices

Coding best practices are a set of informal rules that the software development community employs to help improve software quality. We have explained several such practices.

Algorithms

Boyer Moore majority vote algorithm [Majority Element]

Boyer Moore voting algorithm is used to find the majority element among the given sequence of elements which occurs more than N/2 times, in linear time complexity and constant space complexity.