OpenGenus IQ: Learn Algorithms, DL, System Design (Page 60)

Number of substrings in a string of integers that are divisible by 4

In this article, we have explored algorithms to find the Number of substrings in a string of integers that are divisible by 4.

CSS

Transitions in CSS

CSS Transitions allows property changes in CSS values to occur smoothly over a specified duration.

Machine Learning (ML)

Compare two different Audio in Python

In this article, we have explored how to compare two different audio in Python using librosa library.

Algorithms

Autobiographical Numbers

In this article, we have explored the idea of Autobiographical Numbers along with the algorithm to find Autobiographical Numbers, implementation and Time Complexity analysis.

Compiler Design

Control flow in Intermediate Code Generation

During the construction of the front end of a compiler, we implement statements using control flow. We translate the statements by inheriting a label next that marks the first instruction after the code for this statement.

Compiler Design

Types and Declarations in Intermediate Code Generation

In this article, we learn about types and the storage layouts for names declared within a procedure or class which are allocated at run time when the procedure is called or an object is created.

Compiler Design

Evaluation Orders for SDDs

In this article, we learn about evaluation orders fpr syntax-directed definitions. Dependency graphs are used to determine an evaluation order for instances of attributes in a parse tree.

Algorithms

Reverse a Queue using Stack

In this article, we have explored how to reverse a Queue using Stack data structure.

Algorithms

Reverse a Queue using another Queue

In this article, we will explore how to reverse a Queue using another Queue.

Dynamic Programming (DP)

Longest Increasing Subsequence [3 techniques]

In this article, we have explained the problem of Longest Increasing Subsequence along with 3 techniques (Brute force, Binary Search, Dynamic Programming).

Sorting Algorithms

Different Hybrid Sorting Algorithms

In this article, we will discuss about various Hybrid sorting algorithms such as Tim Sort Algorithm. Hybrid Sorting Algorithms tend to perform better than pure Sorting Algorithms and hence, are widely used in practice.

Web Development

Modal using CSS only

In this article, we will implement a Modal using only plain CSS without the help of JavaScript.

Python

Wait for page load in Selenium (Python)

In this article, I will show 3 different ways to wait for page to load in Python using Selenium.

Compiler Design

Syntax-Directed Translation Schemes

In this article, we learn about syntax-directed translation schemes, a complementary notation to syntax-directed definitions.

Compiler Design

Applications for Syntax-Directed Translation

In this article, we learn about the main application of Syntax-directed Translation which is the construction of syntax trees.

C++

T&& (double ampersand) in C++11

In this article, we have explored the idea of T&& (double ampersand) in C++11. T&& was firstly introduced in the C++ 11 standard which declares an rvalue reference.

System Design

System Design of School Management Software

In this article, we will be exploring the System Requirements, Architecture, Low-level design, database design, and examples of School Management Software.

System Design

System Design of Fee Management System

In this article, we will take a look at the key features a fee management system needs to offer, its high-level, low-level design, database design, and some of the features that turnkey software solutions offer.

data science

Cross entropy method for optimization

In this article, we will understand the cross entropy method that is widely used as an optimization technique in machine learning.

System Design

MapReduce in System Design

MapReduce programming has various advantages. It helps organizations to process petabytes of data stored in the HDFS and makes multiple data sources and data kinds more accessible.

computational geometry

Bentley Ottmann Algorithm for Plane Sweeping

In this article, we shall be discussing the Bentley-Ottmann algorithm for computing a plane sweep. This lists all the intersection points in a set of line segments. The Bentley-Ottmann algorithm takes O((n+k)logn).

Graph Algorithms

Depth Limited Search

In this article, we have explored Depth Limited Search algorithm which is a restricted version of Depth First Search (DFS).

Algorithms

Intro Sort

In this article, we will discuss about the Introspective or Intro sort algorithm which is an efficient Hybrid Sorting Algorithm making use of Quick Sort, Heap Sort and Insertion Sort.

Compiler Design

Syntax Directed Definitions

SDDs specify values of attributes by associating the semantic rules of a programming language with the grammar productions. In this article, learn about SDDs, different types of attributes, and how SDDs are evaluated in a parse tree.

Python

Python script to read email from Gmail

In this article, we have explained the idea of using Python to read an email from Gmail with a complete Python implementation example.