Aditya Chatterjee's Blog, page 162

Addition using Bitwise Operations

In this article, we have explained how to add any two positive numbers using the bitwise operators like and, xor, and left shift operators rather than using the normal addition operator (+).

Table of topics:

Basics of Bitwise OperationsAdding two numbers using bitwise operatorsBitwise add using RecursionTime and Space Complexity of bitwise addBasics of Bitwise Operations

We know that computer stores all kinds of data (videos, files, photos, etc.) in the form of binary numbers 0s and 1s. T...

Advanced Interview Questions on TensorFlow

In this article, we have presented advanced interview questions on TensorFlow with multiple options to choose from. Select an answer to find out if you got it right and get explanation for the answer.

This will help you get prepared for tough Interviews on TensorFlow, Google's Machine Learning framework.

Which datatype is not supported in TensorFlow as of v2.5.0?FP8FP32INT8INT32FP8 (Floating point, 8 bits) is not supported in TensorFlow as of v2.5.0. Over 30 datatypes are supported in ...

Questions on TensorFlow (with Answers)

In this article, we have present the most insightful and MUST attempt questions on TensorFlow with multiple options to choose from. Select an answer to find out if you got it right and get explanation for the answer.

This will help you get prepared for Interviews on TensorFlow, Google's Machine Learning framework.

To do minimum pool (minpool) in TensorFlow, which op needs to be used?tf.reduce_mintf.maxpooltf.minpooltf.poolMinimum pooling is not supported in TensorFlow so minpool() op d...

Karp's Minimum Mean Cycle Algorithm

In this article, we have presented Karp's Minimum Mean Cycle Algorithm along with C++ Implementation. Karp's theorem and Complexity Analysis.

Table of contents:

Problem statement with exampleTheorem given by KarpKarp's Minimum Mean Cycle AlgorithmImplementationComplexity AnalysisReferencesProblem statement with example

In 1978 , Richard M. Karp gave a characterization of Minimum Mean Cycle. Given a strongly connected digraph, G(V,E) with n vertices consisting of non-negative weights. Mea...

GraphQL API in Django with CRUD operations

Hi readers, this article will cover the following topics:

What is GraphQL API?Using GraphQL in DjangoCRUD Operations on for users in Django

NOTE: This article assumes that you are already familiar with Django framework.

What is GraphQL?

You might have heard of the phrase GraphQL API if you play with APIs, but what is it actually?

GraphQL was develeoped at facebook when they needed a data fetching api for their mobile app powerful enough to handle millions of traffic per second.

Professionall...

Coding Interview New Tab

"Coding Interview New Tab" is an Offline Browser Extension that displays a new one line knowledge on a Computing topic for every New Tab you open. It helps you learn something new every now and then.

Get this extension so that you can use it while offline: chrome.google.com

You can access the online version at: iq.opengenus.org/one [Bookmark this page 📌]

It will help you get prepared for your Coding Interview gradually. No separate effort needed. It happens on its own subconsciously. This is a M...

Simple CRUD Application with Django Rest Framework

In this article, we have explained the ideas of REST and CRUD and developed a Simple CRUD Application with Django Rest Framework.

Table of contents:

Introduction to REST and CRUDTime to SetupTime to CodeLet us Test our code

We will get started now with our Simple CRUD Application with Django Rest Framework.

Introduction to REST and CRUD

Ever wondered how your favorite web applications work? like Twitter, Facebook and so on, Yes they look fabulous but what really makes them tick; Its a littl...

Bubble Sort using Two Stacks

In this article, we have explored the algorithm to perform Bubble Sorting Algorithm using Two Stacks and sort a given array.

Table of contents:

Problem statementAlgorithm: Bubble Sort using Two StacksStep by Step exampleImplementationTime & Space ComplexityProblem statement

A sorting algorithm is used to rearrange items in a particular order. In this article, we explore the process behind sorting an array (say) 'ar' in ascending order using two stacks 's1' and 's2'.

A stack has only three...

Approximate algorithms for NP problems

In this article, we have covered Idea of Approximate algorithms for NP problems. NP problems are tough but Approximate algorithms are considered to be a good approach as we get a answer close to the real answer in reasonable time. We have covered the basics with examples of problems like Bin Packing.

Table of content:

Introduction to P, NP, NP-Hard and moreApproximation algorithms for NPThe quality of an approximationApproximation algorithms with small additive errorProblems having polynomi...

Shortest Unsorted Continuous Subarray

In this article, we have solved the problem "Shortest Unsorted Continuous Subarray" and explained the logic behind it and what are the different methods (like Monotonic Stack) we can use to solve it efficiently.

Table of content:

Problem Statement: Shortest Unsorted Continuous SubarrayApproaches to solve it
3. Brute Force Method
4. Using Monotonic Stack
5. Comparing with Sorted ArrayConclusionProblem Statement: Shortest Unsorted Continuous Subarray

Given an integer array nums, you need to f...