Software Engineering Grid Positioning in CSS CSS grid is a layout system which provide us to create responsive website in a easy way. As flexbox is designed for 1D layout either in row or column but with grid we can create 2D layout - row and columns at the same time. This article is created to help you to understand grid system in better way.
Data Structures Binary Space Partitioning Trees Binary Space Partitioning Trees is a method of recursively subdividing a space into two convex sets by using hyperplanes as partitions. The resulting data structure is a binary tree, and the two subplanes are referred to as front and back.
Machine Learning (ML) Bayesian Belief Networks This article covers: Prerequisite Probability concepts for Bayesian Belief Networks(BBNs), BBN components: Directed Acyclic Graph and Conditional Probability Table and implementation example in Python.
Software Engineering Complex number in C language In this article, we will explore how to use complex numbers in C. There are two approaches: one is to implement it using struct in C and the other solution is to use complex.h library.
Software Engineering Lambda Expressions in Java Lambda expressions were added in Java 8 along with functional programming. Before understanding lambda expressions or lambdas for short, a prerequisite is to understand what is a Functional Interface.
Data Structures Applications of Trie Data Structure In this article, we have explored the applications of Trie data structure which is an efficient data structure for handling strings. Some of the best applications of Trie are Auto complete, spell checker, longest prefix matching and browser history.
Software Engineering Non-Preemptive Priority CPU Scheduling Algorithm In Non-preemptive Priority CPU Scheduling Algorithm, processes are scheduled as per the priorities assigned to respective task and next process is not schedule until and unless current execution of process is not completely finished.
Software Engineering First Come First Serve CPU Scheduling Algorithm First Come First Serve (FCFS) is also known as First In First Out (FIFO) scheduling algorithm is the easiest and simplest CPU scheduling algorithm where the process which arrives first in the ready queue is executed first by the CPU.
Software Engineering Basic Guide to Python Itertools and its functionalities Itertools module is a standard library module provided by Python 3 Library that provide various functions to work on iterators to create fast , efficient and complex iterations.
Machine Learning (ML) Explaining and Harnessing Adversarial examples by Ian Goodfellow The article explains the conference paper titled "EXPLAINING AND HARNESSING ADVERSARIAL EXAMPLES" by Ian J. Goodfellow et al in a simplified and self understandable manner.
Algorithms Finding all Armstrong Numbers in a given range In this article, we will develop an approach to find all armstrong numbers in a given range. The approach is to check for each number in the range if it is an armstrong number or not.
Software Engineering Delete an array in C In this article, we have explored how to delete or deallocate an array in C. By deleting an array, we mean to deallocate the memory that was assigned to the array so that it can be reused.
Machine Learning (ML) Understanding ResNet50 architecture ResNet50 is a variant of ResNet model which has 48 Convolution layers along with 1 MaxPool and 1 Average Pool layer. It has 3.8 x 10^9 Floating points operations. It is a widely used ResNet model.
Data Structures Space partitioning trees Space partitioning trees are tree data structures that partition a N-dimensional data space into different components for specific tasks. Examples of Space partitioning trees include Binary Space Partitioning tree, Octree and many more.
Software Engineering Object Oriented Programming (OOP) in Dart In this article, we have explored Object Oriented Programming (OOP) concepts in Dart such as classes, objects, data encapsulation, inheritance and polymorphism.
Machine Learning (ML) Value Iteration Algorithm (with a 1D example) In this article, we have explored Value Iteration Algorithm in depth with a 1D example. This algorithm finds the optimal value function and in turn, finds the optimal policy.
Data Structures Comparison of Bloom Filters with other data structures In this article, we have compared Bloom filter with other data structures like Hash Map, Binary Search Trees and Trie along with general idea of using Bloom Filters.
Software Engineering Setting up LAMP Stack using shell scripting In this article, we have used a shell script for installing LAMP (Linux Apache, MySQL, PHP) on Debian OS. This automates the process.
Software Engineering Introduction to Docker compose Docker Compose is used to run multiple containers as a single service. It allows developers to write a YAML or yml configuration file for the application service which then can be started using a single command.
Software Engineering Call by Value vs Call by Reference in C++ 'Call' refers to calling a function. Both of these (Call by Value and Call by Reference) are methods of function invocation. The difference, lies in formal parameters
Coronavirus Memes for Programmers Amidst all this danger of Coronavirus, programmers are enjoying the situation in the form of memes reflecting some subtle truths. These are the best and funniest Coronavirus memes for Programmers.
Software Engineering JUnit Testing using Maven JUnit testing is the unit testing framework for Java. We have explored JUnit testing using Maven in depth with a code example in this article.
Software Engineering Reference vs Pointer in C++ In this article, we have explained the difference between reference and pointer in C++ in detail. In short, reference is an alternative name for a variable while pointer is a variable that contains memory address of another variable.
Software Engineering Traversing folders in C recursively In this article, we have explored how to traverse folders in C recursively. We have used the dirent.h library to achieve this along with basic methods like readdir, opendir and closedir.
Algorithms Minimum number of characters to be deleted to make string a palindrome In this problem, we have to formulate an algorithm to find the minimum number of characters to be deleted to make the string a palindrome. This can be solved using the Dynamic Programming approach for longest palindromic subsequence in O(N^2) time.
