Given a language DCFL it is always unambiguous because as we have no non determinism and we can define the moves of PDA deterministically..
In other terms there exists at least a one DCFG for a given DCFL which is unambiguous ..Hence ambiguity problem for a DCFL is a trivial property as we are able to say
Given a DCFL it is always unambiguous ..
Hence the ambiguity problem of DCFL is decidable..
As far as CFL is concerned it may be ambiguous or unambiguous..Actually there is a term "inherent ambiguity" which begins from CFL layer..So given a CFL it may be ambiguous or unambiguous..And we have no such definite algorithm which can decide ambiguity of a given CFL..
Hence the ambiguity problem of CFL is undecidable..