Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged countable-uncountable-set
0
votes
1
answer
31
Which of the following is/are not true?
(a) The set of negative integers is countable. (b) The set of integers that are multiples of 7 is countable. (c) The set of even integers is countable. (d) The set of real numbers between 0 and 1/2 is countable.
(a) The set of negative integers is countable.(b) The set of integers that are multiples of 7 is countable.(c) The set of even integers is countable.(d) The set of real n...
im.raj
1.6k
views
im.raj
asked
May 26, 2016
Set Theory & Algebra
countable-uncountable-set
+
–
21
votes
5
answers
32
GATE CSE 1994 | Question: 3.9
Every subset of a countable set is countable. State whether the above statement is true or false with reason.
Every subset of a countable set is countable.State whether the above statement is true or false with reason.
Kathleen
3.0k
views
Kathleen
asked
Oct 5, 2014
Set Theory & Algebra
gate1994
set-theory&algebra
normal
set-theory
countable-uncountable-set
true-false
+
–
38
votes
5
answers
33
GATE CSE 1997 | Question: 3.4
Given $\Sigma=\{a,b\}$, which one of the following sets is not countable? Set of all strings over $\Sigma$ Set of all languages over $\Sigma$ Set of all regular languages over $\Sigma$ Set of all languages over $\Sigma$ accepted by Turing machines
Given $\Sigma=\{a,b\}$, which one of the following sets is not countable?Set of all strings over $\Sigma$Set of all languages over $\Sigma$Set of all regular languages ov...
Kathleen
12.2k
views
Kathleen
asked
Sep 29, 2014
Theory of Computation
gate1997
theory-of-computation
normal
countable-uncountable-set
+
–
33
votes
5
answers
34
GATE CSE 2014 Set 3 | Question: 16
Let $\Sigma$ be a finite non-empty alphabet and let $2^{\Sigma^*}$ be the power set of $\Sigma^*$. Which one of the following is TRUE? Both $2^{\Sigma^*}$ and $\Sigma^*$ are countable $2^{\Sigma^*}$ is countable and $\Sigma^*$ is uncountable $2^{\Sigma^*}$ is uncountable and $\Sigma^*$ is countable Both $2^{\Sigma^*}$ and $\Sigma^*$ are uncountable
Let $\Sigma$ be a finite non-empty alphabet and let $2^{\Sigma^*}$ be the power set of $\Sigma^*$. Which one of the following is TRUE? Both $2^{\Sigma^*}$ and $\Sigma^*$ ...
go_editor
9.5k
views
go_editor
asked
Sep 28, 2014
Theory of Computation
gatecse-2014-set3
theory-of-computation
normal
countable-uncountable-set
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register