2.1 Information Storage

Question 1

In binary representations(2 complement) , the most significant bit indicates what

Answer 1

The sign of the number
0 for positive
1 for negative

Question 2

size of char

Answer 2

8 bit in IA32, 8 bits in x86-64

Question 3

size of short

Answer 3

16 bit in IA32, 16 bits in x86-64

Question 4

size of int

Answer 4

32 bit in IA32, 32 bits in x86-64

Question 5

size of long

Answer 5

32 bit in IA32, 64 bits in x86-64

Question 6

size of float

Answer 6

32 bit in IA32, 32 bits in x86-64

Question 7

size of double

Answer 7

64 bit in IA32, 64 bits in x86-64

Question 8

size of char*

Answer 8

32bit in IA32, 64 bits in x86-64

Question 9

char *p

Answer 9

p is a pointer to an object of type char

Question 10

Big Endian

Answer 10

Least Significant byte has HIGHEST address (least significant byte is stored first)
01 23 45 67

Question 11

Little Endian

Answer 11

Least significant byte has LOWEST address (least significant byte is stored last)
67 45 23 01

Question 12

When is byte ordering important

Answer 12

When a code is transferred from one machine to another and when inspecting machine level programs

Question 13

%d

Answer 13

to print a number as signed decimal

Question 14

%u

Answer 14

to print a number as unsigned decimal

Question 15

%x

Answer 15

to print a number in hexadecimal format

Question 16

%p

Answer 16

print pointer

Question 17

typedef

Answer 17

provides a way of giving a name to a data type in C

Question 18

Intel byte ordering system

Answer 18

Little Indian

Question 19

Who uses Big endian

Answer 19

IBM and Oracle

Question 20

What is a pointer

Answer 20

a variable that stores the memory address of another variable as its value

Question 21

What is a mask

Answer 21

A bit pattern that indicates a selected set of bits within a word

Question 22

Logical operations

Answer 22

Logical operations treat any nonzero argument as true and argument 0 as false.

Question 23

Difference between logical operators and bitwise operators

Answer 23

• The logical operators do not evaluate their second argument if the result of the expression can be determined by evaluating the first term
• The arguments in bitwise operations are restricted to 0s and 1s

Question 24

Another way to express x==y

Answer 24

(returns 1 when they are equal and 0 otherwise)
!(x^y)

Question 25

Logical shift

Answer 25

(right shift) Fills the left end with zeros

Question 26

Arithmetic shift

Answer 26

(right shift) Fills the left end with k repetitions of the most significant bit

Question 27

What kind of right shift do most compilers and machines use

Answer 27

Arithmetic shift for signed data

Question 28

Type of right shift for unsigned data

Answer 28

logical shift

Question 29

Operator order of precedence

Answer 29

Question 30

What does leal do

Answer 30

Computes addresses without memory reference
Computes arithmetic expressions of the form x + k * i