Bissoy.com
Doctors Medicines MCQs Q&A

Which of the following Boolean rules is correct?

Which of the following Boolean rules is correct? Correct Answer A + 1 = 1

Concept:

All Boolean algebra laws are shown below

Name

AND Form

OR Form

Identity law

1.A = A

0 + A = A

Null Law

0.A = 0

1 + A = 1

Idempotent Law

A. A = A

A + A = A

Inverse Law

AA’ = 0

A + A’ = 1

Commutative Law

AB = BA

A + B = B + A

Associative Law

(AB)C

(A + B) + C = A + (B + C)

Distributive Law

A + BC = (A + B) (A + C)

A (B + C) = AB + AC

Absorption Law

A (A + B) = A

A + AB = A

De Morgan’s Law

(AB)’ = A’ + B’

(A + B)’ = A’B’

 

Related Questions

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)
The network rules are common to all activity on arrow networking systems. The use of computers for making computations may impose certain rules. Which of the following basic rules of network logic are correct? (1) Before an activity may begin, all the activities preceding it must be complete. (2) Any two events may be directly connected by no more than one activity. (3) Event numbers must not be duplicated in a network. Select the correct answer using the codes given below:
In the question below, are given a statement followed by three courses of actions numbered I, II and III. On the basis of the information given, you have to assume everything in the statement to be true, and then decide which of the following suggested courses of actions logically follow(s) for pursuing. Statement: Soon VAT 69 whiskey and Smirnoff Vodka will not be found on the shelves of Delhi Liquor stores owing to the duplication of barcode by manufacturer United Limited. The Delhi government financial commissioner blacklisted the manufacturer. Financial commissioner Anindo Majumdar had said in an order dated September 14, that USL had violated provisions of the Delhi Excise Act, 2009 and Delhi Excise Rules, 2010 by using unauthorized and loose barcodes, which could be easily misused. Courses of action: I. The ban will force United Spirits Limited not to sell its liquor in the national capital for two years. II. the appellant violated provisions of the Delhi Excise Act, 2009, Delhi Excise Rules, 2010, the terms and conditions of the license issued to it and the standard operating procedure framed by the Delhi Excise Department and that consequently the department has rightly imposed the penalty of blacklisting under Rule 70 of the Delhi Excise Rules, 2010 upon United Spirits LTD (USL), Aurangabad. III. United Limited has been blacklisted by the Delhi government financial commissioner.
'The rules of the natural justice are not embodied rules' means that these rules ---
There are two rows, each containing 3 numbers. Some rules are given below to be used for obtaining the resultant number for each row separately. Apply the rules for each row from left to right and answer the question. Rules: i. If an even number is followed by an even number, the first is to be subtracted from the second. ii. If an odd number is followed by an odd number, both are to be added. iii. If an odd number is followed by an even number, the even number is to be subtracted from the square of the odd number. iv. If an even number is followed by an odd number, the odd number is to be subtracted from the even number. Row I: 28, 19, 12 Row II: 13, 7, 32 What is the average of the resultant numbers of the first row and the second row?
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?
Any set of Boolean operators that is sufficient to represent all Boolean expressions is said to be complete. Which of the following is not complete?
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 ?
Minimize the following Boolean expression using Boolean identities. F(A,B,C) = (A+BC’)(AB’+C)