I am using the shortest path algorithm to determine the connection between individuals within a given array. The array is written into the code and not read from external files.
When I am having problem is .. i am having problems how to prompt the user for the starting point or vertex and read that prompt to determine the starting point in the array. I know that this code :
computePaths(v0);
determines the starting point. i want to read "v0" from the user prompt.
Which of the following classes uses Comparable and Comparator?
QueueTreeSetStackPriorityQueue
In the above question, what does 'uses' mean? Does it mean do above classes implement Comparable and Comparator?
I know that in order to compare any two elements stored in one of the above classes, we need to make the elements' class to implement one of these - either Comparable or Comparator.
The title says already where my difficulties are. I forgot to say, the "S" printing part works, but why the others doesn't. To make it more clear:
java Monoton 1 3 3 4 & java Monoton 1 3 4 1
=> nothing (my output)
I forgot to notice, with 1 3 3 4 as parameters it jumps out at if (b < c), which is expected. but it jumps out of the whole if instead just run the else part. that's the essence of my problem.
The Exercise:
=> The program should print the following letters;
S, if every number is true bigger than the before,
M, if every number is bigger or equal than the before,
N in the other cases
Examples (from the exercise)
=> java Monoton 0 1 2 4
S
=> java Monoton 1 3 3 4
M
=> java Monoton 1 3 4 1
N
The Exercise should done without the use of logical operators or other combined requirements.
Java Code:
public class Main { public static void main(String[] args) { int a = Integer.parseInt(args[0]); int b = Integer.parseInt(args[1]); int c = Integer.parseInt(args[2]); int d = Integer.parseInt(args[3]);
I am teaching myself Java and am trying to write a function that will determine all of the perfect squares between 1 and 100 but am running into a problem...
Here's my code:
package sqrroot;
public class SqrRoot { /** * @param args the command line arguments */ public static void main(String[] args) { double sroot, rerr; int count = 0; for(double num = 1.0; num <= 100.0; num++){
[Code] ....
and here is the output:
run: 0.0 1.0 is a perfect square. 0.0 4.0 is a perfect square.
[Code] ....
There are 49 perfect squares between 1 and 100. BUILD SUCCESSFUL (total time: 6 seconds)
Which is clearly wrong. Is there something wrong with my code or is this due to inherent imprecision in the double type or the Math.sqrt function?
I'm looking to figure out if it's possible to do the following:
HttpSession session = request.getSession(); session.setAttribute('name', 'Jane_Doe'); // more code here session.setAttribute('name', 'John_Doe');
Obviously, you can use the HttpSessionAttributeListener to determine which attribute has changed. However, it doesn't return the new value but rather the old one.
You can use the HttpSessionEvent listener to determine when a session object has been changed.
Is there a way you can determine when a session object changes (and it does NOT occur when the setAttribute method is called...) and determine the updated key:value pair?
I was tasked with building a program that counts vowels in a phrase or word. I have this working properly, but the problem arises in the next situation. Here is my code:
Scanner userInput = new Scanner(System.in); int userDecision; String Choice; String Phrase; int vowelCount = 0; System.out.println(" This program will count the number of vowels in it.
[Code] ....
As you can see, I used a 'for' statement to declare how long the program should run. However, I need the user to be able to say when it ends. For example, at the end of the program it must say "There are ______ number of vowels in your word. Please press '1' to run the program again, or any other number to exit."
I understand a do-while loop is needed here, but every time I try and create an adequate loop with no logic errors, I either break my existing code, or the program does not work correctly.
Basically, my question is, what is the best way to perform this task? Is a do-while loop necessary, or is there a better way?
This method pretty much determines if there is a path from one vertex to another. When I check to see if there is a path from 5 to 2 (which there is) it return false. However, when I create a driver method, it return true (which it should). Why? It should never reach outside of the else because the condition is met, right???
Path: 5 points to 1 and 3 (1 does not have a path to anything). 3 points to only 0. 0 points to 1 and 2. Thus there is a path from 5 to 2.
Here is the code without the driver (the one that is returning false, even tho it should be true)
public boolean existsPath(int x, int y){//x = 5, y = 2 stack.push(x);//mark x as visited if(x == y){//path found stack.removeAllElements(); return true;
I am writing a program where i am trying to control a rectangle and determine where it moves, everything is working fine it is moving but i am trying to figure out how to change direction using the "WASD" keys. This is what I have and I am not sure why its not working.
Java Code:
addKeyListener( new KeyAdapter() { public void keyReleased(KeyEvent event) { for (MoveableShape creature : creatures) { if (((Creature)creature).isPlayer()) { if (event.getKeyCode() == KeyEvent.VK_W) //up
Write a program that detects Fibonacci numbers. Prompt the user to input a positive integer. Upon input, the program will determine if the number is either a Fibonacci number or not. If a Fibonacci number, then the order of the number in the sequence must be output. If not a Fibonacci number, then the Fibonacci numbers above and below it (including their order in the sequence) must be output. Once it finishes, the program will prompt the user for a new number. The program will exit if the user enters a string (such as “quit”) instead of an integer. Use the sample output file, fib-seq-det.txt, to view a sample session
This is my project, I wrote a programs that tells you if the input number is a fibonacci number or not. For some reason it only works for some Fibonacci numbers but not all of them.
import java.util.Scanner; public class While { public static void main(String[] args) { System.out.println("Welcome to the Fibonacci Sequence Detector "); Scanner in = new Scanner(System.in); System.out.print("Please input a number for analysis: "); int input = in.nextInt();
So I cant figure out why my output for my for loop isn't working properly. So the output for the square comes out right but the for loop isn't working properly for the H. I have tried to figure it out and it should go to the next line but its not.
import java.util.Scanner; public class Random { public static void main(String [ ] args) {
write a program to determine the sum of the following harmonic series for a given value of n:1+1/2+1/3+.............................+1/n the value of n should be given interactively through the keyboard.
I have a pane with numerous comboboxes. Each ComboBox must perform an action when the mouse button is clicked on the ComboBox (OnMouseClicked). I have written a function that operates on a particular ComboBox, but I want to generalize it to operate on any of the CombBox objects clicked. I think the function should resolve the CombBox object within the function itself, and perform the operations on that ComboBox. But, I don't know how to get the ComboBox from within the function itself.
I have tried viewing the ComboBox documentation, but there doesn't seem to be a method that lets a clicked ComboBox notify the OnMouseClicked action which ComboBox has been clicked. How I go about identifying the clicked ComboBox within the OnMouseClicked function?
I have been stuck on this for the past 2 hours, basically we have to compare user input, put user input into an array and compare for equivalency. An example of the program:
Array 1 & 2 are equal Array 1 & 3 are not equal Array 1 & 4 are not equal.
This cannot be done by importing Java.util.Array at all!! (my research only find this to compare arrays ) which is why I am having trouble starting off. My code thus far:
import java.util.Scanner; public class Lab07b { public static void main(String[] args) { Scanner input = new Scanner(System.in); System.out.println("Enter Integer 1:"); int a = input.nextInt();
The international Olympics Committee has asked you to write a program to process the data and determine the medal winners for the pairs figure skating. You will be given the following file: Pairs.txt
Which contains the data for each pair of skaters. The data consists of each skater's name, their country and the score from each of eight judges on the technical aspects and on the performance aspects. A typical record would be as follows:
Smith Jones Australia 5.0 4.9 5.1 5.2 5.0 5.1 5.2 4.8 4.3 4.7 4.8 4.9 4.6 4.8 4.9 4.5
The final score for each skater is the sum of the average of the two categories of score. Design a class to hold the above data and the final score. Read the data in from the file and calculate the final score for each pair. Sort the array of objects , and display the results on the screen in order, giving special prominence to the medal winners.
Here is my CLass:
public class Skaters { private String name1; private String name2; private String country; private double [] arrTech = new double [8]; private double [] arrArt = new double [8]; private double score;
[code]...
how do i print my 2 arrays using the file? i got the name1, name2 and counntry to print but im stuck on printing the scores that are stored in the arrays. Also, i have to print the average for each array. one is for techniques and the other one is artistic. as you can see i already wrote the code for it but im stuck in printing it.
I need to be able to detect IE 9, IE 10, IE 11 and the latest from Firefox and Chrome. The old method using the user-agent string is unreliable and not recommended. There is a different approach called, "Feature Detection". But I need to know what features to test to determine the browser. I can write it myself, or if there is a handy dandy API using feature detection already written that would be OK too.
I am new to java and do not understand how to use filters very well. I need to write a code that determines if an integer is not divisible by some value. A filter also contains an upstream filter so that this filter can be part of a chain of filters.
You have been given the job of writing a program to assist pilots who fly the Beechcraft Starship-‐‑1 executive aircraft.As with any airplane, it is essential that the pilot know the total weight of the loaded plane at takeoff and its center of gravity. If the plane weighs too much, it won'ʹt be able to lift off. If the center of gravity is outside the limits established for the plane, it might be impossible to control. Your task is to write a program that will determine the total weight and center of gravity of this plane
Inputs: The number of crew members, number of passengers, weight of the forward baggage compartment contents, aft baggage compartment contents weight, and the amount of fuel in gallons are to be accepted as INTEGER values in the order stated. Be sure the input values are within acceptable ranges
Outputs:You must echo the input values, annotated with their appropriate names,calculate and display the total weight, and the center of gravity.
I have an endpoint that will determine if a passed in integer is prime or not. Should the request to this endpoint be GET or POST? Right now, I'm thinking it should be GET since it doesn't do anything to any resource.