Bissoy.com
Doctors Medicines MCQs Q&A

In Java, which one will be used for comparing whether the two string object str 1 and str? are same

In Java, which one will be used for comparing whether the two string object str 1 and str? are same Correct Answer All of the above

String can be compared by using in many ways. Such as if(str 1.equals(str2)); if (str 1.equals Ignore case (str 2) if(str 1.compare to (str 2) = = 0), if (str 1 = = str 2) etc.

Related Questions

In the following Visual Basic code, what will be in msg, if str contains "visual basic"?
Dim str as StringDim msg as StringIf str.toUpper="VISUAL BASIC" msg="VB.Net"Else msg="Not Visual Basic"EndIf
In the following Visual Basic code, what will be in msg, if str contains "ik"?
Dim str as StringDim msg as StringIf str.toUpper="IK" msg="Hi"Else msg="Bye"EndIf
Comment on the output of the following C code.
#include int main(){ char *str = "This" //Line 1 char *ptr = "Program\n"; //Line 2 str = ptr; //Line 3 printf("%s, %s\n", str, ptr); //Line 4}
In Java, which one will be used for comparing whether the two String object str1 and str2 are same --
How many objects will be created? String a = new String("Examveda"); String b = new String("Examveda"); String c = "Examveda"; String d = "Examveda";
What is the output of the following JAVA program? class Test { public static void main (String [ ] args) { Test obj = new Test (); obj.start (); } void start () { String stra="do”; String strb = method (stra); System.out.print(“:” + stra + strb); } String method (String stra) { stra=stra+”good”; System.out.print (stra); return “good”; } }
atol(const char *str) Converts the string pointed to, by the argument str.
What is the result of the following code snippet?

try {
String str = null;
System.out.println(str.length());
} catch (NullPointerException e) {
System.out.println("NullPointerException!");
} catch (Exception e) {
System.out.println("Exception!");
}
Consider the following problems. L(?) denotes the language generated by a grammar ?. L(?) denotes the language accepted by a machine ?. (I) For an unrestricted grammar ? and a string ?, whether ? ∈ (?) (II) Given a Turing machine M, whether L(M) is regular (III) Given two grammars ?1 and ?2, whether (?1) = (?2) (IV) Given an NFA N, whether there is a deterministic PDA P such that N and P accept the same language. Which one of the following statements is correct?
Suppliers(Sid: integer, sname:string, city:string, street:string) Parts(pid:integer, pname:string, color:string) Catalog(sid:integer, pid:integer, cost:real) Consider the following relational query on the above database: SELECT S.sname FROM Suppliers S  WHERE S.sid NOT IN (SELECT C.sid FROM Catalog C WHERE C.pid NOT IN (SELECT P.pid FROM Parts P WHERE P.color < > ‘blue’)) Assume that relations corresponding to the above schema are not empty. Which of the following is the correct interpretation of the above query?