Aditya Chatterjee's Blog, page 76

Interview Questions on Transformers

The Transformers architecture introduced in the paper “Attention Is All You Need”, has changed the scenario of creating more complex and advanced NLP models. The Transformer in NLP is a novel architecture that aims to solve sequence-to-sequence tasks while handling long-range dependencies with ease. Following are the important questions for an interview on Transformers.

Table of ContentMultiple Choice QuestionsDescriptive QuestionsPractical QuestionsMultiple Choice Questions1. What does “...

Components of a Blockchain

In this article, we learn about Ethereum, some differences between Ethereum and Bitcoin, and a look at the general components that make up a blockchain.

Table of Contents.Introduction.Differences between Ethereum and Bitcoin.Components of a Blockchain.Summary.References.Introduction.

Ethereum is 'the world computer' in that, it is a deterministic and practically unbounded state machine that consists of a global state and a virtual machine that applies changes to the global state.
In othe...

PCA vs LDA [Differences]

In machine learning field,sometime,we have to work with large-scale data with not only many number of data points but also huge amount of feature dimension. This problem charged us much time, memory spaces and make difficult for our models to work with until PCA and LDA was born. In this article, we're going to discuss about how these 2 algorithms work and the differences between them.

Table of contents

Introduction to dimensionality reductionPCALDAComparision tableImplementation1. Introd...

How is Deep Learning used for Data Science tasks?

In this article, we will see how deep learning is used in Data Science.

Table of contentsWhat is deep learning?Uses of deep learning

What is deep learning?

Deep learning is a subset of machine learning. It mainly revolves around artificial neural networks which are inspired by the structure and function of the human brain. Unlike machine learning, deep learning eliminates data pre-processing and is capable of working with unstructured data like images and automatically extract necessary fea...

Implementing Quick Sort in Java

In this article, we are going to learn about the implementation of quick sort algorithm in Java.

Table of Contents:

Working of Quick SortAlgorithmJave Code using Naive partitionJava Code using Hoare's partitionJava Code using Lomuto's partitionDetailed explanation of the implementationArrays.sort in JavaFAQsWorking of Quick Sort

Quick sort is a sorting algorithm based upon the divide and conquer approach. Let's take a brief look at the working of the quick sort algorithm.

1. Selection ...

Stack vs Queue [Differences]

In this article, we will be discussing about "Stack vs Queue" in detail.

Contents:

What is a Stack?What is a Queue?Differences between stack and queue.Similarities between stack and queue.Implementation.What is a Stack?

A stack is a linear data structure in which both insertion and deletion operation occurs at one end. It is based on LIFO (last-in-first-out) principle in which both insertion and deletion takes place from one end only. So, stack is basically a container which is closed fro...

Iterative In-order Traversal

In this article, we have explored the concept of Iterative In-order Traversal along with detailed step by step example and complete implementation.

Table of contentsDefinitionsAlgorithmTime complexityA way of implementation1. Definitions

Binary trees are data structures where each node contains only 2 references to other nodes. Usually they are called left and right, but you can name it in other ways too, for ex: up and down or yin and yang, and so on.

There are different ways to traverse...

TCHAR, WCHAR, LPSTR, LPWSTR, LPCTSTR in C++

In this article, we are going to learn about the TCHAR, WCHAR, LPSTR, LPWSTR, LPCTSTR in C++ along with code examples.

Frequently, 1 or 2 bytes can be used to represent a character.
The ANSI standard, which is 1 byte in size, is used to represent all English characters.
ALL languages in the world are represented by Unicode, which is a 2 byte insize.

The Visual C++ compiler supports
TCHAR, WCHAR, LPSTR, LPWSTR, LPCTSTR for ANSI and Unicode characters.

TCHAR

TCHAR is used to describe ANSI or Unico...

Degenerate or Pathological Tree

Degenerate or Pathological Tree is a variant of Binary Tree which we have explored in depth along with code implementation for Degenerate or Pathological Tree.

Before we look into a degenerate tree, you need to have knowledge on Binary Search Tree. So we'll look into the binary search tree first.

Binary Search Tree

This is a type of tree data structure in which the leaf nodes (child nodes) are stored in relation to the value of the parent node, if the value of the node to be inserted is less tha...

Huber Fitting using ADMM

Huber Fitting in general is the approach of using the Huber function to fit the data models, the advantage of this approach is due to the clever formulation of the Huber function which brilliantly combines the best features of both preceding optimization solution approaches of LAD and LS. To benefit from its theoretical strength, it must therefore be solved in order to acquire a form that can be used in practice. It is advisable to have a solid understanding of ADMM for a better understanding.

T...