COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
having a countable amount
|
|
|
being picky
|
|
|
completing a program
|
|
|
terminating your code
|
|
|
finishing an algorithm
|
Detailed explanation-1: -A finite set in mathematics is a set that has a finite number of elements. In simple words, it is a set that you can finish counting. For example, 1, 3, 5, 7 is a finite set with four elements. The element in the finite set is a natural number, i.e. non-negative integer.
Detailed explanation-2: -All finite sets are countable, but not all countable sets are finite. (Some authors, however, use “countable” to mean “countably infinite", so do not consider finite sets to be countable.)
Detailed explanation-3: -An infinite set is endless from the start or end, but both sides could have continuity, unlike in a Finite set where both start and end elements are there. If a set has an unlimited number of elements, it is infinite, and if the elements are countable, it is finite.
Detailed explanation-4: -Something that is finite has a definite fixed size or extent.
Detailed explanation-5: -No, finite literally means a finite set, which of course is countable. However, if the set is infinite, it may be countable if it can be associated with Natural numbers, one for one.