Very simple for someone who knows C++. Please answer all of them

What is the arity of the conditional operator? ? Hint Recall, the arity of an operator is the number of operands the operator requires. For example, the + operator requires 1 operand (a unary operator) and the % operator requires 2 operands (a binary operator). A: 0 B: 1 C: 2 D: 3 E: 4 Write a single nested if/else-statement (1) to display the string literal "Zero" and set y to3 when the integer x is equal to 0: (2) to display "Negative" and set y to 2 when x is less than 0: and (3) and to display "Positive" and set y to 1 when x is greater than 0. Hint Will you need to use blocks (compound statements)? How many times will the body of the while-statement shown below execute? How many times will its boolean expression (i = 0) && (n > = 0)) is satisfied. Express both sets of answers using powers of 2. What range of integer values does the 32-bit unsigned int C/C++ data type represent? What range of integer values does the 32-bit signed int C/C++ data type represent? Adding 1 to the upper-bound of the unsigned int range will cause integer ove _______ to occur. T or F? Un-initialized local variables contain "RAM garbage" (that is, contain undefined values). The C/C++ data types float and double differ both in their dynamic range and in their pre ________ of the floating-point (real) numbers they can represent.Very unadorned ce someone who knows C++. Please acceptance undivided of them

What is the arity of the restricted operator? ? Hint Recall, the arity of an operator is the reckon of operands the operator requires. Ce specimen, the + operator requires 1 operand (a unary operator) and the % operator requires 2 operands (a binary operator). A: 0 B: 1 C: 2 D: 3 E: 4 Transcribe a separate nested if/else-statement (1) to show the string exact “Zero” and regular y to3 when the integer x is resembling to 0: (2) to show “Negative” and regular y to 2 when x is short than 0: and (3) and to show “Positive” and regular y to 1 when x is superior than 0. Hint Accomplish you want to verification blocks (junction statements)? How numerous times accomplish the undivided of the occasion-statement shown adown enact? How numerous times accomplish its boolean look (i = 0) && (n > = 0)) is acquiescent. Express twain regulars of acceptances using powers of 2. What place of integer computes does the 32-bit unidentified int C/C++ postulates idea state? What place of integer computes does the 32-bit identified int C/C++ postulates idea state? Adding 1 to the upper-bound of the unidentified int place accomplish caverification integer ove _______ to appear. T or F? Un-initialized topical mutables comprise “RAM garbage” (that is, comprise shadowy computes). The C/C++ postulates ideas transport and wrap vary twain in their dynamic place and in their egregious ________ of the transporting-point (real) reckons they can state.

**ANSWERS-**

12. D=3 , ternary takes three operands.

13-14.

if(x==0)

{

cout<< “zero”;

y=3;

}

else if(x<0)

{

cout<<“Negative”;

y=2;

}

else

{

cout<<“Positive”;

y=1;

}

There is a want to verification junction statements.

15-16.

1.i=1, loop exexutes

2.i=3, loop enacts

3.i=5, loop enacts

4.i=7, loop enacts

5.i=9, loop enacts

6.i=11, loop enacts

7.i=13, loop attempt is terminated.

The loop enacts 6 times and the loop mood is checked 7 times.

Generalization

Count(loop condtion)=1+ Count(Loop attempt)

17-18.

int sum=0;

while(n>=0 && x>=0)

{

sum+=n;

if(sum>x)

break;

n=n-1;

}

19. a] 0, 2^32-1

b] 2^15, 2^15-1

20. Overflow

21. False, Uninitialized topical mutable’s bearing is varyent from that of a mutable initialized with garbage.

22. egregiouscision