0
Add your answer:
Earn +20 pts
What is a slope of 0?
A horizontal line has a slope of 0. If you're using the slope formula, then when the numerator is equal to 0 then the slope is 0.
If a (0 0) and b (8 2) what is the length of ab?
The length of ab can be found by using the Pythagorean theorem. The length of ab is equal to the square root of (0-8)^2 + (0-2)^2 which is equal to the square root of 68. Therefore, the length of ab is equal to 8.24.
Why is 3 equal to 0.03?
Thing is, 3 doesn't equal 0.03... But... using false logic, it could be proved: Do we agree: 0/3 = 0/0.03 = 0 We know if: n/a = n/b then, a =b. Therefore, 3 = 0.03 However, you can't do that with a 0, so 3 doesn't equal 0.03
Is 2 divide by 0 is equal to 0 divide by 2?
No; they are not equal.
What does 0 plus 0 equal?
0 + 0 = 0
Which is not a gate?
Its truth table is: input output 0 1 1 0
What is the truth table of a inverter?
Input Output 0 1 1 0
Verify truth table of NAND gate using C programming?
I don't really know what this is supposed to mean, if you want to print the truth-table of the NAND-gate that will be something like this: for (a=0; a<=1; ++a) for (b=0; b<=1; ++b) printf ("%d %d %d\n", a, b, !(a&&b))
Make a truth table for the statement if p then not q?
. p . . . . . q. 0 . . . . . 1. 1 . . . . . 0
Draw truth table for AND OR Not?
.....0 10 | 0 01 | 0 1.....0 10 | 0 11 | 1 10 | 11 | 0
When a Boolean function said to be a self dual?
apparently whenever you can swap the 0's for 1's and 1's for 0's in the truth table and the truth result remains unchanged.
What is the difference between NA ND gate and NOR gate?
Truth table of 'NAND' is 0 0 - 1 0 1 - 1 1 0 - 1 1 1 - 0 NAND is just opposite of AND as the name itself suggest NAND is the not of AND Truth table of "NOR" is 0 0 - 1 0 1 - 0 1 0 - 0 1 1 - 0 NOR is just opposite of OR as the name itself suggest NOR is the not of OR.
Could you write the program that display truth table of AND gate by using C plus plus programming language?
#include<iostream> int main() { std::cout << "Truth table for AND gate\n\n"; std::cout << " |0 1\n"; std::cout << "-+---\n"; for (unsigned a=0; a<2; ++a) { std::cout << a << '|'; for (unsigned b=0; b<2; ++b) { std::cout << (a & b) << ' '; } std::cout << '\n'; } std::cout << std::endl; }
What is the Truth table of logical operators in c plus plus?
It is the very same in every programming language. For example: AND: 0 && 0 = 0 0 && 1 = 0 1 && 0 = 0 1 && 1 = 1
Why is the and gate called the and gate?
Because if input A *and* input B is true, then the output is true! Truth table of AND gate: ┌─┬─╥───────┐ │A│B║Q (Output)│ ├─┼─╫───────┤ │0│0║0..............│ ├─┼─╫───────┤ │0│1║0............. │ ├─┼─╫───────┤ │1│0║0............. │ ├─┼─╫───────┤ │1│1║1............. │ └─┴─╨───────┘
What is a slope of 0?
A horizontal line has a slope of 0. If you're using the slope formula, then when the numerator is equal to 0 then the slope is 0.
How do you Demorganize a Boolean expression?
The simplest way to describe this action is to demonstrate using a simple truth table. This is not intended to be an in depth study of the theorms but a simple demonstration of how a trivial equation can be demorganized. Given a simple boolean equation !A+!B=1. One could show in a truth table. !A !B !A+!B (fully inhibited OR function) 0 0 1 0 1 1 1 0 1 1 1 0 Demorganizing (hypersimplified method) 1) NOT all variables 2) NOT the equation 3) Invert the function (AND to OR or OR to AND) Iterative steps yeilds !A becomes !!A which is the same as A (!!A + !B) = (A+!B) !B becomes !!B which is the same as B (A +!!B) = A+B OR function becomes AND (A+B) = (AB) NOT the full equation !(AB) = !A+!B Truth table for the new equation (which happens to be a NAND function) A B AB !AB !A+!B 0 0 0 1 1 0 1 0 1 1 1 0 0 1 1 1 1 1 0 0
