Answer Posted / shanu zabeen

//consider the follwing program part

for(int k = 0; k < 10; k++);
System.out.println("hi");
int k = 9
while(k < 10)
{
System.out.println("world");
k++;
}
//now lets trace the program as follows
start, at the for loop, k is initialized to 0 with a scope
local to the for loop itself.
k = 0
Is it less than 10? yup, so we enter the loop.
Next, we have output,
hi.
Since there is no brackets, the for loop applies only to the
very next line. In this case, the output. So, return to the
top of the loop, k increments by 1
k = 1
and we proceed again since 1 < 10.
The output "hi" is printed again.
Go back to the top of the loop, increment k, and recheck the
loop condition of k < 10. The above cycle repeats until k is
incremented and equals 10. Since 10 is not less than 10,
exit the for loop.
:
k = 10
next
Now, declare an integer k to be equal to 9.
k = 9
Note it has local scope to this part of the program but,
since the for for loop previous one is gone from memory, so
too is the integer k that it (the loop) declared.
Thus, there is no conflict. So, an integer variable k (one
different from the last) is now = 9

Check the while boolean condition and k is less than 10 so
enter the while loop.
Next, print the output
"world"
Next, increment k by 1 ("k++") so
k = 10
Check the while loop conditional again but, this time, it's
false. k is not less than 10 anymore. So, exit the while loop.

In java, why do we set thread priority, when we know that there is no guarantee by which a thread should be execute?

2196

---

write a program in java to solve a system of n-variabled simultaneous equations using the guassian elimination method. let the maximum possible value of n be 100. run the program using hypothetical values for a set of 10- variables simultaneous equations. print out the program, the input equation and the results generated by the program.

4315

---

write a c program which takes 20 numbers in an array as input from user and rearrange them in two different array defining even or odd

2698

---

what is runtime class?

2321

---

write a program in java to find the moving average of all prime numbers between 2 and 100.

3678

---

---

Is there any static classes are in java give some examples

1768

---

Can we run Applet in Web browser with security policy files

2179

---

Bubble Sort. java thereafter the user will be asked to inpout the size of the list,sort the list in ascending order and display the sorted list in a horizontal manner???

2613

---

How to create Date method to set the date in Ms Access

1938

---

Financial: credit card number validation) Credit card numbers follow certain patterns. A credit card number must have between 13 and 16 digits. It must start with: ■ 4 for Visa cards ■ 5 for Master cards ■ 37 for American Express cards ■ 6 for Discover cards In 1954, Hans Luhn of IBM proposed an algorithm for validating credit card numbers. The algorithm is useful to determine whether a card number is entered correctly or whether a credit card is scanned correctly by a scanner. All credit card numbers are generated following this validity check, commonly known as the Luhn check or the Mod 10 check, which can be described as follows (for illustration, consider the card number 4388576018402626): 1. Double every second digit from right to left. If doubling of a digit results in a two-digit number, add up the two digits to get a single-digit number. 2 * 2 = 4 2 * 2 = 4 4 * 2 = 8 1 * 2 = 2 6 * 2 = 12 (1 + 2 = 3) 5 * 2 = 10 (1 + 0 = 1) 8 * 2 = 16 (1 + 6 = 7) 4 * 2 = 8 2. Now add all single-digit numbers from Step 1. 4 + 4 + 8 + 2 + 3 + 1 + 7 + 8 = 37 3. Add all digits in the odd places from right to left in the card number. 6 + 6 + 0 + 8 + 0 + 7 + 8 + 3 = 38 4. Sum the results from Step 2 and Step 3. 37 + 38 = 75 5. If the result from Step 4 is divisible by 10, the card number is valid; otherwise, it is invalid. For example, the number 4388576018402626 is invalid, but the number 4388576018410707 is valid. Write a program that prompts the user to enter a credit card number as a long integer. Display whether the number is valid or invalid. Design your program to use the following methods: /** Return true if the card number is valid */ public static boolean isValid(long number) /** Get the result from Step 2 */ public static int sumOfDoubleEvenPlace(long number) /** Return this number if it is a single digit, otherwise, return * the sum of the two digits */ public static int getDigit(int number) /** Return sum of odd place digits in number */ public static int sumOfOddPlace(long number) /** Return true if the digit d is a prefix for number */ public static boolean prefixMatched(long number, int d) /** Return the number of digits in d */ public static int getSize(long d) /** Return the first k number of digits from number. If the * number of digits in number is less than k, return

5888

---

I am trying to pass the string firstName from a Servlet called SampleServet. I am running this on eclipse and it tells me that "the value for annotation attribute must be a constant expression. I don't understand why it is giving me this error. @PersonAnnotation(name = SampleServlet.firstName) public class AnnotationClass{

1915

---

what are the other loops except for for,while,do while and until?

2392

---

A game that has five levels of play has the score for each level stored in an array. You are to write a program that goes through that array and finds: a) the minimum score, and the level at which it occurred b) the maximum score, and the level at which it occurred c)the average score for all five levels The score data you must use for this program are as follows: Game Level Score 1 450 2 316 3 148 Stack implementations is mandatory.

2203

---

For printing a message we use System.out.println in normal programs. We use String msg="text....."; Can't we use String msg=" " in normal programs and System.out.println("........") in applets. Please answer this question?

2257

---

write a java program to create a Frame with three scrolls, change the back ground color of the frame using functions with values of scrolls.

4273

---