Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

In the following question, some part of the sentence may have errors. Find out which part of the sentence has an error and select the appropriate option. If a sentence is free from error, select 'No Error'. If you would still accepting posts, please (1)/ let me know so that I can put together (2)/ a draft for your approval. (3)/ No Error (4)
Consider a circle with centre at O and radius 7 cm. Let QR be the chord of length 2 cm and let P be the midpoint of QR. Let CD be another chord of this circle passing through P such that ∠CPQ is acute. If M is the midpoint of CD and MP = √24 cm, then which of the following statements are correct? (1) ∠QPD = 135° (2) If CP = m cm and PD = n cm, then m and n are the roots of the quadratic equation x2 – 10x + 1 = 0 (3) The ratio of triangle OPR to the area of triangle OMP is 1 ∶ 2√2 Select the correct answer using the code given below.
Phrases in the sentences given below are underlined. Choose the option which you feel can replace all of the underlined phrases. If there is no improvement needed, please click on "No improvement required". 1. I need to figure out how to fit the piano and the bookshelf in this room. 2. Please fill in the form with your name, address, and phone number. 3. The form must be filled out in capital letters.
In the following question, a sentence is given in Direct/Indirect speech. Out of the four alternatives choose the one which best expresses the sentence in Indirect/Direct Speech. The old man said to the jailer, "Please let me go and see my son."
Let L(R) be the language represented by regular expression R. Let L(G) be the language generated by a context free grammar G. Let L(M) be the language accepted by a Turing machine M. Which of the following decision problems are undecidable? I. Given a regular expression R and a string w, is w ∈ L(R)? II. Given a context-free grammar G, is L(G) = ϕ? III. Given a context-free grammar G, is L(G) = ∑* for some alphabet ∑? IV. Given a Turing machine M and a string w, is w ∈ L(M)?  
Let G be a simple undirected graph. Let TD be a depth first search tree of G. Let TB be a breadth first search tree of G. Consider the following statements. (I) No edge of G is a cross edge with respect to TD. (A cross edge in G is between two nodes neither of which is an ancestor of the other in TD .) (II) For every edge (u, v) of if u is at depth i and v is at depth j in TB , then |? − ?| = 1. Which of the statements above must necessarily be true?
A coin is tossed thrice. Let X be the event that head occurs in each of the first two tosses. Let Y be the event that a tail occurs on the third toss. Let Z be the event that two tails occur in three tosses. Based on the above information, which one of the following statements is TRUE?
Consider a gas enclosed in a box. Let the walls have an area of 0.01m2. Let’s say a few molecules having their x-component of velocity =2m/s, hit a wall parallel to the yz plane. What will be the value of force on the wall in time dt? Let the number of molecules per unit volume be 10 & mass of each molecule be 10-20kg.
The statement, “At least one of your friends is perfect”. Let P (x) be “x is perfect” and let F (x) be “x is your friend” and let the domain be all people.
Let S be a set of n>0 elements. Let be the number Br of binary relations on S and let Bf be the number of functions from S to S. The expression for Br and Bf, in terms of n should be ____________