Aditya Chatterjee's Blog, page 136

Types of Client Server Communication

In this article, we have explored How Clients and Servers Communicate and Types of Client Server Communication such as HTTP Push and Pull, Long Polling and much more.

Table of contents:

Introduction to Clients and Servers CommunicationHTTP Push and PullAjax PollingLong PollingServer sent eventsWebsocketsMessage queuesConclusionIntroduction to Clients and Servers Communication

The main purpose of the internet is to provide an avenue (infrastructure) for one computer A to send a message ...

Euler’s Polyhedron Formula

In this article, we have explored Euler’s Polyhedron Formula in depth with examples, proof and applications in real life problems.

Table of contents:

Introduction to Euler’s Polyhedron FormulaExamplesEuler’s CharacteristicMathematical Proof and converting into NetworkApplication of Euler’s Polyhedron FormulaIntroduction to Euler’s Polyhedron Formula

Euler’s Polyhedron formula states that for all convex Polyhedrons, if we add all the number of faces in a polyhedron, with all the number of ...

kn2row / kn2col Convolution

In this article, we will cover 2 different convolution methods: Kn2row and Kn2col Convolution which are alternatives to Im2row and Im2col. Kn2row and Kn2col are space efficient variants.

Table of Contents:

Introduction.Kn2row and Kn2col Convolution
2.1 Kn2row Algorithm
2.2 Kn2col AlgorithmDifferences.Memory Usage.GEMM Call for Kn2row.GEMM call for Kn2col.Implementation of kn2row convolution.Implementation of kn2col convolution.Quick Summary of all types of Convolution methods.

Pre-requ...

Time and Space Complexity of Stack

In this article, we will explore about various operations on Stack Data Structure and the Time and Space Complexity of each operation for various cases like Best case, Average case and Worst case.

Table of contents:

Basics of StackPush in StackTime ComplexitySpace ComplexityPOP in StackTime ComplexitySpace ComplexityPeek in StackTime ComplexitySpace ComplexityConclusion

Pre-requisite:

Stack data structureImplementing a Stack using an Array and Linked list

As a summary:

...

Josephus Problem

In this article, we have explored and solved Josephus Problem in depth which is a Standard Problem in Computer Science. We have presented two solutions to Josephus Problem.

Table of contents:

Introduction to Josephus ProblemSolving the Josephus ProblemImplementation of Recursive SolutionAn Alternative SolutionIntroduction to Josephus Problem

The Josephus Problem is a theoretical problem in computer science and mathematics, where people standing in a circle get executed one-by-one until one...

Parsing in Compiler Design

In this article, we discuss the different types of Parsing done by compilers such as Top-down parsing, Non-recursive predictive parsing and much more.

Table of contents:

Introduction to ParsingTop-down parsing (LL)Recursive descentNon-Recursive predictive parser (LL)Bottom Up parsing (LR Parsing)Shift reduce parsing (LR)LR(0) ParsingSLR(1) ParsingLALR(1) ParsingCLR(1) ParsingOperator precedence parsingIntroduction to Parsing

Parsing or (syntax analysis) is the process of an...

Li Chao Segment Tree

In this article, we discuss the Li Chao tree, a segment tree which can be persistent and is faster in practice compared to the convex hull trick.

Table of contents:

Segment treesConvex hull trickLi chao treeInsert operation in Li chao treeQuery in Li chao treeProblems using Li chao tree

Pre-requisites:

Range minimum querySegment treesConvex Hull Trick

Before we get started, we discuss some prerequisite concepts we have to be familiar with. These are short summaries enough to give a ba...

Symbol Table in Compiler

In this article, we have explored Symbol Table in Compiler in depth. We presented 3 different approaches to implement Symbol Table using Linear List, Tree and Hash Table data structures.

Table of contents:

Symbol Table in CompilerPossible Implementations Techniques(i) Linear Lists(ii) Trees(iii) Hash TableHash FunctionImplementing a Hash FunctionAnother Hash FunctionResolving collisions through Open AddressingSeparate Lists ChainingImplementing Symbol TablesUses of Symbol TableSy...

Time and Space complexity of Trie

In this article, we will understand the Complexity analysis of various Trie operations. We have covered Time and Space Complexity of Trie for various cases like Best case, Average Case and Worst Case.

Table of contentsTrie data structureTime and Space complexity of Trie operations
* Insertion
* Deletion
* SearchingConclusion

Pre-requisite: Trie data structure

To summarize, the time complexity is as follows:

OperationAverage CaseWorst CaseBest CaseInsertionO(N)O(N)O(N)Delet...

Swish Activation Function

In this article, we have explored Swish Activation Function in depth. This was developed by Researchers at Google as an alternative to Rectified Linear Unit (ReLu).

Table of contents:

Overview of Neural Networks and the use of Activation functionsSwish Activation functionDerivative function of SwishConclusion

Pre-requisite: Types of Activation Functions used in Machine Learning

Overview of Neural Networks and the use of Activation functions

The mechanism of neural networks works similarly t...