Which of the following correctly shows the hierarchy of arithmetic operations in C?

/ + * -
* - / +
+ - / *
/ * + -

Correct Answer: / * + -

Explanation:

Simply called as BODMAS (Bracket of Division, Multiplication, Addition and Subtraction).

How Do I Remember ? BODMAS !

B - Brackets first

O - Orders (ie Powers and Square Roots, etc.)

DM - Division and Multiplication (left-to-right)

AS - Addition and Subtraction (left-to-right)

More Questions from Expressions

In which order do the following gets evaluated 1. Relational 2. Arithmetic 3. Logical 4. Assignment
Which of the following is the correct usage of conditional operators used in C?
What will be the output of the program? #include int main() { int i=4, j=-1, k=0, w, x, y, z; w = i || j || k; x = i && j && k; y = i || j &&k; z = i && j || k; printf("%d, %d, %d, %d\n", w, x, y, z); return 0; }
What will be the output of the program? #include int main() { char ch; ch = 'A'; printf("The letter is"); printf("%c", ch >= 'A' && ch <= 'Z'? ch + 'a' - 'A':ch); printf("Now the letter is"); printf("%c\n", ch >= 'A' && ch <= 'Z'? ch : ch + 'a' - 'A'); return 0; }
What will be the output of the program? #include int main() { int x=12, y=7, z; z = x!=4 || y == 2; printf("z=%d\n", z); return 0; }
What will be the output of the program? #include int main() { int i=-3, j=2, k=0, m; m = ++i && ++j || ++k; printf("%d, %d, %d, %d\n", i, j, k, m); return 0; }
What will be the output of the program? #include int main() { int i=2; int j = i + (1, 2, 3, 4, 5); printf("%d\n", j); return 0; }
What will be the output of the program? #include int main() { int k, num=30; k = (num>5? (num <=10? 100 : 200): 500); printf("%d\n", num); return 0; }
What will be the output of the program? #include int main() { int i=-3, j=2, k=0, m; m = ++i || ++j && ++k; printf("%d, %d, %d, %d\n", i, j, k, m); return 0; }
What will be the output of the program? #include int main() { static int a[20]; int i = 0; a[i] = i ; printf("%d, %d, %d\n", a[0], a[1], i); return 0; }

Discussion & Comments

No comments yet. Be the first to comment!