## Question 14

It reaches some two times the types of letter which can be expressed at 58 bits, please select the type of letter which can be expressed at 64 bits from midst of the following.

a.16
b.32
c.64
d.128

## Question 13

In order to express the capital letter A~Z of the English letter please select minimum necessary bit number from midst of the following.

a.4
b.5
c.6
d.7

## Question 12

2 n-tuple to do binary A, if A is shifted on the n bit left, it is sought. For example, as for “A×10” it is possible to seek with the below-mentioned arithmetic expression.

(The value which shifts A on the n bit left) + (the value which shifts A on 1 bit left)

Please select the value which is applicable to the n bit in this arithmetic expression from midst of the following.

a.3
b.4
c.5
d.6

## Question 11

There is a register which houses numerical value with binary. It housed correct integer Y in this register, after that, vis-a-vis this value “shifting on 3 bit left, it did the operation of adding Y”. As for the overflow with shift when does not occur, does value of the register reach some two times the Y? Please select from midst of the following.

a.7
b.8
c.9
d.10

## Question 10

64 to double the correct integer which is displayed with binary, whether no bit shift it should have done on the left please select from midst of the following. However, the overflow with shift (overflow) does not occur.

a.4
b.5
c.6
d.32
e.64

## Logical shift and operation

It calls that all bit of binary is shifted on left and right logical shift. When it shifts logically, value changes as description below.

On the left n bit shift:　It becomes 2 n-tuple
On the right n bit shift:　2- the n-tuple (the value which is divided with 2n) it becomes

Therefore, the bit just is shifted can do multiplication and division.

Example: Binary “0101” on the left 2 bit shifts
(The result which is shifted 2 n-tuple (4 times) verification the thing which becomes)

Binary
 0 1 0 1

When it converts to decimal, “0101” -> “5”

Binary on the left 2 bit shifts
 0 1 0 1 0 0

2 bits it shifts to the left, it inserts “0” into the bit which is less crowded
The result and 2 n-tuple (4 times) “20” you can verify that is

Then, it will try solving the problem of logical shift and operation.

## Question 9

With the computer which displays negative number with complement of 2, please select the value which corrected “10011001” of binary in decimal from midst of the following. Furthermore, when the 0th bit 1 is, when “negative number”, 0 is, displays “correct number”.

a. – 101
b. – 102
c. – 103
d.+103
e.+105