The algorithm is as follows:
1. Start
2. bottles = 0
3. While bottles != 500
3.1 Create bottle
3.2 bottle = bottle + 1
4. Switch off machine
5. Stop
Explanation:
This begins the algorithm
1. Start
This initializes bottles to 0
2. bottles = 0
The loop is repeated until 500 bottles is created
3. While bottles != 500
This creates a new bottle
3.1 Create bottle
This increments the number of bottles by 1
3.2 bottle = bottle + 1
This switches of the machine after all bottles are created
4. Switch off machine
End algorithm
5. Stop
THANKS
Answer. D: a value that looks loads when the program runs.
Explanation:
In programming, a variable is a value that can change, depending on conditions or on information passed to the program. Typically, a program consists of instruction s that tell the computer what to do and data that the program uses when it is running.
Answer:
2^11
Explanation:
Physical Memory Size = 32 KB = 32 x 2^10 B
Virtual Address space = 216 B
Page size is always equal to frame size.
Page size = 16 B. Therefore, Frame size = 16 B
If there is a restriction, the number of bits is calculated like this:
number of page entries = 2^[log2(physical memory size) - log2(n bit machine)]
where
physical memory size = 32KB which is the restriction
n bit machine = frame size = 16
Hence, we have page entries = 2^[log2(32*2^10) - log2(16)] = 2ˆ[15 - 4 ] = 2ˆ11
Answer:
Always same value
Explanation:
These both code segments will always generate identical values given that we provide same value of k to both segments.
You can see attached pictures.
