8 questions. Covers Precedence trees.
Questions 1 to 5 of 8
cpp #include <iostream> using namespace std; int main() { int n = 4; int r = n-- - 1; cout << n << ' ' << r << endl; return 0; }
cpp int j = 1; int s = j++ + j++;
a = b
cpp #include <iostream> using namespace std; int main() { int x = 7 - 3 - 2; int y = 2 * 3 << 1; cout << x << ' ' << y << endl; return 0; }
2 - 3 - 4
2 - (3 - 4)
5 question(s) left on this page.