touch me

I am doing some project based on java in tomcat 5.5.

I copied my application in C:\Program Files\Apache Software Foundation\Tomcat 5.5\webapps\ROOT\MYapplicaion

I installed j2sdk1.4.0 and changed my data source to connect my database.

Now, My problem is that I am unable to refer to the url "http://localhost:8080/website/webpage.jsp

what should I do?

plz help me out as soon as possible

It comes once in a year.

twice in a month

4 times in a week

and 16 times a day.

Whats that.

answer plz. urgent

Given an array of size 'N' which contains numbers

in some random order;

ur task is to return the sum of (N/2) smaller

elements;assume N is even;

for example:: if the array contains

2,5,7,6,3,4;

ur method should return 9

i.e;(2 3 4);

time constraint O(N);

Given an array of size 'N' which contains numbers

in some random order;

ur task is to return the sum of (N/2) smaller

elements;assume N is even;

for example:: if the array contains

2,5,7,6,3,4;

ur method should return 9

i.e;(2 3 4);

time constraint O(N);

Hii

Can anyone give a solution for this.

Find the largest one of 2 no. s using only ARITHMETIC operators and without using logical operators in C language

hi friends,

here goes a puzzle which i found interesting.

there is a king, and his job is the following:

there were N wine bottles, out of which ONE is POISONOUS. king shud find out which one of those is poisonous. He asks prisoners to drink them. what is the minimum number of prisoners does the king require inorder to find out the poisonous one. all prisoners will drink them at the same time. a prisoner may drink more than one wine bottle. for example, he could employ N prisoners , and ask each one to drink them. then one will be dead. so he can know which is poisonous. an immediate improvement could be to employ N-1 prisoners only. now it is ur job to reduce the number of prisoners.if a prisoner drinks a wine bottle now, then he will die after 30 days. king shud find the wine bottle in 30 days.

hi friends,

here goes a puzzle which i found interesting.

there is a king, and his job is the following:

there were N wine bottles, out of which ONE is POISONOUS. king shud find out which one of those is poisonous. He asks prisoners to drink them. what is the minimum number of prisoners does the king require inorder to find out the poisonous one. all prisoners will drink them at the same time. a prisoner may drink more than one wine bottle. for example, he could employ N prisoners , and ask each one to drink them. then one will be dead. so he can know which is poisonous. an immediate improvement could be to employ N-1 prisoners only. now it is ur job to reduce the number of prisoners.if a prisoner drinks a wine bottle now, then he will die after 30 days. king shud find the wine bottle in 30 days.