## 0-1 Knapsack ProblemDynamic Programming

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.

## ActiveMQ - Getting StartedApache ActiveMQ

This is an Apache ActiveMQ getting started tutorial.

## Activity Selection ProblemGreedy Algorithm

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.

## AlligationAptitude

Alligation important formula and notes.

## Appending text in VIM text editorUnix

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

## ASCII CharactersReference Symbol

ASCII characters,American Standard Code for Information Interchange

## AverageAptitude

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

## Babel - Getting StartedBabel

In this tutorial we will learn to use Babel a JavaScript compiler.

## Babel - Using Babel with GruntBabel

In this tutorial we will learn to use Babel a JavaScript compiler with Grunt.

## Balanced ParenthesisProgramming

Balanced Parenthesis

## Basic laws and properties of Boolean AlgebraBoolean Algebra

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

## Basic Logic Gate - AND OR NOTLogic Gate

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

## Bellman Ford AlgorithmGraph

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.

## Binary SearchSearching Algorithm

Searching algorithm - binary search

## Binary to Decimal conversion of a number having fractional partConversion

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

## Binary to Decimal conversion of an integer numberConversion

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