Yesterday is history. Tomorrow is a mystery. Today is a gift. That’s why it’s called the present.


Facts About Engineers!

1. For engineers every course apart from engineering is easy.

2. An engineer learns to power of getting up at 8:00 am and reaching in the class at 8:30 am.

3. T-shirt and jeans are engineers national dress and maggie national food.

4. A normal person will fix the broken things but an engineer will first brake that thing and than he would fix it. This is his lab work you don’t have  right to disturb him.

5. An engineer can build a car, space ship and they even can make time machine. However they just can’t build a relationship with a girl.

6. An engineer don’t care for the rise in rate of petrol or gold .

7. An engineer loves to solve a problem. If there is no problem than they will create one and would start solving it.

8. An engineer touches his car and phone more than his girl, if he have.

9. An engineer can have Dr. title but a doctor can’t have Er. title.

10. An engineer can derive any relation just give them the final expression.

11. Are you made of copper(CU) and tellurium(TE), because you’re CUTE. This is how Engineers flirt.

12. Non engineers have great mind, genius mind , brilliant mind but an engineer never mind.

13. An engineers’s worst nightmare is teacher taking the class but not taking attendance.

14. An engineer can finish his syllabus in one night.

15. An Engineer knows nothing, but only an Engineer knows this.

16. An Engineer will never sleep in night and will never wake up in morning.

17. An Engineer is the most innocent person in front of his parents.

18. Never argue with an engineer because arguing with Engineers is like killing the mosquito on your cheek, you might or might not kill it, but you’ll end up slapping yourself.

19. The most common dialogue on the opening day of an engineering college is, “Bhai, iss saal khoob dil laga k parhna ha!”

20. There is always a hidden folder in engineers laptop.

Me as a Computer Student!

Over the past few years, I have developed a great interest in computer science, software development, and the IT industry. However, my motivation for studying computer science took shape from very early on, when my school introduced me to computers. The novelty, rapid pace of change, precision and different approach to information of computer science deepened my interest in this field, leading me towards pursuing this subject in my university studies.

The first real programming I did was when I implement my first semester project dealing with software applications.The success of these admittedly modest but extremely self-instructive programs and my having to deal with day-to-day software and hardware difficulties encouraged me to choose a computer science . 

High-school has allowed me to consolidate my knowledge of computer science. Throughout the last four years of my education, I have built a strong base in algorithms and their direct relations to mathematical problems, broadening my view of informational systems. Creating web-pages has shown me an area where my creativity could best express itself. Using complex algorithms enabled me to find the quickest route to a solution and, at the same time, has changed the way I see competition.

I have always been interested in the open source movement, taking part in the testing of new software and attending events dealing with technological advancement.

I want to continue studying computer science in order to expand my skills as a software creator, which I see as prerequisite for a career in information technologies later on.


Tower of Hanoi program in JAVA?

The towers of hanoi is a popular problem. You have three poles and n disks which fit on the poles. All disks have different size. They are stacked on pole 1 in the orders of their size. The largest disk is on the bottom, the smallest is on the top.

The task is to move all disk from pole 1 to pole 3 under the following restrictions.

Only one disk can be moved

A larger disk can not be placed on a smaller disk.

The recursive algorithm works like the following: move n-1 disk from the starting pole to the pole which is neither start nor target (intermediate), move disk n to the target pole and then move n-1 disk from the intermediate pole to the target pole. The n-1 disks are moved recursively.

public class MinimumWindow {

public static void move(int n, int startPole, int endPole) {
if (n == 0) {
int intermediatePole = 6 – startPole – endPole;
move(n – 1, startPole, intermediatePole);
System.out.println(“Move ” + n + ” from ” + startPole + ” to “
+ endPole);
move(n – 1, intermediatePole, endPole);

public static void main(String[] args) {
move(5, 1, 3);


Below is the output…

Move 1 from 1 to 3
Move 2 from 1 to 2
Move 1 from 3 to 2
Move 3 from 1 to 3
Move 1 from 2 to 1
Move 2 from 2 to 3
Move 1 from 1 to 3