Questions

   1) SO2                  2) CH2Cl2                3) PCl3

How to check the given molecules are polar or non polar :

If the electronegativity of the two bonded atoms are different then the bond is polar. Although, some molecules contain polar bonds, the molecule may be non-polar. If the polarity of all the bonds present in the molecule are cancel each other then molecule is non-polar.

In the given options,

SO2  is polar because the dipole moments on the O do not cancel.

PCl3  is polar because the P-Cl bonds do not cancel out.

CH2Cl2  polar because the C-Cl bonds do not cancel.

Hence, in brief, Polar molecules are molecules with net dipole due to the presence of partial positive and partial negative charge.

For example, water is a polar molecule that has partial positive and partial negative charge on it. CO2 is a non polar compound.

Therefore, all the given options SO2, CH2Cl2 and PCl3 are Polar molecules.

Residents of Vadodara, the 10th cleanest city in the country has created a new Guinness world record with maximum number of people sweeping the ‘floor’ (single venue). Vadodara municipal corporation commissioner Vinod Rao said around 5,058 people came together to sweep the venue – a bridge connecting Akota with Dandia bazaar – spread over one kilometre. The record was achieved by participants who swept the place in groups of 50.

This can be done in two ways

1. A to G : 2, 3, 7, 6, 5, 1, 4 

2. A to G : 4, 3, 7, 5, 6, 2, 1

1. Load Sharing: Processes are not assigned to a particular processor. A global queue of threads is maintained. Each processor, when idle, selects a thread from this queue. Note that load balancing refers to a scheme where work is allocated to processors on a more permanent basis.


2. Gang Scheduling: A set of related threads is scheduled to run on a set of processors at the same time, on a 1-to-1 basis. Closely related threads / processes may be scheduled this way to reduce synchronization blocking, and minimize process switching. Group scheduling predated this strategy.


3. Dedicated processor assignment: Provides implicit scheduling defined by assignment of threads to processors. For the duration of program execution, each program is allocated a set of processors equal in number to the number of threads in the program. Processors are chosen from the available pool.


4. Dynamic scheduling: The number of thread in a program can be altered during the course of execution.