Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

To check whether string s1 contains another string s2, use . . . . . . . .
How many objects will be created? String a = new String("Examveda"); String b = new String("Examveda"); String c = "Examveda"; String d = "Examveda";
Mayank is doing an experiment in the lab with a bob of mass 10 Kg and a string of 6 m. He tied a string with the laboratory roof and another end with the bob. He then tied another string at 3 m below the roof with the previous one as shown in the figure. Find the tension T1 in the string? g =10 m/s2
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?
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”; } }
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?
The _______________ operator allows you to use pattern matching characters to determine whether one String is equal to another String.
The . . . . . . . . operator allows you to use pattern matching characters to determine whether one String is equal to another String.
In the following questions are to be based on the details given below. A salesman visits 274 houses in a town to find out the views about three products X, Y and Z. He found that 157 use X, 98 use only X, 22 use all the three, 14 use X and Z but not Y, 39 use Y and Z, 48 use only Y. How many use product Z only?
Which of these methods of class String is used to check whether a substring exists at the beginning of the particular string?