I just want to check whether the entropy supplied is good enough for key generation or not .
You cannot really determine this from the random data itself. The problem is that the bits may be well distributed but not very random. Without knowing how the random bits are generated it is impossible to determine if the random data contains enough entropy, or indeed if that entropy was generated well.
You can of course start by examining the random generator itself, and how it is seeded. Then you could generate a lot of data and run it through some kind of testing framework, e.g. the FIPS or German BSI defined testing suites. This could give an indication that the RNG itself is at least not behaving badly.
Within your application there is not much you can do. The only tests that could make some sense is to make sure that at least the zero and ones are distributed OK and that the RNG doesn't repeat over two calls (i.e. retrieve data, disconnect, repeat).
And obviously you should make sure that you're using the right algorithm and system to start with (e.g. Java has a strong RNG that may be explicitly selected. Obviously going for the (default) non-secure or badly seeded RNG such as the Mersenne Twister should be out of the question.