COMPUTER SCIENCE AND ENGINEERING
DIGITAL LOGIC
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
1
|
|
|
0
|
|
|
Either A or B
|
|
|
None of the above
|
Detailed explanation-1: -1 + 1 = 1 (since “true OR true” is true). 1 x 1 = 1 (since “true AND true” is true). A x NOT A = 0 (since “true AND false” is false).
Detailed explanation-2: -In mathematics, a Boolean function is a function whose arguments and result assume values from a two-element set (usually true, false, 0, 1 or -1, 1). Alternative names are switching function, used especially in older computer science literature, and truth function (or logical function), used in logic.
Detailed explanation-3: -Boolean Logic is a form of algebra that is centered around three simple words known as Boolean Operators: “Or, ” “And, ” and “Not.” These Boolean operators are the logical conjunctions between your keywords in a search to help broaden or narrow its scope.
Detailed explanation-4: -2.5. 7. What is the minimum number of cell groups that can be obtained from the Karnaugh map using logic 1 cells only? a) Two groups.