Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

A university library budget committee must reduce exactly five of eight areas of expenditure - I, J, K. L, M, N, O and P - in accordance with the following conditions: If both I and O are reduced, P is also reduced. If L is reduced, neither N nor O is reduced. If M is reduced, J is not reduced. Of the three areas J, K and N exactly two are reduced. If both K and N are reduced, which one of the following is a pair of areas neither of which could be reduced?
A university library budget committee must reduce exactly five of eight areas of expenditure—I, J, K, L, M, N, O and P—in accordance with the following conditions: If both I and O are reduced, P is also reduced.
If L is reduced, neither N nor O is reduced.
If M is reduced, J is not reduced.
Of the three areas J, K, and N exactly two are reduced. Question : If both K and N are reduced, which one of the following is a pair of areas neither of which could be reduced? 
interface Base{ boolean m1 (); byte m2(short s);}

which two code fragments will compile?
1. interface Base2 implements Base {}2. abstract class Class2 extends Base { public boolean m1(){ return true; }}3. abstract class Class2 implements Base {}4. abstract class Class2 implements Base { public boolean m1(){ return (7 > 4); }}5. abstract class Class2 implements Base { protected boolean m1(){ return (5 > 7) }}
Which of the following problems is NOT NP-complete? I. Checking satisfiability of arbitrary Boolean formulae II. Checking satisfiability of Boolean formulae in conjunctive normal form (CNF/product of sums) III. Checking satisfiability of Boolean formulae in disjunctive normal form (DNF/sum of products)
You are given a boolean expression which consists of operators &, | and ∧ (AND, OR and XOR) and symbols T or F (true or false). You have to find the number of ways in which the symbols can be parenthesized so that the expression evaluates to true. This is the boolean parenthesization problem. Which of the following methods can be used to solve the problem?
What specifies the values of a Boolean expression for every possible combination of values of the variables in the Boolean expression?
For the given grammar G: S->ABaC A->BC B->b| e C->D| e D-> d Remove the e productions and generate the number of productions from S in the modified or simplified grammar.
The Average weight of the family consists of four members i.e. Mother, Father, Daughter, and Son. By dieting family reduces weight and the Average weight of the family reduced by 6 Kg, Mother and Father reduced 2 kg each, and Daughter and Son reduced weight in ratio 3 : 2 How much Kg Daughter reduced weight?
Minimize the Boolean expression using Boolean identities: A′B+ABC′+BC’+AB′C′.
Minimize the following Boolean expression using Boolean identities. F(A,B,C) = (A+BC’)(AB’+C)