OpenGenus Tech Review Team - OpenGenus IQ: Learn Algorithms, DL, System Design (Page 73)

Concept of Reverse Proxies

In this article, we have explained the Concept of Reverse Proxies, why it is important and the applications of Reverse Proxies. This is an important topic in System Design.

Algorithms

Union of Two Arrays

In this article, we have explained different approaches to find Union of Two Arrays and provided implementations in C++, Java and Python.

Rust Programming

Unsafe Rust

Rust has a lot of safety checks that ensure memory safety and allow us to completely avoid a lot of the common errors that plague other languages with unrestricted memory freedom.

Algorithms

Check if given point is inside a convex polygon

In this post, we discuss how to check if a given point is inside a convex polygon using the Graham scan algorithm and list application areas for the solution.

JavaScript

Basics of JavaScript (variable, datatype, function, array, loop and more)

In this article, we have explained the Basics of JavaScript (variable, datatype, function, array, loop and more).

Rust Programming

Different ways to terminate and pause program in Rust

Rust has multiple built-in ways to terminate the program, and every method has specific behavior whenever it's called. We're going to see how different functions in Rust (which we use to exit the program) act and how to use them.

Algorithms

Pick’s Theorem in Computational Geometry

In this post, we discuss Pick's theorem, its proof and example use cases where its application would be efficient to solve a problem. Using Pick's Theorem, we can compute the area of simple polygons.

Algorithms

Consistent Hashing

Consistent Hashing is a distributed hashing scheme that operates independently of the number of servers in a distributed hash table.

Algorithms

Number of Integral points inside a triangle

In this article, we have explored an insightful approach/ algorithm to find the number of interior integral points of a triangle. This is an important concept in the field of computational geometry.

List of Mathematical Algorithms

Pollard’s rho algorithm for factorization

Pollard's Rho Algorithm is a very interesting and quite accessible algorithm for factoring numbers. It was invented by John Pollard in 1975. It is not the fastest algorithm by far but in practice it outperforms trial division.

Rust Programming

Deep Dive: Strings in Rust

I've gone into Strings briefly in the beginner's article, but this time, we're going to explore them a little bit more in depth. I will cover some aspects I've already covered only to keep a full 0 to almost 100% info on strings in a single article.

Machine Learning (ML)

Binary Step Function

Binary step function is one of the most common activation function in neural networks out there. But before we get into it let's take a look at what activation functions and neural networks are.

Algorithms

List of Randomized Algorithms

In this article, we have listed several important Randomized Algorithms such as Fisher Yates shuffle, Minimum Cut with Karger's, Matrix Product Verification and many more.

Machine Learning (ML)

Different types of CNN models

In this article, we will discover various CNN (Convolutional Neural Network) models, it's architecture as well as its uses. Go through the list of CNN models.

Software Engineering

First, Best and Worst fit Strategies (Memory Allocation Strategies)

In this article, we will be going through a few strategies which Operating Systems use to fit processes into the main memory during execution. This include First, Best and Worst fit Strategies.

Algorithms

Find mirror image of point in 2D plane

In this article, we will learn how to find the mirror image position of a point in a 2D plane along with C++ implementation of the approach.

Python

Working with CSV files in Python

In this article, we have presented how to work with CSV files (Comma Separated Values) in Python like reading CSV files and processing the information stored in it. We have presented the ideas with Python code examples with output.

Algorithms

3 Sum Smaller Problem

The 3 sum smaller problem is an interesting algorithm problem that we shall be solving in this article. This is an extension of the 3 Sum Problem. In this, we have to select 3 different elements from an array such that the sum is less than a target.

Algorithms

Sum and Number of Divisors of a Number

In this post, we discuss formulas for getting the number of divisors of a number and their sum, additionally we will implement an algorithm that solves this problem.

Time Complexity

Time and Space Complexity of Interpolation Search

In this post, we discuss interpolation search algorithm, its best, average and worst case time complexity and compare it with its counterpart search algorithms. We derive the average case Time Complexity of O(loglogN) as well.

computational geometry

Number of integral points between two points

In this post, we solve an algebraic geometrical problem using programming whereby we find the number of integral points between two given two points.

Culture

Why will time tracking for developers kill your team's morale?

These are the core reasons why will time tracking for developers kill your team's morale.

JavaScript

Different ways to sort array in JavaScript

In this article, we have explained Different ways to sort array in JavaScript which includes sort() method, localeCompare(), orderBy() and much more.

Machine Learning (ML)

Augmented Random Search (ARS)

Augmented random search (ARS)is a model-free reinforcement learning, and a modified basic random search (BRS) algorithm, the algorithm was first published in 2018 by the trio - Horia Mania, Aurelia Guy, and Benjamin Recht from the University of California, Berkeley.

Algorithms

Orientation of three ordered points

In this article, we will discuss about algorithms to detect the orientation of three given ordered points. Orientation imply collinear, Clockwise or Anti-clockwise.