Help

[rsjava24]

Hello everyone! Just new to java. Can i ask anybody to pls answer this? How can I convert Stack into a java program? Thank you.

[masijade]

Maybe I could if I knew what you were talking about.

[quad64bit]

yeah, here is teh codez:

Stack = (Codez) new JavaProgram(1337);

[[RaIdEn]]

yeah, here is teh codez:

Stack = (Codez) new JavaProgram(1337);

lol,

ok heres a tutorail and examples
Stacks

[rsjava24]

Hehe;) thanks for reply..but anyway I need to see a sample of java program of converting infix-postfix and postix-infix using Stack Application. Any, reply will be appreciated. Thank you.:)

[masijade]

A "sample" program? A "sample" program would also, coincidentally, be 90%, or more, of the work required for your assignment.

Instead of asking for a "sample" program, why don't you show us what you already have and explain, in detail, where the problem with it is.

[r035198x]

Why do you need that sample?
So you can submit it in class as yours?

[rsjava24]

Yes sir. Not only i can submit to class but i need to study about it. Thank you.:)

[r035198x]

Better write your own code. That's the purpose of the assignment.
So that you can learn to write Java code.
We can help if you get stuck with your code.

[rsjava24]

ok but i don't know how to start it. ok I will try to start my own code maybe next time when i go to internet cafe again coz i am about to time's up. thanks for your time & talk to you soon again.

[r035198x]

ok but i don't know how to start it. ok I will try to start my own code maybe next time when i go to internet cafe again coz i am about to time's up. thanks for your time & talk to you soon again.

Start by understanding what infix and postfix is and how to convert between the two.
Create some algorithms for the conversion (compare them against existing ones) and then convert the algorithms into a Java program.

[rsjava24]

Ok sir here I am again..this is the algorithm...

this is an example given = (5 + 3 6) * (4 6 / 5 -)

while stack is not empty
if symbol is '('
push
else
pop

I have no idea how to convert this into a java program and run. Can somebody please give me an example? Thank you.:)

[rsjava24]

Hi masijade thanks for response. Anyway, I already sent my algorithm. Hope you can send me back an example java program. Thank you.

[masijade]

Ok sir here I am again..this is the algorithm...

this is an example given = (5 + 3 6) * (4 6 / 5 -)

while stack is not empty
if symbol is '('
push
else
pop

I have no idea how to convert this into a java program and run. Can somebody please give me an example? Thank you.:)

Look at the Stack class, and then try to implement your algorithm. Then, when you have problems with it, post your code here and we will help you correct it.

Edit: I am not, however, implying that your algorithm is correct. You should study that a bit more.

[rsjava24]

Ok thank you.;)

[collin389]

This is a helpful site for the conversion algoritham:
Infix to Postfix Conversion

[rsjava24]

Oh thank you Collin..this is a big help.

[rsjava24]

Anyways this is a Stack.java code & how cAN i make this a Queue.java & add a length method in a Queue? There's a little bit differences between Stack & Queue my Prof said. Thank you.



public class Stack {

private Node top;


public Stack() {

top = new Node('J');


}


public void push(char c) {

Node n = new Node(c);
n.setNext(top.getNext());
top.setNext(n);


}


public boolean isEmpty() {

return top.getNext() == null;


}


public char pop() {

char c = top.getNext().getValue();
Node n = top.getNext();
top.setNext(n.getNext());
n.setNext(null);

return c;


}


public char peek() {

return top.getNext().getValue();



}


class Node {


private char value;
private Node next;


public Node(char c) {

value = c;
next = null;



}


public char getValue() {

return value;


}



public void setNext(Node n) {


next = n;



}


public Node getNext() {

return next;


}



}




}

[masijade]

Well, just like you looked at the API for Stack, look at the API for Queue.

[rsjava24]

Oh by the way what is API hehe:) & where can I look API for Queue? Thank you.