
#1
Feb413, 05:17 PM

P: 783

I have a rather technical question in boolean algebra to which I was not able to find an answer.
What is the order of operations in boolean algebra? Is it first logical NOT, logical AND, logical OR, and finally logical XOR? Correct me if I am wrong. BiP 



#2
Feb413, 05:36 PM

P: 22

The order of Boolean operations from high to low priority is NOT, AND, OR, while expressions inside brackets are always evaluated first.
Lecture 1: Introduction to Boolean Algebra, Handout, page 2. 



#3
Feb413, 05:46 PM

P: 783

What about XOR?
BiP 



#4
Feb413, 06:00 PM

Mentor
P: 14,483

Order of operations in boolean algebra
Since xor is equivalent as not equals, at least in Cbased languages xor (as !=) has precedence over logical and (&&) and logical or (). However, bitwise and (&) has precedence over bitwise xor (^), which in turn has precedence over bitwise or ().
In the end, does it really matter? Just use parentheses and there's no doubt. 


Register to reply 
Related Discussions  
min and max in order of operations  General Math  5  
Order of Operations  Precalculus Mathematics Homework  4  
Simplifying Boolean Expressions using the Laws of Boolean Algebra  Calculus & Beyond Homework  15  
Simplifying Boolean Expressions using the Laws of Boolean Algebra  Engineering, Comp Sci, & Technology Homework  1  
Order of operations  Introductory Physics Homework  3 