In this tutorial we will be learning about 0-1 Knapsack problem. In this dynamic programming problem we have n items each with an associated weight and value (benefit or profit). The objective is to fill the knapsack with items such that we have a maximum profit without crossing the weight limit of the knapsack. Since this is a 0-1 knapsack problem hence we can either take an entire item or reject it completely. We can not break an item and fill the knapsack.

This is an Apache ActiveMQ getting started tutorial.

In this video we will learn about Activity Selection Problem, a greedy way to find the maximum number of activities a person or machine can perform, assuming that the person or machine involved can only work on a single activity at a time.

Alligation important formula and notes.

In this tutorial we will be learning to append text in VIM text editor.

ASCII characters,American Standard Code for Information Interchange

An average also known as the arithmetic mean is the sum of the given observations divided by the number of observations.

Balanced Parenthesis

In this tutorial we will learning about basic laws and properties of boolean algebra.

In this tutorial we will learn about the basic logic gates - AND OR NOT

Bellman Ford algorithm is used to find the shortest paths from a source vertex to all other vertices of a given weighted directed graph. This algorithm will work well even if the graph has a negative weight edge.

Searching algorithm - binary search

In this tutorial we will learn binary to decimal conversion for a number with fractional part.

In this tutorial we will learn binary to decimal conversion for an integer number.

In this tutorial we are learning about Breadth First Search (BFS) for a graph. The graph can be both a directed graph and a non directed graph and can also contain cycles.

Sorting Algorithm - Bubble sort - step by step guide

In this tutorial we will be learning about Bucket sort algorithm. In this sorting algorithm we create buckets and put elements into them. Then we apply some sorting algorithm (Insertion Sort) to sort the elements in each bucket. Finally we take the elements out and join them to get the sorted result.

In calendar problems the question will ask us to find the name of the day for any given date. So, in order to solve the question we have to find whether the given year is a leap year or an ordinary year, we have to find the number of odd days and so on.

Chain Rule important formula and notes.

In Unix like operating system the files are organised in a hierarchical directory structure which is similar to a tree like structure. The first directory in this directory structure is called the root directory and it contains all the other files and subdirectories.