If $\displaystyle p=\sum^{r}_{k=0}\binom{n}{2k}\binom{n-2k}{r-k}$ and $\displaystyle q=\sum^{n}_{k=r}\binom{n}{k}\binom{2k}{2r}\bigg(\frac{3}{4}\bigg)^{n-k}\bigg(\frac{1}{2}\bigg)^{2k-2r}$ , where $n\geq 2r$.
Then value of $\displaystyle \frac{p}{q}$
First I am try to simplify $p$ and $q$
$\displaystyle p=\sum^{r}_{k=0}\frac{n!}{2k!\cdot (n-2k)!}\times \frac{(n-2k)!}{(r-k)!\cdot (n-k-r)!}=\sum^{r}_{k=0}\frac{n!}{(2k)!\cdot (r-k)!\cdot (n-r-k)!}$
But I have seems that there is no closed form for $p$
And $\displaystyle q=\sum^{n}_{k=r}\frac{n!}{k!\cdot (n-k)!}\cdot \frac{(2k)!}{(2r)!\cdot (2k-2r)!}\bigg(\frac{3}{4}\bigg)^{n-k}\bigg(\frac{1}{2}\bigg)^{2k-2r}$
I did not understand how can I simplify $p$ and $q$ seems that something tricky in simplifying $p$ and $q$
Please have a look on that problem
It's just the same old Snake Oil method. Multiply through by $x^r$, sum over $r$, exchange the order of summation, find the closed form, extract the coefficient at $x^r$ or compare the generating functions, and then do whatever you want with the resulting $p$ and $q$. In fact, I will rename them $p_r$ and $q_r$ to mark their dependence on $r$.
In other words, $$ \begin{split} \sum_{r=0}^{\infty}{p_rx^r} &=\sum_{r=0}^{\infty}\sum_{k=0}^{r}\binom{n}{2k}\binom{n-2k}{r-k}x^r\\ &=\sum_{0\le k\le r}\binom{n}{2k}\binom{n-2k}{r-k}x^r\\ &=\sum_{k=0}^{\infty}\sum_{r=k}^{\infty}\binom{n}{2k}\binom{n-2k}{r-k}x^r\\ &=\sum_{k=0}^{\infty}\sum_{r=0}^{\infty}\binom{n}{2k}\binom{n-2k}{r}x^{r+k}\\ &=\sum_{k=0}^{\infty}\binom{n}{2k}x^k\left(\sum_{r=0}^{\infty}\binom{n-2k}{r}x^r\right)\\ &=\sum_{k=0}^{\infty}\binom{n}{2k}x^k(1+x)^{n-2k}\\ &=(1+x)^n\sum_{k=0}^{\infty}\binom{n}{2k}\left(\frac{\sqrt{x}}{1+x}\right)^{2k} \end{split} $$ Now $$ \sum_{k=0}^{\infty}\binom{n}{2k}t^{2k}=\frac{1}{2}\left(\sum_{k=0}^{\infty}\binom{n}{k}t^k+\sum_{k=0}^{\infty}\binom{n}{k}(-t)^k\right)=\frac{1}{2}\left((1+t)^n+(1-t)^n\right), $$ so the sum above is $$ \begin{split} \sum_{r=0}^{\infty}{p_rx^r}&=\frac{1}{2}(1+x)^n\left(\left(1+\frac{\sqrt{x}}{1+x}\right)^n+\left(1-\frac{\sqrt{x}}{1+x}\right)^n\right)\\ &=\frac{\left(1+\sqrt{x}+x\right)^n+\left(1-\sqrt{x}+x\right)^n}{2}. \end{split} $$ Similarly, $$ \begin{split} \sum_{r=0}^{\infty}q_rx^r &=\sum_{r=0}^{\infty}\sum_{k=r}^{n}\binom{n}{k}\binom{2k}{2r}\left(\frac{3}{4}\right)^{n-k}\left(\frac{1}{2}\right)^{2k-2r}x^r\\ &=\sum_{r=0}^{\infty}\sum_{k=0}^{n-r}\binom{n}{k}\binom{2n-2k}{2r}\left(\frac{3}{4}\right)^{k}\left(\frac{1}{2}\right)^{2n-2r-2k}x^r\\ &=\sum_{r=0}^{\infty}\sum_{k=0}^{n-r}\binom{n}{k}\binom{2n-2k}{2r}\left(\frac{3}{4}\right)^{k}\left(\frac{1}{4}\right)^{n-r-k}x^r\\ &=\sum_{k=0}^{n}\sum_{r=0}^{n-k}\binom{n}{k}\left(\frac{3}{4}\right)^{k}\left(\frac{1}{4}\right)^{n-k}\binom{2n-2k}{2r}4^rx^r\\ &=\frac{1}{4^n}\sum_{k=0}^{n}\binom{n}{k}3^k\left(\sum_{r=0}^{n-k}\binom{2n-2k}{2r}\left(2\sqrt{x}\right)^{2r}\right)\\ &=\frac{1}{2\cdot4^n}\sum_{k=0}^{n}\binom{n}{k}3^k\left((1+2\sqrt{x})^{2n-2k}+(1-2\sqrt{x})^{2n-2k}\right)\\ &=\frac{1}{2\cdot4^n}\left(\left(3+(1+2\sqrt{x})^2\right)^n+\left(3+(1-2\sqrt{x})^2\right)^n\right)\\ &=\frac{1}{2\cdot4^n}\left(\left(4+4\sqrt{x}+4x\right)^n+\left(4-4\sqrt{x}+4x\right)^n\right)\\ &=\frac{\left(1+\sqrt{x}+x\right)^n+\left(1-\sqrt{x}+x\right)^n}{2}. \end{split} $$
Thus, the generating functions of the sequences $(p_r)$ and $(q_r)$ are equal for any $n$, so $p_r=q_r$ for any $n$ and $r$, and thus their ratio is $1$ whenever they are nonzero.
The triangular array of values of $p(n,r)=q(n,r)$ for $0\le r\le n$ is the OEIS sequence A056241.