Aditya Chatterjee's Blog, page 133

"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.

"Problems on Array: For Interviews and Competitive Programming" book

Get it on:

amazon.in (for India): e-book and paperbackamazon.com (for USA + other countries): e-book, paperback and hardcover

On completing this book, you will have these core skills:

Strong hold ...

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.

Table of contents:

Constant FoldingConstant propagationNeed for optimization

Pre-requisites:

Different phases of CompilerDifferent Code Optimizations in Compiler DesignConstant Folding

This is an optimization technique which eliminates expressions that calculate a value that can be determined before code exec...

Syntax Analysis in Compiler Design

In this article, we discuss the second phase in compiler design where written code is evaluated for correctness.

Table of contents:

DefinitionsThe parserContext free grammars (CFGs)DerivationsParse TreeAmbiguityLeft recursionLeft factoringTop down parsingRecursive descentPredictive ParserParsing table constructionLL(1) GrammarBottom-up parsingOperator precedence parsing

Pre-requisites:

Different phases of CompilerParsing in Compiler DesignDefinitions

Parse tree/syntax tree...

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.

Table of contents:

Introduction to Network TopologiesBrief summary of Inception networksInception-ResNet v1Implementation of Operations in Inception-ResNet v1

Pre-requisites:

Understanding ResNet50 architectureThe Inception Pre-Trained CNN ModelIntroduction to Network Topologies

In the early stages of Artificial Intelligence, convolution neural networks (CNN) were just ...

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.

Table of ContentsIntroductionUsesRedundant ExpressionsPartially Redundant ExpressionsLoop Invariant ExpressionsExample OptimisationLimitationsConclusion

Pre-requisites:

Different Code Optimizations in Compiler DesignPeephole Optimization in Compiler DesignIntroduction

In terms of code mobility, o...

Basics of Rich Text Format (RTF)

Does anyone remember this image when going to save documents?

In this article, we are going to know a little detail about this .rtfHistory and Introduction

In the earlier days of Windows, There was a very popular format for document creation is the .txt format.Files in this format could be created in the default Notepad viewer.

But there are some limitations of Notepad.

TXT files cannot retain any formatting (text formatting, photograph formatting) at that time.TXT files cannot create list...

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.

Table Of Contents:Brief Overview of Neural NetworksWhat is an activation function?What is ReLU?Implementing ReLU function in PythonWhy is ReLU non-linear?Derivative Of ReLUAdvantages of ReLUDisadvantages of ReLU

Pre-requisites:

Types...

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.

List of Contents

IntroductionTraversalInsertionDeletion

Pre-requisites:

Time Complexity AnalysisCircular Linked ListTime Complexity Analysis of Linked ListBasics of Time Complexity AnalysisIntroduction

A circular linked list is a linked list where the last node points to the first node instead of NULL. This linked list comes...

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. But before moving to this part we must need to have a clear knowledge of binary search tree and the operations that can be performed.

Table of contents:

Introduction to Binary Search TreeSearching operationTime and Space Complexity analysisInsertion operationTime and Space Complexity analysisDeletion operationTime and Space Complexity analysisComplexities ...

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.

Table of contents:

What is a Red-Black Tree?OperationsRebalancingRotationsHeight of a Red Black TreeInsertion OperationInsertion Time and Space ComplexityDeletion OperationDeletion Time and Space ComplexitySpace ComplexityConclusion

Pre-requisites:

Red Black Tree: InsertionRed Black Tree: Deleti...