Explain the following JAVA buzzwords?
92253
1. Java is highly secure:- Java applets cannot access memory space other than the one which is assigned to it on the host system. So, there is a reduced chance of applets running on your system and creating problems.\n\n2. Java is distributed:- Features like RMI (remote method invocation) allow a Java program to invoke a method of an object residing on a remote system (or a different JVM). This is needed in a distributed environment. JavaBeans and CORBA are also essential in a networked environment.\n\n3. Java is robust:- Java programs are quite sturdy (although compiling takes slightly more time time vis-a-vis C). The compiler converts the .java source codes into .class files which can be run on any OS with the appropriate interpreter. (This means compiling .java files into .class files in Linux and running them on Windows is possible.)
217510
<?= is used as a shortcut to echo or print a variable.\n\n<?=$variable_name;?>\n\nis the same as:\n\n<?print $variable_name;?>
535809
There a list of java FAQs at the following.
45197
Try visiting Javadoc. you will find there.
483781
There are two cases here. The difference between the two case is constructors called are different.\n\nCase 1:     \nString s = "smitha";\nThe above code is equivalent to:\n\nchar data[] = {'s', 'm', 'i', 't', 'h', 'a'};\nString s = new String(data);\nHere the constructor called is: public String(char[] data)\n\nCase 2:\nString s = new String("smitha");\nHere the constructor called is: public String(String str)
2509
Here's a java solution that uses recursion.  The permute function takes two arguments: a done portion and a todo portion.   The basic idea is that each of the characters in the todo portion could be the next character.  So, at each step, n recursive calls are made, where n is the length of todo.  Each call chooses a different character as the next character to go into the done portion.  So, the first time the number of recursive calls will equal the number of characters in the initial string.  Each of these calls will make further recursive calls equal to the number of characters in the initial string minus one.  And so on.  Thus, the number of solutions will be n! = n*n-1*n-2*...*1, where n is the number of characters in the initial string.\n\nThe program below was tested with java's sun compiler 1.4.2.\npublic class perm\n{\n  public perm(String S)\n  {     \n    permute("", S);\n  }     \n  public void permute(String done, String todo) \n  {     \n    if ((todo.length()==0)||\n        (todo.equals("")))\n      System.out.println(done);\n    else        \n    {           \n      for (int i=0; i<todo.length(); i++)\n      {                 \n        String c = todo.substring(0,1);\n        todo = todo.substring(1);\n        permute(done+c, todo);  \n        todo = todo + c;        \n      }                 \n    }           \n  }     \n  public static void main(String args[])\n  {     \n    if ((args.length==0)||\n        (args[0].length()==0)||\n        (args[0].equals("")))\n      return;           \n    perm p = new perm(args[0]);\n  }     \n}
387163
Use "..."\n\nI don't really get it, but there's some documentation here: http://courses.cs.vt.edu/~cs1704/notes/A02.AdvancedFunctionParameters.pdf
951062
http://java.sun.com/j2se/1.4.2/docs/api/java/util/Arrays.html
59731
Try the Java reference library.  Here is a link to it online:
143317
1) Stack overflow and underflow\n2) Memory Leak\n3) Dangling Pointers\n4) Exceptions not handled properly\n5) Null pointer
858407
Its a way for programmers to sperate the user interface with its code.  The program is OK, but haven't heard a  lot about it.
631736
Yes.\nThis is one of selling point of java
195503
There is no structure in Java.\n\nProbably you are confusing with C++>
436488
I assume we're in C or Java, right???\n\na) Loss of precision\nb) can't assign a string to a char (Java - in C there are no strings)\nc) value out of range\nd) incompatible type\ne) WORKS!!!
805034
#include<iostream.h>\nvoid main()\n{int a,b,c,d,e;\ncout<<"Enter any two numbers&#92;n";\ncin>>a>>b;\nc=a+b;\nd=a*b;\ne=a/b;\ncout<<"&#92;nThe sum of <<a<<|" and "<<b<<" is:"<<c;\ncout<<"&#92;nThe product of <<a<<|" and "<<b<<" is:"<<d;\ncout<<"&#92;nThe qoutient of <<a<<|" and "<<b<<" is:"<<e;\ngetch();\n}
826904
for (int i = 0; i < arrayA.length; i++)\nfor (int j = 0; j < arrayA[0].length; j++)\n  arrayC[i][j] = arrayA[i][j] + arrayB[i][j];\n\nSystem.out.println("  Values for arrayC");\nfor (int i = 0; i < arrayC.length; i++)\n   for (int j = 0; j < arrayC[0].length; j++)\n   {\n      System.out.print(arrayC[i][j]);\n      if(j < arrayC[0].length - 1)\n        System.out.print("   ");\n      else\n        System.out.println("");\n  }
713772
ok, create 3 methods, one called printHours(int time), printMinutes(int time) adn another called printSeconds(int time).\n\nin those methods just print to the screen(time / 24) for hours.\ntime  60 for seconds adn time devided by 60 for minutes, adn remeber to return any remainders the the calling function.(pass the remainder to the time unit below). thats it.\n\n\nP.S. welldone for giving it a try rather than just giveing the question and expecting the answers.