Is every decidable language a deterministic context free language?
You are asking several disparate questions:


Is every decidable language a deterministic context-free language? No. There are even context-free languages which are not deterministic context-free. Furthermore, membership in a context-free language (deterministic or not) can be decided in polynomial time, whereas the time hierarchy theorem shows that there are languages decidable in time $O(n^{\log n})$ (say) but not in time $O(n^{\log\log n})$, and in particular not in polynomial time.
Are there any decidable languages that are not recognizable? A language is decidable iff both the language and its complement are recognizable.
Is the question "Does a given PDA accept a given input?" decidable? Yes, though the algorithm isn't obvious. One way is to convert the PDA to an equivalent context-free grammar in Chomsky normal form, and then use the CYK algorithm.
Under what operations are decidable languages not closed? Decidable languages are not closed under taking prefixes. The language of pairs $M,n$ such that $M$ halts within $n$ steps is decidable. But the language of all prefixes ending with $,$ is the halting problem, which is not decidable. (I'm skipping a few steps here.)