In this part of Data Structure in C tutorial series, I will explain what is Queue and I will show you - how to write a Queue from scratch in C. Queue is a very important data structure and is often asked in interviews. Candidates are asked to explain and write complete Queue code from scratch. They are also asked to implement a Queue using Stacks.
Read More

In this second article of the Placement Interview package, I will explain how hash map works and how to create your own Generic Hash Map in Java from scratch with all possible functionalities like search, exist, delete etc.
Read More

This is the part - I of the Placement Interview package. This contains all the sorting algorithms with running code so that one can quickly refer to all the sorts in one place.
Read More

In this part of Data Structure in C tutorial series, I will explain what is Circular Queue and I will show you - how to write a Circular Queue from scratch in C. Circular Queue is a very important data structure and is often asked in interviews. Candidates are asked to explain and write complete Circular Queue code using Array.
Read More

I always wanted to write about my fascinating interview experience with Xerox but did not get the right opportunity or time to express the same. Now having fixed a bug in the code of the revolutionary project I have been working on in XRCI, I am thinking to refresh myself a bit by writing my Interview experience with XRCI which happened one and half year ago.
Read More

I have appeared in five interviews till now and have not got rejected till date. All these interviews had a managerial and/or HR round. I have heard from many of my friends that they did very well in the technical rounds and somehow fell short in the HR round and got rejected in the end. In this article I will share useful tips regarding how to clear this Final hurdle between you and your dream job.
Read More

​In this part of Data Structure in C tutorial series, I will explain what is HashMap and I will show you - how to write a HashMap from scratch in C. HashMap is a very important data structure and is often asked in interviews. Candidates are asked to explain and write complete HashMap code from scratch
Read More

Many fresh graduates ask me how to proceed with their career, which technology to work on etc. Depending upon one's area of interest and expertise the answer may swing to many different directions. The competition now is insane compared to five years back. If you are not careful enough during the initial years, you may end up losing your precious time and energy in vain. In this article I will discuss different routes a fresh graduate can take to have a rewarding career.
Read More

In this part of Algorithms in C tutorial series, I will explain what is Depth First Search and I will show you - how to write a Depth First Search from scratch in C. Depth First Search is one of the very important Algorithms. Many programming problems are efficiently solved using Depth First Search or DFS. This is often asked in interviews.
Read More

Giraph is powerful Big data processing distributed computing platform. Facebook extensively uses Giraph for their graph processing and Facebook engineers have heavily contributed to this open source project. It sits on top of Hadoop. Giraph works using message passing and it's installation is very easy. It's the exact same procedure that they explain in their site. However once we you are done with the setup and want to do your own customization, then it's a real pain as there is no good documentation available. You have to rely on the mailing list and go through many trials and errors. In this article I will explain with a detailed example how to do your own customization and safely ride the Giraph.
Read More