The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged countableuncountableset
+7
votes
2
answers
1
GATE201934
Consider the following sets: S1: Set of all recursively enumerable languages over the alphabet $\{0, 1\}$ S2: Set of all syntactically valid C programs S3: Set of all languages over the alphabet $\{0,1\}$ S4: Set of all nonregular languages over the alphabet $\{ 0,1 \}$ Which of the above sets are uncountable? S1 and S2 S3 and S4 S2 and S3 S1 and S4
asked
Feb 7
in
Theory of Computation
by
Arjun
Veteran
(
418k
points)

2.2k
views
gate2019
theoryofcomputation
countableuncountableset
+1
vote
3
answers
2
doubt
How to check any set is countable or not
asked
Sep 30, 2018
in
Theory of Computation
by
bhavnakumrawat5
(
165
points)

46
views
countableuncountableset
0
votes
1
answer
3
countability
whether the given sets countable or uncountable? 1. the set of all finite partitions of N 2. the set of all nonincreasing functions from N to N. 3. the set of all nondecreasing functions from N to N. here, N is natural numbers. please give answer with proper explanation, as i already have one word answer for all of the problems above.
asked
Sep 20, 2018
in
Theory of Computation
by
aambazinga
Active
(
3.2k
points)

80
views
theoryofcomputation
countableuncountableset
+2
votes
1
answer
4
Countable and Uncountable Self Doubt 2
Which of the following is always correct? A. Cross product of two countable set is countable B. Cross product of two countable set is uncountable C. Cross product of two uncountable set is countable D. Cross product of uncountable ... E. Cross product of uncountable and countable set is countable F. Cross product of uncountable and countable set is uncountable
asked
Sep 11, 2018
in
Set Theory & Algebra
by
smsubham
Loyal
(
9.2k
points)

91
views
theoryofcomputation
countableuncountableset
settheory&algebra
+1
vote
0
answers
5
Countable and uncountable Self Doubt 1
which of the following is always correct? A. Union of two uncountable set is uncountable B. The intersection of two uncountable set is uncountable C. Union of two uncountable set is countable D. The intersection of two uncountable set is ... is countable I. The complement of a countable set is countable. J. The complement of a countable set is uncountable.
asked
Sep 11, 2018
in
Set Theory & Algebra
by
smsubham
Loyal
(
9.2k
points)

49
views
countableuncountableset
theoryofcomputation
settheory&algebra
+1
vote
0
answers
6
Countability and Well Ordering
Is there any relation between countability and well ordering? I mean if a set is well ordered, does it have any influence on it being countable and vice versa?
asked
Aug 19, 2018
in
Set Theory & Algebra
by
Lakshay Kakkar
Active
(
2k
points)

27
views
countableuncountableset
0
votes
0
answers
7
Countable uncountable functions
How the set of all nondecreasing functions from N to N are countable? How the set of all finite partitions of N are uncountable?
asked
Jul 15, 2018
in
Theory of Computation
by
aambazinga
Active
(
3.2k
points)

165
views
theoryofcomputation
countableuncountableset
+20
votes
4
answers
8
GATE201827
Let $N$ be the set of natural numbers. Consider the following sets, $P:$ Set of Rational numbers (positive and negative) $Q:$ Set of functions from $\{0,1\}$ to $N$ $R:$ Set of functions from $N$ to $\{0, 1\}$ $S:$ Set of finite subsets of $N$ Which of the above sets are countable? $Q$ and $S$ only $P$ and $S$ only $P$ and $R$ only $P, Q$ and $S$ only
asked
Feb 14, 2018
in
Set Theory & Algebra
by
gatecse
Boss
(
16.1k
points)

4.4k
views
gate2018
settheory&algebra
countableuncountableset
normal
+1
vote
0
answers
9
MadeEasy Test Series 2018: Theory Of Computation  Countable Set
asked
Jan 4, 2018
in
Theory of Computation
by
Rishi yadav
Boss
(
11k
points)

65
views
madeeasytestseries
theoryofcomputation
countableuncountableset
0
votes
1
answer
10
theory of computation
Consider the following statements. S1 : union of any finite number of countable sets is countable. S2 : union of infinite number of countable sets is countable S3 : cross product of any finite number of countable sets is countable. S4 : cross product of infinite number of countable sets is ... A) Only S1 B) Only S1) and S3) C) Only S1),S2),S3) D) All of S1),S2),S3),S4)
asked
Apr 23, 2017
in
Theory of Computation
by
vignesh
(
209
points)

111
views
theoryofcomputation
countableuncountableset
0
votes
0
answers
11
Countable and recursive language relation
Is every countable language recursive enumerable?
asked
Jan 27, 2017
in
Theory of Computation
by
Purple
Active
(
2.9k
points)

70
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
countableuncountableset
0
votes
1
answer
12
Contable and UnCountable sets!
asked
Jan 12, 2017
in
Theory of Computation
by
smartmeet
Active
(
4.8k
points)

401
views
settheory&algebra
theoryofcomputation
countableuncountableset
regularlanguages
0
votes
1
answer
13
Gate Practice questions
Q. If the set of all words over alphabet S is countable then a. Any laguage over S must be finite. b.at least one language over must be uncountable. c.any language ove S is countable. d.each language over S is finite
asked
Nov 8, 2016
in
Theory of Computation
by
Ravi_1511
Active
(
1.9k
points)

168
views
countableuncountableset
theoryofcomputation
+1
vote
1
answer
14
Set Concept
Why it is that if we can list the element of set in a sequence then it is countable? I mean how it can be a necessary and sufficient condition for a set to be Countable.Because we can provide sequence no to any set.Cann't we?And how can an infinity set be countable, as it is already infinity?
asked
Jul 27, 2016
in
Set Theory & Algebra
by
Sarvottam Patel
Junior
(
965
points)

150
views
settheory
countableuncountableset
0
votes
1
answer
15
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.
asked
May 26, 2016
in
Set Theory & Algebra
by
im.raj
Junior
(
557
points)

577
views
countableuncountableset
+11
votes
5
answers
16
GATE19943.9
Every subset of a countable set is countable. State whether the above statement is true or false with reason.
asked
Oct 6, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
52.1k
points)

572
views
gate1994
settheory&algebra
normal
sets
descriptive
countableuncountableset
+19
votes
3
answers
17
GATE19973.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
asked
Sep 29, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.1k
points)

2.7k
views
gate1997
theoryofcomputation
normal
countableuncountableset
+20
votes
5
answers
18
GATE2014316
Let $\Sigma$ be a finite nonempty 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
asked
Sep 28, 2014
in
Set Theory & Algebra
by
jothee
Veteran
(
100k
points)

2.4k
views
gate20143
settheory&algebra
sets
normal
countableuncountableset
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Previous Years Question Papers : ISI  MMA, PCB, DCG
Previous Years Question Papers : CMI  Computer Science
Minimum Number of States in a DFA accepting a binary number divisible by 'n'
GATE 2020 Application Form Opened!
My GATE Preparation Journey
Follow @csegate
Recent questions tagged countableuncountableset
Recent Blog Comments
Feedback for next edition (if ever there's...
Is go book still available,I want to buy it
will pdfs be uploaded ?
50,092
questions
55,269
answers
190,799
comments
86,083
users