Blog

Consider the following code snippet: public class Vehicle { protected int numberAxles; . . . } Which statement is true about the accessibility of data in the numberAxles variable?

Consider the following code snippet: public class Vehicle { protected int numberAxles; . . . } Which statement is true about the accessibility of data in the numberAxles variable?

Which of the following statements about the TreeSet class is NOT correct?

Consider the scope of the three objects menuLabel, mi, and the anonymous object new MyMenuListener() within the JmenuItem class. How do thier lifetimes compare? public JMenuItem makeMenuItem(final String menuLabel) { JMenuItem mi = new JMenuItem(menuLabel); class MyMenuListener implements ActionListener { public void actionPerformed(ActionEvent e) { doSomethingElse(); System.out.println(menuLabel); } } mi.addActionListener(new MyMenuListener()); return mi; }

Consider the following code snippet: public class Vehicle { . . . public void setVehicleClass(double numberAxles) { . . . } } public class Auto extends Vehicle { . . . public void setVehicleClass(int numberAxles) { . . . } } Which of the following statements is correct?

Consider the following code snippet:   public class MyMouseListener { public void mousePressed(MouseEvent event) { double x; double y; _______ System.out.println(“x: ” + x + “, y: ” + y); } } Which of the following statements should be in the indicated position to print out where the mouse was pressed?

The _______ interface toolkit has a large set of user-interface components.

Consider the following code snippet:   public class MyMouseListener { public void mousePressed(MouseEvent event) { double x; double y; _______ System.out.println(“x: ” + x + “, y: ” + y); } } Which of the following statements should be in the indicated position to print out where the mouse was pressed?

Assume you are using a doubly-linked list data structure with many nodes. What is the minimum number of node references that are required to be modified to remove a node from the middle of the list? Consider the neighboring nodes.

Assume you are using a doubly-linked list data structure with many nodes. What is the minimum number of node references that are required to be modified to remove a node from the middle of the list? Consider the neighboring nodes.