Since I don't want to spend to much time in trying to rewrite what you can for yourself better on Wikipedia (http://en.wikipedia.org/wiki/Boolean_algebra & http://en.wikipedia.org/wiki/Truth_table) I'll try to give you a non mathematical example:
Consider the sentence:
The grass is green (,) and the sun is shing (,) or it's raining heavily (,) and the people are laughing at this stupid sentence.
As you can see if we omit all the commas the sentence loses it's meaning, one gets really disoriented while reading it because it's truly difficult to understand what we are trying to say.
Now by putting in some of those we can get the two senteces:
The grass is green and the sun is shing, or it's raining heavily and the people are laughing at this stupid sentence.
&
The grass is green , and the sun is shing or it's raining heavily, and the people are laughing at this stupid sentence.
You can clearly see that there is a big difference between these two, in the first one we get a structure:
$$(p \wedge q) \vee (r \wedge s)$$
whereas in the second it is of the form:
$$p \wedge (q \vee r) \wedge s$$
So you can see that like the commas do for a sentence, the brackets determine the "order of reading" of a mathematical (boolean) expression.
To conclude brackets are needed to evaluate any expression of more than two literals composed of different operations ("and", "or") whereas expressions of the form $$(p \wedge w \wedge s)$$ or $$(p \vee w \vee s)$$ can be valuated at once. [in general non-associative]
PS: some programming language as for example C++ have Operator Precedence (http://en.cppreference.com/w/cpp/language/operator_precedence) rules, but these are not valid in mathematics