II. Assume we are running code on a 10-bit machine using two's complement arithmetic for signed integers. Fill in the empty boxes in the table below. The following definitions are used in the table: int y = -9; unsigned z = y; Note: You need not fill in entries marked with Only accepted format for binary representation (use 10-bits): 0000000000, 1111111111 Only accepted format for hexadecimal representation: 2FD, 1EF, 3FF Expression Decimal Binary Hexadecimal Zero 0 -5 Y Z y-z -Tmax -Tmin Tmax +1 0000010010

Problem 1. We usually write numbers in decimal form (or base 10), meaning numbers are composed using 10 different "digits" {0, 1,..., 9). Sometimes though it is useful to write numbers hexadecimal or base 16. Now there are 16 distinct digits that can be used to form numbers: {0, 1, ..., 9, A, B, C, D, E, F) where A, B, C, D, E and F represent digits with values 10, 11, 12, 13, 14 and 15, respectively. So for example, a 3 digit hexadecimal number might be 2B8 = 8 + (B) 16+ (2) 16² = 8+ (11) 16+ (2) 16² = 696. (a) How many 2-digit hexadecimals are there in which the first digit is E or F? Explain your answer in terms of the additive principle (using either events or sets). (b) Explain why your answer to the previous part is correct in terms of the multiplicative principle (using either events or sets). Why do both the additive and multiplicative principles give you the same answer? (c) How many 3-digit hexadecimals start with a letter (A-F) and end with a numeral (0-9)? Explain. (d) How…

Send me answers of all queries fast. Just Don't copy anything. If I find plagiarism then I'll reduce rating for sure and will report.

Refer to Code Segment 1 and Code Segment 2. Assume variables have been declared accordingly with their appropriate data type; and value for n is user supplied. Line numbers are provided for easy referencing. Line Code Segment 1 (1) (2) (3) (4) (5) (6) for i = 1 to n { for j = 1 to n { val = i*j print val Line Code Segment 2 (1) (2) (3) (4) (5) (6) for i = 1 to n *n { r = (i-1) /n c = (i-1) % n val = (r+1) * (c+1) print val Answer the questions below: 1. Both Code Segments 1 and 2 perform the same task AND the execution time of Code Segment 1 scales slower than the execution time of Code Segment 2 as we increase n. Write TRUE if the statement is true, FALSE otherwise. 2. In Code Segment 1, how many times will line 4 be executed in terms of n? 3. In Code Segment 2, how many times will line 5 be executed in terms of n?