answersLogoWhite

0


Best Answer

It is always true because we don't know what the answer is so the expression could be anything

User Avatar

Arnoldo Considine

Lvl 9
โˆ™ 2021-09-21 18:38:57
This answer is:
๐Ÿ™
0
๐Ÿคจ
0
๐Ÿ˜ฎ
0
User Avatar
Study guides
๐Ÿ““
See all Study Guides
โœ๏ธ
Create a Study Guide

Add your answer:

Earn +20 pts
Q: Can an expression be true or false?
Write your answer...
Submit
Related questions

What expression has a value of either true or false?

In C, any non-zero expression is true and any zero expression is false.


What is an expression evaluates as either true or false?

Boolean expression


What is any value or expression that can be evaluated as being true or false?

A logical test is any value or expression that can be evaluated as being true or false.


Is -13 -5 true or false?

-8


Any value or expression that can be evaluated as being true or false?

A Boolean expression.


Which one, True or False, A variable expression cannot consist of numbers or operations.?

False. [APEX]


In evaluating a logical expression of type Boolean expression1 Boolean expression2 Both the Boolean expressions are not always evaluated True False?

FALSE.... cuz in && operator the compiler chk both of the expression if any of the expression is false then answer will be false.. for true result both of d expression must be true... by warrior2pnk


Is it true or false when the order in which you perform operations matters in a numerical expression?

true


Define an expression that evaluates to true when i equals j?

In Java, or C, the expression is simply:i == jIf the two are equal, this expression will evaluate to true; if not, it will evaluate to false.In Java, or C, the expression is simply:i == jIf the two are equal, this expression will evaluate to true; if not, it will evaluate to false.In Java, or C, the expression is simply:i == jIf the two are equal, this expression will evaluate to true; if not, it will evaluate to false.In Java, or C, the expression is simply:i == jIf the two are equal, this expression will evaluate to true; if not, it will evaluate to false.


The statement that this government is best which interferes the least is am expression of individualism true or false?

True.


The expression below is a difference of two cubes 216x3 - 64 true or false?

true.


You use the operator to reverse the meaning of a Boolean expression?

The NOT operator. E.g., NOT TRUE evaluates to FALSE while NOT FALSE evaluates to TRUE.


Is this true 5-3-15-(3-1)?

The question contains an expression - not an equation nor an inequality. An expression cannot be true or false.


Is this true 5-3-5-(3-1)?

The question contains an expression - not an equation nor an inequality. An expression cannot be true or false.


Japanese often send money to bereaved friends as an expression of sympathy True or False?

true


Can you solve a system of equations you can replace a variable with an equal value or expression true or false?

True


In French they also use the apostrophe to expression possession True or False?

False. The French do not use apostrophes to denote possession.


Mendel found that the dominant trait prevents the expression of the recessive trait?

false


Is it true that you will always get the same result in a numerical expression no matter the order in which you perform?

false


What loop should no execute if the test expression is false to begin with?

for loop and while loop need the expression to be true for further execution of the program.


Is this equation True False or Open 3x-4?

False because without an equality sign the given expression can't be considered to be an equation.


What does And mean in Mathematics?

And is used in logical comparison in mathematics. true and true is true. true and false is false. false and true is false. false and false is false.


What is the result of True AND False OR True?

True AND False OR True evaluates to True. IT seems like it does not matter which is evaluated first as: (True AND False) OR True = False OR True = True True AND (False OR True) = True AND True = True But, it does matter as with False AND False OR True: (False AND False) OR True = False OR True = True False AND (False OR True) = False AND True = False and True OR False AND False: (True OR False) AND False = True AND False = False True OR (False AND False) = True OR False = True Evaluated left to right gives a different answer if the operators are reversed (as can be seen above), so AND and OR need an order of evaluation. AND can be replaced by multiply, OR by add, and BODMAS says multiply is evaluated before add; thus AND should be evaluated before OR - the C programming language follows this convention. This makes the original question: True AND False OR True = (True AND False) OR True = False OR True = True


How do i write a C plus plus program to output to determine the truth of a statement in a single statement?

You cannot determine the truth of a statement, you can only determine the truth of an expression. However, a statement is merely an expression followed by a semi-colon, so it amounts to the same thing.Only a Boolean expression can evaluate true or false. Numeric expressions implicitly convert to Boolean; they evaluate true when the result is non-zero. However, any class of object that overloads operator bool() implicitly converts to Boolean. E.g., containers are true when they contain one or more objects while streams are true when their state is good.The following statement will determine the truth about any Boolean expression:std::cout


Where do we use logical operators?

The four logical operators are AND, OR, XOR and NOT. These operators are used to evaluate operands composed of boolean expressions.A boolean expression is any expression that returns a boolean value. A boolean value is a data type of arbitrary length (dependant upon the implementation of the programming language) but is typically 8 bits in length. When all bits are off, the value is false but when all bits are on, the value is true. Thus 0x00 is false while 0xff is true.When evaluating a boolean expression, the operands of that expression need not themselves be boolean. For instance, given the following definition of a string:string s = "Hello world"The boolean expression s=="" returns 0x00 because s is not equal to an empty string but the expression s=="Hello world" returns 0xff because s is equal to "Hello world".NOT is a unary operator which has only one operand. If the operand evaluates false, then the return value is true. If the operand evaluates true, the return value is false. In other words we use the NOT operator to invert all the bits in the boolean value.Thus we can say that NOT (s=="") returns 0xff because s=="" evaluates false (s is not an empty string) and NOT (false) evaluates true.The other operators are binary operators with two operands. The "truth tables" for each of these operators are as follows:true AND true == truetrue AND false == falsefalse AND true == falsefalse AND false == falsetrue OR true == truetrue OR false == truefalse OR true == truefalse OR false == falsetrue XOR true == falsetrue XOR false == truefalse XOR true == truefalse XOR false == falseNote that AND returns true only when both operands evaluate true while OR returns true when one or both operands are true. XOR is the eXclusive-OR operator which only returns true when one (and only one) operand is true.You will note that there are 4 possible outcomes for each of these binary operators and that each of the tables produces a unique combination of true and false results depending on the two inputs (which are in the same order for each table). If we translate these results into binary values we can see that AND produces 1000 (true, false, false, false), OR produces 1110 (true, true, true, false) and XOR produces 0110 (false, true, true, false). With 4-bits there are clearly 16 possible combinations of 1 and 0 bits, but the logical operators only produce 3 of them. However, we can combine these three operators in various ways along with NOT to produce seven more tables:NOT (true AND true) = falseNOT (true AND false) = trueNOT (false AND true) = trueNOT (false AND false) = trueNOT (true OR true) = falseNOT (true OR false) = falseNOT (false OR true) = falseNOT (false OR false) = trueNOT (true XOR true) = trueNOT (true XOR false) = falseNOT (false XOR true) = falseNOT (false XOR false) = true(NOT true) AND true = false(NOT true) AND false = false(NOT false) AND true = true(NOT false) AND false = false(NOT true) OR true = true(NOT true) OR false = false(NOT false) OR true = true(NOT false) OR false = truetrue AND (NOT true) = falsetrue AND (NOT false) = truefalse AND (NOT true) = falsefalse AND (NOT false) = falsetrue OR (NOT true) = truetrue OR (NOT false) = truefalse OR (NOT true) = falsefalse OR (NOT false) = trueThe remaining 6 tables are only of interest to academics and are not particularly useful to programmers. Those 6 are the truth tables that produce false regardless of input, or simply return the first operand, or the second operand, or the logical NOT of any of these three.It should be noted that some languages do not provide a logical operator for XOR. This is because XOR can be simulated using AND, OR and NOT. That is, given two inputs, a and b, a XOR b can be determined from (a AND (NOT b)) OR ((NOT a) AND b).It should also be noted that logical operators are not the same as bitwise logic operators. Bitwise logic operators work similarly to the logic operators in terms of the truth tables, but they compare on a bit-by-bit basis. Thus 0101 AND 0110 outputs 0100 because bit 2 is the only bit that is set in both inputs and is therefore the only bit that evaluates true according to the AND truth table. The NOT operator also works differently in that it flips all the bits in the operand, effectively returning the ones complement of its input (it is often referred to as the inverse operator for that reason).The logical bitwise operators are typically used to read and write the individual bits in a bit field (or bitmap). Such values are typically used to denote which features within a set of features are enabled or disabled. While this can save memory by cramming more booleans into a single word, the downside is that the data is slower to read and write because of the additional operations required to access the individual bits. However, some architectures are optimised to take advantage of this.