Aditya Chatterjee's Blog, page 72

September 17, 2022

How Uber got hacked? [Complete Report]

In this article, we have explored how Uber got hacked using MFA and what can be done to prevent such hacking attacks in future. Any company can fall for this attack.

Table of contents:

What happened? [In short]How to fix this? and prevent such hacks.Some more detailsImpact of the hack

Learn the System Design of Uber

Uber was hacked on 16th September 2022 giving access to majority of their internal tools include AWS to the hacker involved. Turns out hacker used both social engineering and te...

 •  0 comments  •  flag
Share on Twitter
Published on September 17, 2022 03:51

September 14, 2022

Probnik: Netflix's innovation testing framework

Netflix is technologically one of leading Software Companies in the World. They serve their customized homepage in milliseconds, no server outrage can bring Netflix down and much more. In this article, we explored Netflix's approach towards testing framework named Probnik.

Read these to understand how technically advanced Netflix's architecture is:

How did Netflix become so good at DevOps by not prioritizing it?How Server Outrage did not impact Netflix

Probnik is Netflix's testing framework w...

 •  0 comments  •  flag
Share on Twitter
Published on September 14, 2022 07:27

September 11, 2022

Greedy Algorithm vs Dynamic programming

In this article, we will discuss greedy methods vs dynamic programming. Both of them are used for optimization of a given problem. Optimization of a problem is finding the best solution from a set of solutions.

An algorithmic paradigm known as a greedy algorithm assembles a solution piece by piece, always opting for the component that provides the most glaringly evident and immediate benefit. Therefore, Greedy works best in situations where selecting a locally optimal solution also yields a glob...

 •  0 comments  •  flag
Share on Twitter
Published on September 11, 2022 14:11

Time and Space Complexity of Prim’s algorithm

In this article, we will learn more about Prim's algorithm and analyze its complexity for different cases and implementation approaches.

Table of contentsPrim's algorithmComplexity analysis
* Time complexity
* Different cases of time complexity
* Space complexity

Prim's algorithm

Prim's algorithm is one of the greedy algorithms that is used to find the minimum spanning tree of a given graph.

Firstly, let us understand more about minimum spanning tree. A Minimum Spanning tree (MST) is a subs...

 •  0 comments  •  flag
Share on Twitter
Published on September 11, 2022 08:58

Why Adobe acquired Figma for 20 Billion Dollars?

Adobe acquired Figma for 20 Billion Dollars but why Adobe paid a huge price during the recession?

To put this in perspective, following are some acquisition cost of major companies:

GitHub for $7.8B by Microsoft in 2018RedHat for $34B by IBM in 2019Xilinx for $49B by AMD in 2021Mandiant for $5.4B by Google in 2022Why Adobe acquired Figma?

To avoid the mistake that Yahoo did while pricing Google back in 2002.

Figma is currently the fastest-growing UX tool and the customers love it.

Figma's ...

 •  0 comments  •  flag
Share on Twitter
Published on September 11, 2022 07:39

September 10, 2022

Out-of-Bag Error in Random Forest [with example]

In this article, we have explored Out-of-Bag Error in Random Forest with an numeric example and sample implementation to plot Out-of-Bag Error.

Table of contents:

Introduction to Random ForestOut-of-Bag Error in Random ForestExample of Out-of-Bag ErrorCode for Out-of-Bag ErrorIntroduction to Random Forest

Random Forest is one of the machine learning algorithms that use bootstrap aggregation. Random Forest aggregates the result of several decision trees. Decision Trees are known to work we...

 •  0 comments  •  flag
Share on Twitter
Published on September 10, 2022 17:04

List of Standard Header files in C

List of Standard Header files in C

C programming language offers 25 standard header files (which is supported by default). If the programs are complex and lengthy , they can be modularized into subprograms called functions, a group of this functions make up a header file.

C programming language has 25 standard header files which are as follows:

#include (Standard input-output header)
Used to perform input and output operations in C like scanf() and printf().#include (String header)
Perform string manipulation operations like s...
 •  0 comments  •  flag
Share on Twitter
Published on September 10, 2022 16:59

Try Else in Python [Explained with Exception Types]

The “try” and “else” statements are used in Python for flow control.
An Exception, also known as run time error, is an event which occurs during the execution of a Python program. When that error occurs, it interrupts the Python program and generates an error message by printing a “Traceback” to the console with information about the exception and how it was raised.

In order to prevent the program interrupting, “catching” the exception is important. “Catching” here refers to a block of code exec...

 •  0 comments  •  flag
Share on Twitter
Published on September 10, 2022 16:54

Download files from Google Drive using Python

IntroductionDownload files from Google Drive using Python

In this article, you will create a python script to download files from and upload files to Google drive. After you have created the script, you can integrate it with your web applications and APIs to download files from and upload files to Google drive.

Prerequisites

Before you begin this article you will need the following:

An environment that can run pythonSome knowledge of python scripting and simple Object Oriented Programming in python
Note: I use python3.10.6 and an Ubuntu ...
 •  0 comments  •  flag
Share on Twitter
Published on September 10, 2022 13:44

Interpolation Search [EXPLAINED]

In this article, we have explained the concept of Interpolation Search and analyzed the performance of interpolation search in terms of time and space complexity.

What is Interpolation Search?

Interpolation search is basically an improvement over binary search. In interpolation search we check at different postitions based on the value of element being searched using a formula , that is :

pos= start + (((double) (end-start) / (a[end]-a[start])) * (key-a[start]))

where,

pos = position of eleme...
 •  0 comments  •  flag
Share on Twitter
Published on September 10, 2022 09:08