Machine Learning (ML) How a ML Dataset is designed? In this article, we have explored How a (Machine Learning) ML Dataset is designed? with the example of the PASCAL dataset (Pascal-1 Visual Object Classes (VOC)) and how it evolved over the years and how the initial dataset was prepared.
Software Engineering footer tag in HTML The "footer" tag is normally used for defining the footer or end part of a section on html page. Each "footer" will have information about its containing element. The "footer" will have information about the article and the page author.
Software Engineering Defining 2D array in Python We have explored the different ways of defining a 2D array in Python. We have explored three approaches: Creating a List of Arrays, Creating a List of Lists and creating 2D array using numpy.
Software Engineering Introduction to Ruby Programming Language This is Introduction to Ruby Programming Language. Ruby is an interpreted, high-level, general-purpose programming language that was designed and developed by Yukihiro "Matz" Matsumoto in the mid-1990s.
Algorithms Applications of Linked list We have covered the applications of Linked List, Circular Linked List and Doubly Linked List. We start with the basics of Linked List and then, move to applications of the different types of Linked List.
Software Engineering Using Firestore Database with React App We will build the react app which shows the visitor details and stores the visitor detail in database . For the database , we will use firebase firestore. We will add the feature to delete records in database as well.
Algorithms What is a Disarium Number? A disarium number is a number in which the sum of the digits to the power of their respective position is equal to the number itself (position is counted from left to right starting from 1).
Software Engineering Media Source Extension in HTML Media Source Extensions extends HTMLMediaElement to allow JavaScript to generate media streams for playback. Allowing JavaScript to generate streams facilitates a variety of use cases like adaptive streaming and time shifting live streams.
Algorithms Assembly Line Scheduling using Dynamic Programming The main goal of solving the Assembly Line Scheduling problem is to determine which stations to choose from line 1 and which to choose from line 2 in order to minimize assembly time. We solve this using Dynamic Programming.
Algorithms Commonly asked interview questions on sorting algorithms. Power booster for your interview preparation! In this article, we have presented several multiple choice questions (MCQs) on Sorting Algorithms for coding interviews with answers. This will help you get prepared.
Algorithms Dice Throw Problem (Dynamic Programming) There are d dice each having f faces. We need to find the number of ways in which we can get sum s from the faces when the dice are rolled. We have explored a Dynamic Programming solution to Dice Throw problem.
Problems on Binary Tree Find if a given Binary Tree is a Sub-Tree of another Binary Tree A sub-tree is a tree itself that is the subset of a bigger binary tree. A subtree of a node means that it is the child of that node. In this article, we will find out different ways to find out if a given binary tree is a sub-tree of another binary tree.
Problems on Binary Tree Convert Binary Tree to Threaded Binary Tree We will focus on different approaches on how to convert a normal binary tree into a threaded binary tree. We will convert our binary tree to single threaded binary tree with right pointers pointing to inorder successor (if it exists).
Algorithms Maximum Sum Decreasing Subsequence (Dynamic Programming) Given an array of n positive integers, find the sum of the maximum sum decreasing subsequence (msds) of the given array such that the integers in the subsequence are sorted in decreasing order.
Culture Will you hire Donald Knuth as a programmer? A manager said Donald Knuth is too theoretical and he would not hire him to lead his team or as a programmer. Donald is widely respected for his theoretical contributions and have been recognized with awards. We will show that Donald is practically strong as a programmer as well.
Problems on Binary Tree Check if a Binary Tree is Balanced by Height In this article, we have explored the algorithm to check if a Binary Tree is balanced by height or not.
Algorithms Linked List with no NULLs A Linked list is a dynamic data structure which can grow or shrink on demand. It is usually implemented using NULLs, we will consider an alternative no NULL approach and use placeholder nodes.
Machine Learning (ML) Different Basic Operations in CNN We have explored the different operations in CNN (Convolution Neural Network) such as Convolution operation, Pooling, Flattening, Padding, Fully connected layers, Activation function (like Softmax) and Batch Normalization.
Algorithms Comparison b/w Different Advanced Sorting algorithms (Interview preparation) We have reviewed and compared different Advanced Sorting algorithms that will help you in your Interview preparation. We have covered 5 sorting algorithms namely bucket, radix, counting, heap and shell sort.
Software Engineering StringBuilder in Java (java.lang.StringBuilder) StringBuilder is a standard library class in Java which can be used in handling string data and is alternative to String Buffer and String data type.
Software Engineering Guide to deploy a Python Web app on Heroku This is a guide on how to deploy a web application based on a Python framework (like Flask) using an HTTP server like Gunicorn on Heroku (a PaaS).
Software Engineering Designing and implementing Binary Tree in JavaScript We have investigated the fundamentals and use of double trees/ Binary tree and how to implement Binary Tree in JavaScript along with all basic operations of binary tree in JavaScript.
Machine Learning (ML) ResNet50 v1.5 architecture ResNet50 v1.5 is the modified version of the original ResNet50 model. ResNet50 v1.5 is slightly more accurate (0.5%) and slightly lower performance (down by 5%) compared to ResNet50.
Algorithms Minimum steps to make binary string empty by removing alternating subsequence in each step Given a string str consisting of only '0's and '1's, the task is to make the string empty by performing minimum number of operations. An operation is defined as the removal of an alternating subsequence from str without changing the order of the remaining characters.
Software Engineering Digit Separators in C++ In this article, we have discussed about Digit Separators in C++. This topic is introduced in C++14. Using digit separators in the code make it easy for human readers to parse large numeric values.
