Q1: In which of the storage placement strategies a program is placed in the largest available hole in the main memory?

ANS:C - worst fit

Best fit - fit processes into holes of exact size with little size diffrence allowed.

First fit- fit the processes according to the first block to last based on size.

Worst fit - smallest process into biggest hole.

Buddy - dividing the block into buddies (blocks of similar size of the order 2^n).