Aditya Chatterjee's Blog, page 82

First K maximum occurring words

In this article, we will understand the different approaches to return the first k maximum occurring words from a given array. It includes core Data Structures and Algorithm topics such as Arrays, HashMap, Sorting, Priority Queue and Heap, Trie, and Bucket sort.

Table Of Content:Problem StatementSolutionsHashing and SortingHeapTrie and Bucket SortProblem statement

Given an array of n string values and a positive integer k, one has to find the first k words which occur the most. In cas...

Check if a string can be convert to another by swapping two characters

Table of contents

Introduction into the problemAlgorithmImplementation1. Introduction into the problem

Having two strings s1 and s2 equal in length of size n, you must check if they are equal after you swap any of two different characters. If strings are different on more than just 2 characters it must return false.

Example 1:

Input: s1 = "kanb", s2 = "bank"
Output: true

Example 2:

Input: s1 = "kanban", s2 = "balcan"
Output: false

Example 3:

Input: s1 = "equal", s2 = "equal"
Output: true

2....

Object-Oriented Database

This article aims to:

Explain the object-oriented database and its principlesContrast the object-oriented database with the relational databaseProvide examples of object-oriented database management systemsObject-Oriented Database

So what is an object-oriented database?

An object-oriented database (also known as an object database) is a database that stores information in the form of objects and classes. Similar to object-oriented languages, object-oriented databases follow many object-orie...

Find word with maximum frequency using Trie

In this article, we will design an algorithm to Find word with maximum frequency using Trie Data Structure.

Table of contents:

Problem StatementKey Idea of using TrieThe Fundamentals of TrieWhat operations can be performed on a TrieImplementing the NodeSolution: Implement the insert methodTime and Space complexity for insertionHow to implement the startsWith methodHow to implement the searchWord methodProblem Statement

We are given N words and we need to find the word that occurs the ...

F Test

F-tests get their name from the F test statistic, which was named after Sir Ronald Fisher. The F-statistic is just a two-variance ratio. Variances are a metric for dispersion, or how far the data deviates from the mean. Greater dispersion is shown by higher values.

The square of the standard deviation is the variance. Because standard deviations are in the same units as the data rather than squared units, standard deviations are easier for us to understand than variances. Many analyses, however,...

Posenet Model in ML

In this article, we will learn about pre-trained model PoseNet in detail which will be consisting of need and working of posenet,operations possible on it,its application, and possible improvement over existing posenet model.

What will we learn:

What is Posenet ?How Posenet works ?Keywords explained used in PosenetNeed of PosenetOperations on PoseNetArchitecture of PoseNetAbout GoogleNetFull-Connected Layer in CNNLoss function in PosenetImprovements over the architecture of PosenetCon...

Transposed Convolution

Introduction:

Convolutional neural networks are very useful when it comes to computer vision projects and can be automatically used to extract features from photos and videos while also reducing the image dimensions.
In most models for image classification, the CNN that is used is with a fully-connected layer. But in this case there are several issues that you will face like higher computation cost and no preservation of the spatial dimensions. To solve this problem, we employ a technique called...

Bottom up traversal of Trie

In this article, we have explained the algorithmic approach for Bottom up traversal of Trie.

Table of contentWhat is Trie?What is bottom-up traversal of Trie?AlgorithmCode approachComplexityWhat is Trie?

Trie is a special data structure used to store the data(generally, we store strings) in an efficient way. It is similar to Tree. It is an n-ary tree in which each branch consists of n components. It is also known as prefix tree or digital tree. It consists of nodes and edges. It is an In...

Hashing: Complete Guide

ContentsIntroductionHash TableHash FunctionMethods to calculate Hashing FunctionDivision MethodFolding MethodMid-Square MethodDigit AnalysisCollisionTechniques to resolve CollisionOpen Hashing(Closed Addressing)Closed Hashing(Open Addressing)
1.Linear probing Method
2.Quadratic probing Method
3.Double Hashing TechniqueConclusionIntroduction

In hashing, we convert key to another value.It is a searching technique. In linear search the time complexity is O(n),in binary search ...

Grouped and Shuffled Grouped Convolution

Abstract

Convolution is an essential mathematical operation being used in many of today's domains including Signal Processing, Image Processing, Probability, Statistics, etc. Naturally, due to its extensive use, improved applications have been developed. So it is imperative that one knows in depth the various ways it can be applied. This article aims at explaining Convolution and the possible ways it can be applied in regards to NNs, CNN to be specific.

Table of contentsIntroduction to Convolu...