Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Considering X and Y as binary variables, the Boolean expression XY’ + X’Y’ is equivalent to 
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) }}
What specifies the values of a Boolean expression for every possible combination of values of the variables in the Boolean expression?
Considering X as a binary variable, the Boolean expression X.X’ is equivalent to
Considering X as a binary variable, the Boolean expression X + X’ is equivalent to 
Which of the following is/are correct about a strictly binary tree? A. A binary tree is called strictly binary tree if every non-­leaf node of it has non empty left and right sub tree B. In strictly binary tree can have two children or no child C. A strictly binary tree with n leaves always contact 2n­-1 nodes
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?
Suppose we want to design a synchronous circuit that processes a string of 0’s and 1’s. Given a string, it produces another string by replacing the first 1 in any subsequence of consecutive 1’s by a 0. Consider the following example. Input sequence: 00100011000011100 Output sequence: 00000001000001100 A Mealy Machine is a state machine where both the next state and the output are functions of the present state and the current input. The above mentioned circuit can be designed as a two-state Mealy machine. The states in the Mealy machine can be represented using Boolean values 0 and 1. We denote the current state, the next state, the next incoming bit, and the output bit of the Mealy machine by the variables s, t, b and y respectively. Assume the initial state of the Mealy machine is 0. What are the Boolean expressions corresponding to t and y in terms of s and b ?
2x+3y3x+2y=56 হলে কোনটি xঃy ?
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)