I had a question about data structures. For the insert method of a linked list, the 'node' object is declared in the insert method. So doesn't the 'node' get destroyed as soon as the closing brace of the insert method is encountered? How do all the nodes continue to occupy memory?
View Replieswhen final variable occupy memory in java?
View Replies View Related public void add(int d){
listNode l = new listNode (d, null);
l.next = first;
first= l;
}
public list Sum2List (list l1, list l2){
//variables
int sum;
[Code] .....
But I have a problem in my first listNode where it ll be pointing to null, thus in the sum2List method the program checks the while condition into false and doesn't go through the loop.
I was told to write a method that adds up the sequence of the formula (n/2n+1) eg. 1/3 + 2/5 + 3/7 etc. simple enough i suppose. my method is below
public static double Series(int n){
if (n==0)return 0;
else return (n/(n*2+1)) + Series(n - 1);
}
However for some reason or another it returns 0 for any number that is put in. I've written it dozens of different ways with no change and i feel like something fairly obvious is being missed on my part. I am honestly intrigued and interested as to why this is happening. i assume it has something to do with the way i put the actual formula in cause if i put anything else in like simply n the recursion would work as expected.
I have this program I have to write(attached). I am having problems with what the structure will look like. The following what I have so far. The questions I have are in bold.
>get userInput of how many observations
>for(int i = 1; i <= userInput; i++)
>for(int j = 1; j <= 1; j++)
>use a switch(case) method to ask user to select an option(1,2,3)
>example, user chooses option 1:
>ask to input time
>print displacement
>ask user to stop application(Y/N)
>IF "No" is selected --------->>
How do I continue with the loop if user decides to not quit? -- And do I need to put this in each 'case'?
I read on how to use the continue statement, but I'm failing in how to use it properly, mostly because it's not working. I'm supposed to print out what numbers are showing up and how many times for each. Plus, I have to print out 'times' instead of 'time' if there's more than one of a certain number. Right now, it's printing out all the numbers including the ones that don't get inputted.
import java.util.Scanner;
public class occurrence {
public static void main(String[] args) {
//scanner/values
Scanner input = new Scanner(System.in);
int number = 101;
[Code] ....
having trouble trying to understand the insertion and removal of Nodes.
I have to insert a new node at the end of the linked nodes, if i insert by terminal : 1, 2, 3. The printed nodes are going to be in the same order, 1,2, 3.
I have done the exercise, but it only prints the last node created and i dont know where its the problem. We did it before with "insert at the beginning", may be the problem is with the print() method in SimpleList.java, but i dont know how to print "backwards".
This is the code:
Node.java
public class Node {
public int infoNodo;
public Node next;
}
SimpleList.java
public class SimpleList {
private Node head;
[code]....
I need to calculate id=hash(number) xor id.id is string and number is random number.
My problem is how to convert my string ex='hello' into equivalent integer,so that i can do xor.
I have client and server program. I need to display a gui by using graphical nodes.
I have noticed that you can style JavaFX controls using their sub-structure.
E.g. to style the label in a table column header to be left justified I can do this :
.table-view .column-header-background .label { -fx-alignment: center-left ; }
How can I style my own nodes/controls doing this? Basically it amounts to asking how the selectors like ".column-header-background" are associated with sub-structures of my Java control/node objects. So suppose I have something like
.fancy-node .fred .label { ... }
How does JavaFX associate fancy-node and fred with something in my implementation of a Node/Control?
import java.io.*;
import java.util.ArrayList;
public class SpiltList
{
private class node
{
int number;
node next;
[code]....
I am using an ArrayList to make a list of nodes. I cannot seem to find documentation on how to call the nodes, just find how to get int and strings from a list.
Is it possible to find the number of paths between two nodes in a directed graph using an adjacency matrix? I know how to find all said paths of a given length by using matrix exponentiation, but I don't know how to find all the paths. The professor didn't note it in the assignment but I assume she meant all simple paths because this is a cyclic graph, so there's a potentially infinite number of paths.
I'm thinking I should use matrix exponentiation to find the number of paths of lengths 1 to n-1, where n is the number of nodes in the graph. Then add the number of paths for each length together. Would this work?
I have the following code that supposed to perfrom sorting on the linked list using method sort in order usind node concept of Linked List but seems to give inlogic results. the following code tests only the values lower than the first value but i can't manage to sort the data higher than the first entered value;
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
import java.util.*;
public class ListNode<T extends Comparable> {
ListNode<T> nextNode;
T data;
public ListNode(T item)
[Code] .....
i am trying to assign unique values to nodes read from XML file.. eg: consider this XML file:
<breakfast_menu>
<food>
<name>Belgian Waffles</name>
<price>$5.95</price>
<description> ...Strong Belgian waffles...</description>
<calories>650</calories>
[code]....
now assigning these nodes "a unique value" has to be done following the LSDX labelling pattern i.e:
To the document element we first give an “a”.As there is no parent node for the document element, we assign “0” at the front of that “a” . “0a” is the unique code for the document element (breakfast_menu). For the children nodes of “0a”, we continue with the next level of the XML tree which is “1” then the code of its parent node which is “a” and a concatenation “.” . We then add a letter “b” for the first child, letter “c” for the second child, “d” for the third child and so on.Unique codes for children nodes of “0a” shall be “1a.b”, “1a.c”, “1a.d”, etc.Hence foe the above given XML the mapping would look something like this:
0a breakfast_menu
1a.b food
2ab.b name
2ab.c price
2ab.d description
2ab.e calories
2ab.f chef
3abf.b chef1
3abf.c chef2
1a.c food
2ac.b name
2ac.c price
2ac.d description
2ac.e calories
2ac.f chef
3acf.b chef1
3acf.c chef2
For more samples about LSDX labelling : 1.) Section 3.1 LSDX Labelling on this link: [URL]
2.) Fig 3 on page 1189 on this link:[URL]
right now i am using SAX parser to read xml and get the nodes in their hierarchical order..now the problem is that i have to assign these specific value to their respective nodes using java.
What is better and easier approach for exchanging data (in my case list of objects) between servlets in different nodes in same cluster? I thought about RMI or just direct url servlet call. But it seems that I'm missing something here.
My problem is the following:
I have to create some kind of diagnostic storage for each cluster member. It will collect all information and errors during application work.
And If I need to check application status I do web request and it will show me that these servers (cluster members) are okay and that node has an issue.
I'm using spring and tomcat.
The task is
-getting words from dictionary text file and inserting them into a hash table - DONE
-getting words from a usertext file and inserting them into a red-black tree - STUCK
-after that i need to see if there is nodes of words that dosen't exist in the dictionary and print if so
kinda like a spelling checker
OK so the main code that hold the reading and storing part of dictionary and inserting to hash table
import java.io.FileReader;
import java.util.*;
import java.util.Arrays;
import java.io.File;
import java.io.BufferedReader;
import java.util.ArrayList;
[Code] .....
I am doing an assignment in my Java class and I need to connect the nodes to make a 12 pointed star. I have already drawn out the star and figured out which nodes to connect together. The only thing I cannot get is to show all of the nodes in the order they connect. I can only get the first 3 nodes to show up. I need it to wrap around and basically keep adding 5 to the last node until all numbers 0-11 are used.
public class StarWinding {
public static void main(String[] args) {
for (int i = 0 ; i < 12; i+=5) {
System.out.print(i + " ");
}
}
}
And the out put so far is: 0 5 10
I need it to be: 0 5 10 3 8 1 6 11 4 9 2 7
TL,DR: observe the nodes just below, that is the data each node in the link list contains. How do I iterate through the entire list to reach the last element (H), so I can add an element right after it?
So I have 4 nodes doubly linked with two dummy nodes for head and tail:
head
node1 = {A}
node2 = {null, B}
node3 = {C, null, D, E}
node4 = {null, F, null, G, null, null, H, null}
tail
Ok, so since the list only contains 8 elements that are not null, its size is actually 8 correct? So now lets say I have an add method that has
add(E item) and inserts the item at the end of the list. So I can get to the last node with tail.previous(), but then how do I iterate to the end so I can add the item after the last item in the list (H). I guess I don't know how you only access one nodes data when that data is an array with empty spaces.
Here is the entire Node code:
Also, I can't just iterate through the whole thing because I am not supposed to. I am supposed to just find the right node and iterate through that only.how to maneuver around a linked list containing nodes where each node contains an array.
/**
* Node class that makes up a DoublingList. Feel free to add methods /
* constructors / variables you might find useful in here.
*/
public class Node<E> {
/**
* The node that comes after this one in the list
[code]....
Write a Java function Sum2List that takes two lists L1 and L2 of the same size and returns list L that contains the sum of data inside the corresponding nodes of lists L1 and L2.
View Replies View RelatedMy issue is that when I run my search, it does find a goal. However, when I try and print the route using my print route method, it just gets stuck in a loop of printing the same two nodes. What is wrong with My A* implementation?
package search;
import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedList;
[code]....
Sample XML:
XML Code:
<Books>
<Book id="1" Name="C#">
<URL>http://localhost/download/M1.xml</URL>
</Book>
<Book id="2" Name="Oracle">
<URL>http://localhost/download/M2.xml</URL>
</Book>
<Book id="3" Name="Archius">
<URL>http://localhost/download/M3.xml</URL>
<URL>http://localhost/download/M4.xml</URL>
</Book>
</Books> mh_sh_highlight_all('xml');
I have to fetch only the book name attribute and use it for display .However say for example ,I have got the list of Books ie(C#,Oracle,Archius) ,passing this value to a method should return me an array of URL nodes value within it.
The idea is to display the book names in a list and then on user selection , corresponding URL needs to be fetched.
Was able to get the loop for traversing the nodes
[java=code]
NodeList nodeList = document.getDocumentElement().getElementsByTagName ("Book");
for (int i = 0; i < nodeList.getLength(); i++) {...
[java=code]
So
a) Display the BookNames
b) Get the corresponding URL's for the particular book if I pass the Bookname
I thought I had a simple idea for creating a control that would let me get some of the behavior of a card pane. This is the entire control:
import javafx.beans.property.BooleanProperty;
import javafx.beans.property.SimpleBooleanProperty;
import javafx.beans.value.ChangeListener;
import javafx.beans.value.ObservableValue;
import javafx.scene.Node;
[Code] ....
The idea is pretty simple; extend StackPane, add an active property, bind the visible and managed properties of the pane to the active property, and, whenever the active property is changed to true, iterate sibling nodes de-activating any siblings that are also of the type Card.
However, this doesn't work with Scene Builder. While trying to debug, I created an ExtStackPane:
import javafx.collections.ListChangeListener;
import javafx.scene.Node;
import javafx.scene.layout.StackPane;
public class ExtStackPane extends StackPane {
{
getChildren().addListener((ListChangeListener<Node>) c -> {
System.out.println("ExtStackPane children change: " + c.toString());
});
}
}
All this does is log list change events. However, I was very surprised by the output when working in Scene Builder. I added both controls to Scene Builder and did the following:
0) Added an ExtStackPane
1) Added a Card to the ExtStackPane
2) Added another Card to the ExtStackPane
3) Added a Label to the first Card
4) Added a Label to the second Card
5) Changed the text of the first Label to Hello
6) Changed the text of the second Label to World
7) Set the first Card to active
8) Set the second Card to active
I get the following output:
1)
ExtStackPane children change: { [Card@5b9067b3] added at 0 }
2)
ExtStackPane children change: { [Card@6b6328bd] added at 0 }
ExtStackPane children change: { [Card@6aca8cc5] added at 1 }
[Code] ....
This is what things look like in Scene Builder:
Does Scene Builder recreate the entire hierarchy every time I make a small change? Here's an application that does the same as the manual steps I performed in Scene Builder:
import javafx.application.Application;
import javafx.scene.Scene;
import javafx.scene.control.Label;
import javafx.stage.Stage;
public class CardApplication extends Application {
[Code] ....
The output when running the above is:
1)
ExtStackPane children change: { [Card@6dfaa767] added at 0 }
2)
ExtStackPane children change: { [Card@6aa2c411] added at 1 }
[Code] ....
The behavior is obviously a lot different than when I'm working with the control in Scene Builder. What Scene Builder is doing to change the behavior of my Card control so much? Does my Card control break some rule(s) I'm not aware of?
I have xml document, which is shown below:
After removing some nodes from the document ,i am getting empty lines in place of removed nodes,how to resolve this and get the proper xml document without any errors...
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE Message SYSTEM "TRD01.dtd">
<Message>
<Header>
<CounterPartyType>CLIENT</CounterPartyType>
<CreationTime>20134455</CreationTime>
[Code] ....
The xml output i am getting is
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<Message>
<Header>
<CounterPartyType>CLIENT</CounterPartyType>
<CreationTime>20134455</CreationTime>
[Code] ....
How to avoid empty lines in the xml doucment output. This is the method i am using to get the result
public void ValidateRecord(String xml){
try{
DocumentBuilderFactory factory = DocumentBuilderFactory.newInstance();
DocumentBuilder db = factory.newDocumentBuilder();
//parse file into DOM
/*DOMParser parser = new DOMParser();
parser.setErrorStream(System.err);
[Code] .....
Trying to implement PageRank in a naive manner with graph nodes as pages and subsequent calculations. Correcting the code.
import java.util.*;
import java.io.*;
class PageRank {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter no.of pages");
int n=sc.nextInt();
[Code] .....
how to get shortest path between two nodes in adjacency matrix using with undirected weighted graph using BFS algoritham java program??
View Replies View RelatedAatrox
Champions@3622e177
Champions@4805e9f1
Champions@57e40274
Champions@354124d6
Champions@262f4813
Champions@64f01d52
Frozen Heart
Randuin's Omen
As you can see instead of displaying the champion name it is displaying the memory location and I do not know how to fix it.
class Champions
{
String name;
Champions [] weak = new Champions [3];
Champions [] strong = new Champions [3];
String [] items = new String [3];
public static void main (String [] args)
{
[Code]...
For some reason my code returns the memory address of the array when its a print statement with a string, but it works fine when its in a separate print statement all by itself. Why? Do I need to create a toString method that converts a char array to a String to something? The reason why I ask that is becuase on Eclipse line 10 has a warning stating "Must explicitly convert char[] to a String".
public class Ex {
private String word;
public Ex(String word) {
this.word = word;
}
public char[] Display(){
char[] wordChars = this.word.toCharArray();
return wordChars;
[Code] .....
Result:
Hello world
The word is: [C@1db9742
I also tried this, knowing that it's a long shot, but that didnt do anything...
public String toString(){
Ex ex = new Ex(this.word);
char[] word = ex.Display();
String updated = word.toString();//counter intuitive?
return updated;
}