Program below is working i just don't know what to do for the algorithm on keyevents for right,left,up and down
The code like y+=10; is just my assumption for the snake movement.....
I believe below the path.reset() code has to be change since stack is being use...
Can anyone help me program to run correctly?

/***
* PROVIDE THE MISSING CODE in the keyPressed() method
* in order to move the 'snake' around the interface
* by pressing:
*
* --> cursor keys
* --> CTRL-Z to 'undo' last move
* --> CTRL-Y to 'redo' past/last move
*/

package midterms;

import java.awt.*;
import java.awt.event.*;
import java.awt.geom.*;
import javax.swing.*;
import java.util.*;
import javax.swing.border.*;



public class Snakes extends JPanel implements KeyListener {
final static long serialVersionUID = 1;
final private int WIDTH = 600;
final private int HEIGHT = 400;

LinkedList<Point> snake = new LinkedList<Point>();
Stack<Point> undo = new...

[ Continued ]

Many CIOs (Chief Information Officers) look back to the early days of enterprise mobility as the good old days, when things were just so much simpler for them. There were few mobility devices and fewer platforms, which made it much easier to implement security solutions. Most of the enterprise employees were baby boomers and the attempts to circumvent company security were much fewer. In those early days, the mobility devices were mostly company owned and provided to the employees for carrying out the company’s work. The cost of buying and maintaining such devices was considered to be a necessary evil by most companies in those days. At that point, few people could have predicted that there was a storm coming.

The storm came with the introduction of the first Apple iPhone, intensified with the advent of devices powered by Google’s android and the whole enterprise mobility landscape started to change at a rapid pace. The availability of iPhone and Android powered devices, which were cap...

[ Continued ]

i cant compile my coding because a several error. i'm try to find it by change its syntax. but it does not work. can anyone help me?

the question ask to display student name, total marks, and status.



[ Continued ]

I need to create a Java program that:

Takes as input a rooted tree T and a node c of T and converts T to another tree with the same set of node adjacency but now rooted at v.

any suggestions to start off?

while using wait and notify or notifyAll method in Java following things must be remember :

1) use notifyAll instead of notify if you expect more than one thread is waiting for lock.
2)wait() and notify() method must be called from synchronized context, see the link for more detailed explanation http://javarevisited.blogspot.com/2011/05/wait-notify-and-notifyall-in-java.html.
3) Always call wait() method in loop because if multiple threads are waiting for lock and one of them got lock and reset the condition and other thread needs to check the condition after they got wake up to see whether they need to wait again or can start processing.
4) use same object for calling wait() and notify() method, every object has its own lock so calling wait() on objectA and notify() on object B will not make any sense.