Aditya Chatterjee's Blog, page 114

Introduction to Trigonometry

In this article, we have explored the basic concepts of Trigonometry. These concepts are important for the Mathematics required for Computational Geometry.

Table of ContentsIntroductionSine, Cosine, TangentCosecant, Secant, CotangentIdentitiesAddition/Subtraction FormulaeDouble-angle FormulaeOverviewIntroduction

In this article we will be covering the basis of trigonometry, this is the branch of mathematics concerning the relationship between sides and angles in triangles, and also the...

Direction of point from line segment

In this article, we have explored algorithm to find the Direction of point from line segment.

Table of ContentsIntroductionMethodExampleImplementationOverviewIntroduction

In this article we will be covering how to calculate the direction of a point from a line segment. This means, if we have a point (P) and line (AB) we determine the direction of P from the line segment, whether it is to the left or to the right. This is a basic problem to solve which will eventually allow us to apply it...

Morris Inorder Traversal in Binary Tree

In this article, you will learn about a method to traverse a tree in O(1) space complexity i.e without using recursion or stack. We will use the concept of Single Threaded Binary Tree.

Table of contents:

Single threaded binary treeMorris Inorder Traversal AlgorithmMorris Inorder Traversal Implementation in C++Time and Space ComplexityApplication of Morris Inorder TraversalConclusion1. Single threaded binary tree

In single threaded binary trees,the right child pointers that are set to NUL...

N-th root of a number

In this article, we have explained three different algorithms to find the N-th root of a number.

Contentsusing Binary Searchusing Logusing Newton's methodPre-requisites

cube-root using binary-search

Conventions

Let's decide on some convention first,
we will take some number to calculate nth root on, we'll call it N and since,
then, we have to calculate nth root let that nth be n.
and also let's consider x will be our result.

Pre-Discussion

If you have read the cube-root using binary-se...

0-1 Knapsack problem using Branch and Bound

In this article, we have explored the Branch and Bound algorithm for 0-1 Knapsack problem.

Contents

Problem StatementApproaches to Solve this MethodBranch and Bound MethodTime and Space ComplexitySolving an ExampleConclusionProblem Statement

We are a given a set of n objects which have each have a value vi and a weight wi. The objective of the 0/1 Knapsack problem is to find a subset of objects such that the total value is maximized, and the sum of weights of the objects does not exceed ...

* vs ** pointer in C

In this article, we have explained the difference between * and ** pointer in C and C .

Table of contents:1. What are Pointers?2. Examples of Pointer3. Implementation of Pointers using C4. *p vs **p pointer5. Implementation of *p and **p using CWhat are Pointers?

Pointer is a variable used to store the address in memory of another variable.
The two operators used in the pointers:

Operator & :- Gives the address of a variableOperator * :- Gives the values at locationSome Points:Addr...

Regular Operations in Theory of Computation

In this article we have discussed three languages operations namely, union, concatenation and kleen closure.

Table of contents.Introduction.Regular operations.Concatenation and Kleen closure operations.Closure under regular operationsSummary.References.Prerequisites.Finite AutomataIntroduction.

A language is a set of strings from an a finite or infinite alphabet. Here we discuss three simple but important operations used on languages, these are union, concatenation and kleen closure...

Types of Storage Devices

In this article, we will take a look at the various Storage Devices that are used in computing cost, applications and their characteristics.

Table of Contents

What is a computer storageClassification of storagePrimary MemoryDRAMSRAMSecondary MemoryNetwork StorageWhat is a Computer Storage?

A storage device or memory is an essential component of all computers that retain information and data. Even the operating system needs to be stored somewhere. Without storage, a computer is like a...

Conv2D operation in TensorFlow

In this article, we have explained Conv2D operation in TensorFlow along with API definition and Python implementation.

Table of contents:

Introduction to ConvolutionConv2D operation in TensorFlowDemo of Conv2D in TFConclusion

Before we dive into Conv2D operation in TensorFlow let us understand briefly what convolution actually means.

Introduction to Convolution

Convolution is one of the most fundamental blocks of computer vision and image processing. When we are blurring or sharpening an im...

Lazy Loading

In this article, we have explored the idea of Lazy Loading in depth. It is an optimization technique to help webpages load faster.

Table of contents:

IntroductionPerformanceCode SplittingCSS OptimizationLazy-load imagesLazy-load videoIntroduction

Lazy loading is a method of identifying non-blocking/non-critical web resources and loading them when necessary. This can improve the performance of web pages by reducing rendering times and cache sizes.

Performance

Directly improving the perfor...