Questions

Placement algorithms determine where in available real-memory to load a program. Common methods are first-fit, next-fit, best-fit. Replacement algorithms are used when memory is full, and one process (or part of a process) needs to be swapped out to accommodate a new program. The replacement algorithm determines which are the partitions to be swapped out.

A closed room is aplace where charcoal is burnt in limited supply of air. There is every chance for the formation of the deadly poisonous carbon monoxide, which when inhaled, reacts with the iron in haemoglobin of blood and prevents the supply of oxygen. It is said to be treacherous as there can be no previous warning of its presence because it is an odourless and colourless gas.

Here Soda is a Heterogenous Mixture.

A Heterogeneous Mixture is a mixture having a non-uniform composition i.e, the mixture contains components in different phases. Using various means, the parts in the mixture can be separated from one another.

A group of emus is called as a mob. Emus is a kind of bird which is next to ostrich in its size.

Output: 12

Explanation:
Binary value of a=1 is 00001 (in 5 bit)
Binary value of b=3 is 00011 (in 5 bit)
Binary value of c=3 is 000011 (in 6 bit)

In memory it is represented as:
Let address of bit1 is 500 which initialize to char pointer p. Since can is one byte data type so p++ will be 501. *p means content of memory location 501 which is (00001100) and its binary equivalent is 12. Hence output is 12.