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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged countableuncountableset
0
votes
0
answers
1
Michael Sipser Edition 3 Exercise 4 Question 9 (Page No. 211)
Review the way that we define sets to be the same size in Definition $4.12$ (page $203$). Show that “is the same size” is an equivalence relation.
asked
Oct 17, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

28
views
michaelsipser
theoryofcomputation
turingmachine
countableuncountableset
proof
0
votes
0
answers
2
Michael Sipser Edition 3 Exercise 4 Question 8 (Page No. 211)
Let $T = \{(i, j, k)\mid i, j, k \in N \}$. Show that $T$ is countable.
asked
Oct 17, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

21
views
michaelsipser
theoryofcomputation
turingmachine
countableuncountableset
proof
+18
votes
3
answers
3
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, 2019
in
Theory of Computation
by
Arjun

3.7k
views
gate2019
theoryofcomputation
countableuncountableset
+1
vote
2
answers
4
GO2019FLT146
Which of the following statements is/are not correct? (P) The class of all Turing Machines is countably infinite (Q) The class of all DCFL's is countably infinite (R) The class of all formal languages is uncountably infinite (S) The set of all primes is countably infinite Only R Only R and S All are incorrect except P None of the above
asked
Dec 28, 2018
in
Theory of Computation
by
Ruturaj Mohanty

352
views
go2019flt1
countableuncountableset
theoryofcomputation
+1
vote
3
answers
5
doubt
How to check any set is countable or not
asked
Oct 1, 2018
in
Theory of Computation
by
bhavnakumrawat5

66
views
countableuncountableset
0
votes
1
answer
6
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

143
views
theoryofcomputation
countableuncountableset
+2
votes
1
answer
7
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

150
views
theoryofcomputation
countableuncountableset
settheory&algebra
+3
votes
0
answers
8
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

78
views
countableuncountableset
theoryofcomputation
settheory&algebra
+1
vote
0
answers
9
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

111
views
countableuncountableset
0
votes
0
answers
10
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 16, 2018
in
Theory of Computation
by
aambazinga

227
views
theoryofcomputation
countableuncountableset
+30
votes
5
answers
11
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

6.8k
views
gate2018
settheory&algebra
countableuncountableset
normal
+1
vote
0
answers
12
MadeEasy Test Series 2018: Theory Of Computation  Countable Set
asked
Jan 4, 2018
in
Theory of Computation
by
Rishi yadav

98
views
madeeasytestseries
theoryofcomputation
countableuncountableset
0
votes
1
answer
13
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

128
views
theoryofcomputation
countableuncountableset
0
votes
1
answer
14
Countable and recursive language relation
Is every countable language recursive enumerable?
asked
Jan 28, 2017
in
Theory of Computation
by
Purple

93
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
countableuncountableset
0
votes
1
answer
15
Contable and UnCountable sets!
asked
Jan 12, 2017
in
Theory of Computation
by
smartmeet

642
views
settheory&algebra
theoryofcomputation
countableuncountableset
regularlanguages
0
votes
1
answer
16
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

189
views
countableuncountableset
theoryofcomputation
+1
vote
1
answer
17
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

179
views
sets
countableuncountableset
0
votes
1
answer
18
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

666
views
countableuncountableset
+12
votes
5
answers
19
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

866
views
gate1994
settheory&algebra
normal
sets
descriptive
countableuncountableset
+22
votes
3
answers
20
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 30, 2014
in
Theory of Computation
by
Kathleen

3.8k
views
gate1997
theoryofcomputation
normal
countableuncountableset
+24
votes
5
answers
21
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

3.2k
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
IISc CDS Interview Experience, 2020
IITD MS CSE (Systems) Experience
IIT Bombay M.Tech. (RA)  Interview Experience
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
PGEE 2020 (CSE) Experience
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.3k)
Digital Logic
(2.9k)
Programming and DS
(5k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.4k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.5k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(23)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent questions tagged countableuncountableset
Recent Blog Comments
After the written exam and at the time of...
Q1. I don't know any trick or method, I usually...
Yeah, Now it's on.
Can you check now?
Even I filled NIELIT form which had similar...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,375
questions
60,581
answers
201,994
comments
95,398
users