If there is no implementation of MARKER INTERFACE in java. Then how compiler come to know about specification.
2 6443public class BatchTest { public static void main(String[] args) { Runtime run = Runtime.getRuntime(); try { Process p = run.exec("cmd start /c D:/test.bat"); System.out.println(p.exitValue()); } catch (Exception e) { e.printStackTrace(); } System.out.println("FINISHED"); } }
2347Which of the following can be referenced by a variable? A. The instance variables of a class only B. The methods of a class only C. The instance variables and methods of a class
2 16555I am unable to find or learn about print command. I have a graphical program in core java in applet but i want to give print command but i have coding for that so if anyone know about this plz mail me on avdhesh_chauhan007@yahoo.co.in
2047A abstract class extending an abstract class.Super class has both abstract and non-abstract methods.How can we implement abstract and non-abstract mehtods? Explain with snippet
3 6045
Explain the protected field modifier?
Can we have any code between try and finally blocks?
Can private method static?
What are the difference between string, string builder, and string buffer in java?
What is meant by nested loop?
What is the difference between serializable and externalizable interfaces?
Java is pass by value or pass by reference? Explain
Why destructor is not used in java?
What is string data type?
What is a map? What are the implementations of map?
How does hashmap work in java ?
Is 9 a prime number?
How do you sort an array in java?
What are the different types of inner classes?
For ease of programming you can consider the maze as a 2D array with colors represented by below integer and characters (in capital letters). • B - Black • W -White • G- Green • R- Red R B W B W W W W W W B W B B W W W W W W W B W B W W W B W W W W B B W W W B W W W B W W B B B B W B W B W W B W W W B W W W B B B W W B W W W B W W B W B W W W B W B W W W W B B W W W W B W W W W W G Shortest Route Problem: • Solution that finds the shortest Route between Red and Green White will have 1 Weight. Red and Green carry no weights. Shortest path is the path with less weight when you add up the weights in the path.