OpenGenus IQ: Learn Algorithms, DL, System Design (Page 123)

Types of Neural Networks

Today, there are over 10 types of Neural Networks and each have a different central idea which makes them unique. We have explored all types in this article

Machine Learning (ML)

Text Generation using LSTM

LSTM are a perfect fit for text generation as text are a sequence of words and can predict the next word. We have explained the basic idea and developed a demo for it

Algorithms

Rolling Hash

Rolling hash is an algorithmic technique which is used to prevent rehashing the whole string while calculating hash values of the substrings of a given string

Software Engineering

Approaches for implementing Autocomplete Feature

The various approaches for Text Auto-completion are Linear Search (Brute Force), Binary Search Approach, TRIE Data Structure, Ternary Search Tree Approach, Fuzzy Search, Burkhard Keller Tree Approach and Machine Learning Approach.

Software Engineering

Shortest Job First CPU Scheduling algorithm

Shortest Job First (SJF) CPU scheduling algorithm is a CPU scheduling algorithm which is based on the principles of Greedy Algorithms. The key idea is to allocate the CPU to the process with the smallest burst time.

Algorithms

Find the number of subsets of an array having a given XOR value

We are given an array of size N and a value M, we have to find the number of subsets in the array having M as the xor value of all elements in the subset. This can be solved using Dynamic Programming in linear time.

Machine Learning (ML)

K-medoids Clustering

K-medoids Clustering is an Unsupervised Clustering algorithm that cluster objects in unlabelled data. It is an improvement to K Means clustering which is sensitive to outliers.

Software Engineering

Idea behind HTTPS

HTTPS is a protocol which is an improvement over HTTP and is the shortform of HyperText Transfer Protocol Secure. In this article, we will look at the short comings of HTTP which lead to the development of HTTPS and some basic ideas behind HTTPS.

Algorithms

Longest repeating and non overlapping substring in a string

We have to find the longest repeating and non-overlapping substring in a given string. Brute force approach takes O(N^3) time while Dynamic Programming takes O(N^2) time.

Algorithms

Minimum number of Fibonacci terms with sum equal to a given number N

Given a number N, we need to find the minimum number of fibonacci numbers required that sums up to a given number N. Note a fibonacci number can be repeated

Software Engineering

Get details of a place and nearby places using Geo API of Twitter

In this article, we will use the Geo API of Twitter API and use it to get details of a place and find out nearby places (co-ordinates) to it. This is interesting as one may think that Twitter is all about Tweets but classifying data across Geography is a major feature of Twitter.

Software Engineering

HTML <span> tag explained

Span tag in HTML is an inline element which can be used to apply special styling (using CSS) or behaviour (using JavaScript) to a specific component in a div, p and other tags.

Software Engineering

Basics of Web-VR using A-frame

A-frame is an open-source web framework for building Virtual Reality(VR) applications. It is used for a well-known javascript library known as Three.js. It allows developers to create 3D and virtual reality experiences using HTML.

Software Engineering

Ternary Operator in C

Ternary operator in C is an alternative syntax for if else conditional statement. It is usually used to condense if else statements.

Data Structures

Burkhard Keller Tree (BK Tree)

Burkhard Keller Tree (BK-Tree) is a Tree Data Structure that is used to find the near-matches to a String Query. It is used in several applications like spell correction and autocompletion.

Software Engineering

A Deeper Look at HTTP Requests

In this article, we looked in how HTTP requests like GET, PUT and others are formed, how websites interact with them and the response send back.

Algorithms

Binary exponentiation (Power in log N)

Binary exponentiation is an algorithm to find the power of any number N raise to an number M (N^M) in logarithmic time O(log M). The normal approach takes O(M) time provided multiplication takes constant time.

Algorithms

2 Sum Problem: Number of pairs with a given sum

We will find out how we can count the number of pairs in an array whose sum is equal to a certain number. Brute force approaches will take O(N^2) time but we can solve this in O(N) time using a Hash Map.

Algorithms

Shortest Path with k edges using Dynamic Programming

Given a weighted directed graph, we need to find the shortest path from source u to the destination v having exactly k edges. Brute force approach takes O(V^k) time complexity which we reduce to O(V^3 * k) using dynamic programming

Data Structures

Must read research papers on Data Structures

We presented research papers on Data Structures that are a must read for everyone. These come from authors like Raimund Seidel, Knuth, Rubinchik and others

Algorithms

Number of paths with k edges using Dynamic programming and Divide and Conquer

Given a directed graph, we need to find the number of paths with exactly k edges from source u to the destination v. A brute force approach has time complexity which we improve to O(V^3 * k) using dynamic programming which we improved further to O(V^3 * log k) using a divide and conquer technique.

Algorithms

Must read research papers on Algorithms

We presented some of the must read research papers in the field of Algorithms. The papers come from authors like C. A. R. Hoare, D. E. Knuth, V. Strassen and many others.

Software Engineering

XMLHttpRequest to make HTTP requests

XMLHttpRequest can be defined as an API in the form of an object which is used to transfer data between the web browser and the web server. It gives us the ability to update parts of a web page without reloading the whole page

Data Structures

Autocomplete Feature using Ternary Search Tree

Autocomplete Feature can be implemented using Ternary Search Tree as well which is a memory optimized version of trie and performs equally well.

Machine Learning (ML)

Linear vs Logistic Regression

We have explored the differences between Linear and Logistic regression in depth. We looking into the applications of Linear and Logistic regression along with a basic background.