Java | JSP | JSF Answers

Questions answered by Experts: 3 611

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Search

A school has three houses A, B and C. Write a program to read a house and the points awarded for winning each race in an athletic finals terminated by “D”. Calculate and print the total points gained by each house appropriately labeled. Also print the 1 St and 3rd house entered and the points.
draw a trapezoid
write a program to draw a dog house use fillRect for the use, drawLine for the roof (you cant fill it though), fillRect for the door, drawString to print your dogs name over the door
write a program to create a picture frame. use fillRect() to create the bottom layer in one color. use another fillRect for an inner rectangle for the next layer in another color. finally use fillOval() inside the inner rectangle for the top layer in a 3rd color
write a program that plots 5 different colored pixels anywhere on a graphics screen with a black background
An electricity board charges the bill according to the number of units consumed and the rate as given below write a program in java to accept the total number of units consumed by a customer and calculate the bill assume that a meter rent of rs 500 is charged from the customer
Use regular expressions to describe all integer constants in Java. Java integer

constants can be in decimal, octal or hexadecimal notation. Octal constants are

made of a leading zero followed by digits from 0 to 7. Hexadecimal constants have

a prefix “0x” or “0X” followed by characters which are either digits or letters

from A to F, lower or upper case.
Write a program in Java 2 input the names of n cricketers and the number of one day matches they have played till date into two separate one dimension arrays sort the array size in alphabetically order of names using selection sort then display the names and find the number of players who have played more than 200 matches
Give an example graph in which Dijkstra’s algorithm gives the wrong answer in the presence of a negative cost edge but no negative-cost cycle
Write a Java program to create a two-dimension array (m x m) A[][] such that A[i][j] is true if i and j are prime and have no common factors, otherwise A[i][j] becomes false.
LATEST TUTORIALS
APPROVED BY CLIENTS