OpenGenus Tech Review Team - OpenGenus IQ: Learn Algorithms, DL, System Design (Page 130)

Algorithm for finding the minimum number of swaps required to convert a binary tree to binary search tree

We developed an algorithm for finding the minimum number of swaps required to convert a binary tree to binary search tree. The Idea is do the inorder traversal of binary tree and store it in an array.Then find the minimum number of swaps require to sort an array which is the output we want.

Algorithms

Find and print all the paths between two vertices in a graph【O((2^V)*(V+E))】

Given a directed graph, a vertex ‘v1’ and a vertex ‘v2’, print all paths from given ‘v1’ to ‘v2’. The idea is to do Depth First Traversal of given directed graph. Start the traversal from v1. Keep storing the visited vertices in an array say path[]. If we reach the vertex v2, pathExist becomes true

Machine Learning (ML)

Image Denoising and various image processing techniques for it

We will take a look at what is an Image?, what is an Image Noise?, what are the various types of Noise?. Following it, we will understand the various traditional image processing filters and techniques used for image denoising.

Machine Learning (ML)

Use of deep learning in NLP techniques

You will get an idea about What is NLP?, use of deep learning in NLP and 5 impressive applications of deep learning for NLP like image captioning

Machine Learning (ML)

Applications of Autoencoders

Autoencoders are neural networks that aim to copy their inputs to outputs. The applications of autoencoders are Dimensionality Reduction, Image Compression, Image Denoising, Feature Extraction, Image generation, Sequence to sequence prediction and Recommendation system.

Software Engineering

Working with device location using HTML Geolocation API

HTML Geolocation API is used to get the current position of the user. The Geolocation API is used using the navigator.geolocation object.The Geolocation interface represents an object able to programmatically obtain the position of the device.

Software Engineering

Working with HTTP requests in Python

The internet is made up of a bunch of resources hosted on different servers and interact using HTTP. What is HTTP and how it works? Working with different HTTP requests in Python using the requests library Understanding the information that web resources interact with and use it programmatically

Software Engineering

Understanding and working with Memset in C

memset is a memory utility in C which is used to set a particular value to a range of memory locations in an efficient way. On going through this article, you will understand How to use memset? and Why performance of memset is better than a simple implementation?

Software Engineering

Working with Typedef in C

typedef is a keyword in C programming language,which stands for type definition. How to use typedef? Why and when to use typedef? Difference between typedef and define

Software Engineering

boolean (bool or _Bool) datatype in C

C programming language (from C99) supports Boolean data type (bool) and internally, it was referred as `_Bool` as boolean was not a datatype in early versions of C. In C, boolean is known as bool data type. To use boolean, a header file stdbool.h must be included to use bool in C.

Software Engineering

Working with character (char) in C

C uses char type to store characters and letters. However, the char type is integer type because underneath C stores integer numbers instead of characters. Characters supported by a computing system depends on the encoding supported by the system.

Software Engineering

Reading Data from Files in Java

We will explore 5 different ways of reading files in Java BufferedReader, Scanner, StreamTokenizer, FileChannel and DataInputStream. What is the role of encodings like UTF-8 in reading data in Java? Exception/ Errors you may encounter while reading files in Java

Machine Learning (ML)

Different types of Autoencoders

Autoencoder is an artificial neural network used to learn efficient data codings in an unsupervised manner. There are 7 types of autoencoders, namely, Denoising autoencoder, Sparse Autoencoder, Deep Autoencoder, Contractive Autoencoder, Undercomplete, Convolutional and Variational Autoencoder.

Algorithms

Find Mother Vertex in a Graph【O(V+E)】

mother vertex in a graph is a vertex from which we can reach all the nodes in the graph through directed path. If there exist mother vertex (or vertices), then one of the mother vertices is the last finished vertex in DFS. (Or a mother vertex has the maximum finish time in DFS traversal).

Software Engineering

Working with Clipboard API and events in HTML

The Clipboard API provides a way to hook into the common clipboard operations of cutting, copying and pasting so that web application can adjust the clipboard data as required. There are two ways we can interact with the system clipboard Document.execCommand() and asynchronous Clipboard API

Software Engineering

Working with images in HTML

Images can be inserted into our HTML page using tag. The tag is an empty tag, which means that it does not have a closing tag. We can insert parameters of the element using various attributes like src, alt, height and width.

Software Engineering

Creating and resolving Deadlocks in Java

The term Deadlock refers to a situation in multithreading, where two or more threads are blocked forever, waiting for each other. In Java, we use synchronized keyword to make the class or method thread-safe.The keyword ensures that only one thread can access the resource at a given point of time.

Algorithms

Kosaraju's Algorithm for Strongly Connected Components 【O(V+E)】

Kosaraju algorithm is a DFS based algorithm used to find Strongly Connected Components(SCC) in a graph. It is based on the idea that if one is able to reach a vertex v starting from vertex u, then one should be able to reach vertex u starting from vertex v

Data Structures

Fibonacci Heap

A Fibonacci heap is a heap data structure similar to the binomial heap. It uses Fibonacci numbers and also used to implement the priority queue element in Dijkstra’s shortest path algorithm which reduces the time complexity from O(m log n) to O(m + n log n)

Algorithms

Count paths from Top Left to Bottom Right of a Matrix using Dynamic Programming【O(M*N)】

Count all the possible paths from top left to bottom right of a m x n matrix with the constraints that from each cell you can either move only to right or down. Brute force approach takes exponential time while dynamic programming takes O(M*N) time complexity

Algorithms

Using Farach Colton and Bender Algorithm to solve LCA【O(V) query】

The basic idea of Farach Colton and Bender Algorithm is to traverse all the nodes using the Depth First Search graph traversal and keep a record of all the visited nodes and there corresponding heights. This allows to answer LCA queries in O(V) time complexity

Software Engineering

Variables and Datatypes in Kotlin

In this article, you will learn How to declare variable in Koltin?, How kotlin infers the type of variables? and How to work with various data types?

Algorithms

Finding the Lexicographical Next Permutation in O(N) time complexity

In Lexicographical Permutation Algorithm we will find the immediate next smallest Integer number or sequence permutation. Finding all permutations take O(N!) time complexity but we present an efficient algorithm which can solve this in O(N) time complexity

Algorithms

Heap’s algorithm for generating permutations

Heap's Algorithm is used to generate all the possible permutation of n-decimals of a number. It generates each permutation from the previous one by interchanging a single pair of elements; the other n−2 elements are not disturbed. For N numbers, it takes O(N!) time complexity

Software Engineering

Working with history object of HTML DOM

The browsers history is present in the history object. We can use the window part (window.history) or just simply history. It contains an array of URLs or links visited by the user.