Wednesday 18 September 2013

Hashing in detail

Hashing is a technique of saving data in key/value form. So accessing data with help of key is quite fast , it has around O(1) Time complexity which is equivalent  to constant time.
Example :
• Input ["key"] = value , accessing value with help of key.
• Hashing technique used in cache system of our computer for 
   Fast data accessing between ram & cpu ( registers ).


Thursday 5 September 2013

Making facebook like plugins

In this tutorial i will show you how we can make facebook like plugins , so that others can use our service by just embeding a piece of code on there website.


Basics of Tree data structure

Tree data structure simulates a  hierarchical tree structure, with root and subtrees represented by linked nodes. Some Terminology Root...