Set $$A$$ has $$n$$ elements. Number of subsets of $$A$$ = $$2^n$$.
Number of ways of choosing a subset from $$A$$ = $${^{2^n}}C_{1}$$ ways = $$2^n$$ ways.
So, number of ways of selecting two subsets from $$A$$ = $$2^n$$ $$ \times$$ $$2^n$$ = $$ 4^n$$ ways. -----------------(1)
$$P$$ is a subset of $$A$$.
Let set $$P$$ has $$r$$ elements.
These $$r$$ elements are chosen from $$n$$ elements of set $$A$$ ($$r$$ varies from $$0$$ to $$n$$).
This can be done in $$\bf {^n}C_{r}$$ ways.
Now given that $$P$$ and $$Q$$ has no common elements, $$P \cap Q = \emptyset$$.
Hence the elements of $$Q$$ has to be chosen from $$n-r$$ elements.
This can be done in $$^{n-r}C_{0} + ^{n-r}C_{1} + ................. + ^{n-r}C_{n-r}$$ ways = $$ 2^{n-r}$$ ways.
Hence $$P$$ and $$Q$$ can be chosen in $$ ^{n}C_{r}\times 2^{n-r}$$ ways.
Now $$r$$ can vary from $$0$$ to $$n$$.
Hence total number of ways in which $$P$$ and $$Q$$ can be chosen such that they dont have any common elements
$$= \displaystyle \sum_{r=0}^{n} $$ $$^{n}C_{r} \times $$$$2^{n-r}$$
$$= \displaystyle \sum_{r=0}^{n} $$$$^{n}C_{r} \times $$$$1^{r}\times 2^{n-r}$$
$$=(1+2)^{n}= 3^n$$ -------------------------(2) (Using binomial expansion)
Therefore, probability that $$P$$ and $$Q$$ have no common elements
$$=\dfrac{3^n}{4^n} = {\big (\dfrac{3}{4}\big )}^n$$ (From (1) and (2))