This question has, at the time of writing, three close votes. None of them seems appropriate.
- Off-topic: does not appear to be about computer science... It's a question about decidability of languages, which has been a topic of computer science for longer than digital computers have existed!
- Unclear what you're asking. There is nothing unclear about the two questions: are there any finite languages that are not recursive? and what is the cardinality of the set of finite languages over ${0,1}$?
- Too broad: there are either too many possible answers or good answers would be too long for this format. The two questions can be answered in a short paragraph each; tersely, even in a single sentence each.
Can people please make sure their reasons for closing actually apply to the question they're voting to close?