Content

Depth First Search Graph

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

Design a Calendar for your Blog and Website using HTML5 CSS3 and JavaScript Web Project

In this project we will make a simple calendar using HTML5 CSS3 and JavaScript.

Design a simple calendar for your blog and website using HTML5 CSS3 and JavaScript Web Project

In this project we will make a simple calendar using HTML5 CSS3 and JavaScript.

Detecting negative cycle using Bellman Ford algorithm Graph

In this tutorial we will be using Bellman Ford algorithm to detect negative cycle in a weighted directed graph. Bellman Ford algorithm is useful in finding shortest path from a given source vertex to all the other vertices even if the graph contains a negative weight edge. And Bellman Ford algorithm is also used to detect if a graph contains a negative cycle.

Documentation dyScrollUpJS

dyScrollUpJS is a small jquery plugin that you can use in your website and blog to create "Scroll-to-top" button.

Documentation dyClockJS

This is the documentation of the open source project dyClockJS - a small plugin to create digital and analog clock for your blog and website.

Exercise 1 Flowchart

Solving few flowchart problems. For instance, draw a flowchart to log in to facebook account.

Exercise 1 Pseudo Code

Pseudo Code - Exercise

Exercise 2 Flowchart

Solving flowchart problem.

Factorial Recursion Algorithm

Factorial - Recursion Algorithm

Fibonacci Series Recursion Algorithm

recursion algorithm fibonacci series

Flow of Control Pseudo Code

Pseudo code - Flow of Control

Floyd Warshall Algorithm Graph

Floyd's or Floyd-Warshall Algorithm is used to find all pair shortest path for a graph. This algorithm works for weighted graph having positive and negative weight edges without a negative cycle.

Fractional Knapsack Problem Greedy Algorithm

In this tutorial we will learn about fractional knapsack problem, a greedy algorithm. In this problem the objective is to fill the knapsack with items to get maximum benefit (value or profit) without crossing the weight capacity of the knapsack. And we are also allowed to take an item in fractional part.

Free and Paid video editing softwares for YouTube Reference YouTube

This is a reference note of some of the video editing softwares that can be used to edit videos for YouTube.

Getting Started ChartJS

In this tutorial we will learn about ChartJS which is a simple yet flexible JavaScript charting for designers & developers.

Greatest Common Divisor - GCD Recursion Algorithm

Greatest Common Division recursion algorithm

Greek Letters Reference Symbol

Greek Letters in HTML

HCF and LCM Aptitude

HCF of two or more numbers is the greatest or highest factor that is common to each of the given numbers. While, LCM of two or more numbers is the least or smallest multiple that is common to each of the given numbers.

Heap Sort Sorting Algorithm

In this tutorial we will be learning about Heap sort algorithm. In this sorting algorithm we first build a heap using the given elements. If we want to sort the elements in ascending order we create a
 Min Heap. And to sort the elements in descending order we create a 
Max Heap.Once the heap is created we delete the root node from the heap and put the last node in the root position and repeat the steps till we have covered all the elements.