Me as a Computer Student!

by

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?

by

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) {
return;
}
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

WEATHER

by

We exist
Under falling skies
Frozen in time
Frozen in the air
Falling upon thoughtful eyes
Shrugging off winter
Letting it fall
Through skin and bones
A battlefield of stars
Firing cannons
Knocking down warmth
Tearing down resolve
The skies cannot penetrate
The memory of spring