Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Which of the following statements about Regular Expression is/are incorrect? A. The union of two regular expressions is also a regular expression B. The concatenation of two regular expressions is also a regular expression C. The iteration of a regular expression is also a regular expression
Attraction causes infatuation. Infatuation causes anger. Anger causes frustration. Therefore attraction causes frustration. Point out the correct statement from the following:
Which of the following among item A and item B are correct?
The right of private defence extends, subject to Section 99, to the causing of death of the assailant or aggressor in the following circumstances:
Item A: For defence of body:
1. Against an act which reasonably causes the apprehension of an assault to outrage the modesty
2. Against an act which reasonably causes the apprehension that the assailant will kill his children living in another city
3. Against an act which reasonably causes the apprehension that grievous hurt would otherwise be the consequence
Item B: For defence of property:
1. While the trespasser is engaged in house breaking during day time.
2. Against a thief who reasonably causes the defender to believe that he would lose his property
3. Against a person who commits mischief under such circumstances as may reasonably cause apprehension that grievous Hurt would be a consequence
Select the correct answer:
Consider the causes of failure of the Revolt of 1857– 1. Betrayal from ruling Princes and Elites. 2. Lack of capable leader. 3. Lack of determined objectives. Which of the above causes is/are main causes?
Mycobacterium leprae causes leprosy, Corynebacterium diphtheria causes diphtheria and Vibrio comma causes
Mycobacterium leprae causes leprosy, Corynebacterium diphtheria causes diphtheria and Vibrio comma causes
A quadratic expression in x, when divided by (x – 2) and (x + 3), leaves remainders 13 and 8 respectively. If the expression is divisible by (x – 1), find the quadratic expression.
Consider evaluating the following expression tree on a machine with load-store Architecture in which memory can be accessed only through load and store instructions. The variables a, b, c, d and e are initially stored in memory. The binary operators used in this expression tree can be evaluated by the machine only when the operands are in registers. The instructions produce result only in a register. If no intermediate results can be stored in memory, what is the minimum number of registers needed to evaluate this expression?
Consider the following expression 1. Y = f (A,B,C,D) = ∑(1,2,4,7,8,11,13,14) 2.Y = f (A,B,C,D ) = ∑(3,5,7,10,11,12,13,14) 3.Y = f(A,B,C,D) = π(0,3,5,6,9,10,12,15) 4.Y = f(A,B,C,D) = π(0,1,2,4,6,8,9,15) which of these expression are equivalent of the expression Y = A⊕B⊕C⊕D
Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?