Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
No answer
No selected answer
No upvoted answer
Previous GATE
Featured
Recent questions without answers
0
votes
0
answers
5731
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 25 (Page No. 253)
In protocol 6( Selective repeat Protocol ), when a data frame arrives, a check is made to see if the sequence number differs from the one expected and no nak is true. If both conditions hold, a NAK is ... auxiliary timer is started. Suppose that the else clause were omitted. Would this change affect the protocol's correctness?
In protocol 6( Selective repeat Protocol ), when a data frame arrives, a check is made to see if the sequence numberdiffers from the one expected and no nak is true. If b...
ajaysoni1924
596
views
ajaysoni1924
asked
Mar 16, 2019
Computer Networks
computer-networks
data-link-layer
selective-repeat
tanenbaum
+
–
0
votes
0
answers
5732
Peter Linz Edition 5 Exercise 12.2 Question 8 (Page No. 311)
For an unrestricted grammar $G$, show that the question $“Is \space L(G) = L(G)^*?”$ is undecidable. Argue $\text(a)$ from Rice’s theorem and $\text(b)$ from first principles.
For an unrestricted grammar $G$, show that the question $“Is \space L(G) = L(G)^*?”$ is undecidable. Argue $\text(a)$ from Rice’s theorem and $\text(b)$ from first ...
Rishi yadav
202
views
Rishi yadav
asked
Mar 16, 2019
Theory of Computation
peter-linz
peter-linz-edition5
theory-of-computation
decidability
proof
+
–
1
votes
0
answers
5733
Geeks for Geeks : C Program
In the above 4 Statements which would print 123 as output ? Explain also.
In the above 4 Statements which would print 123 as output ? Explain also.
Ashish Roy 1
1.7k
views
Ashish Roy 1
asked
Mar 16, 2019
Programming in C
programming-in-c
output
pointers
programming
+
–
0
votes
0
answers
5734
Peter Linz Edition 5 Exercise 12.2 Question 7 (Page No. 311)
Let $G_1$ be an unrestricted grammar, and $G_2$ any regular grammar. Show that the problem $L(G_1) \space\cap L(G_2) = \phi $ is undecidable for any fixed $G_2,$ as long as $L(G_2)$ is not empty.
Let $G_1$ be an unrestricted grammar, and $G_2$ any regular grammar. Show that the problem $L(G_1) \spa...
Rishi yadav
179
views
Rishi yadav
asked
Mar 16, 2019
Theory of Computation
peter-linz
peter-linz-edition5
theory-of-computation
decidability
proof
+
–
0
votes
0
answers
5735
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 19 (Page No. 253)
In the discussion of ARQ protocol , a scenario was outlined that resulted in the receiver accepting two copies of the same frame due to a loss of acknowledgement frame. Is it possible that a receiver may accept multiple copies of the same frame when none of the frames (message or acknowledgement) are lost?
In the discussion of ARQ protocol , a scenario was outlined that resultedin the receiver accepting two copies of the same frame due to a loss of acknowledgementframe. Is ...
ajaysoni1924
716
views
ajaysoni1924
asked
Mar 16, 2019
Computer Networks
computer-networks
tanenbaum
data-link-layer
+
–
0
votes
0
answers
5736
Peter Linz Edition 5 Exercise 12.2 Question 6 (Page No. 311)
Let $G_1$ be an unrestricted grammar, and $G_2$ any regular grammar. Show that the problem $L(G_1) \space\cap L(G_2) = \phi $ is undecidable.
Let $G_1$ be an unrestricted grammar, and $G_2$ any regular grammar. Show that the problem $L(G_1) \space\ca...
Rishi yadav
206
views
Rishi yadav
asked
Mar 16, 2019
Theory of Computation
peter-linz
peter-linz-edition5
theory-of-computation
decidability
proof
+
–
0
votes
0
answers
5737
Peter Linz Edition 5 Exercise 12.2 Question 5 (Page No. 311)
Let $G$ be an unrestricted grammar. Does there exist an algorithm for determining whether or not $L(G) = L(G)^R$?$
Let $G$ be an unrestricted grammar. Does there exist an algorithm for determining whether or not $L(G) = L(G)^R$$?$
Rishi yadav
778
views
Rishi yadav
asked
Mar 16, 2019
Theory of Computation
peter-linz
peter-linz-edition5
theory-of-computation
decidability
proof
+
–
0
votes
0
answers
5738
Peter Linz Edition 5 Exercise 12.2 Question 4 (Page No. 311)
Let $G$ be an unrestricted grammar. Does there exist an algorithm for determining whether or not $L(G)^R$ is recursive enumerable$?$
Let $G$ be an unrestricted grammar. Does there exist an algorithm for determining whether or not $L(G)^R$ is recursive enumerable$?$
Rishi yadav
300
views
Rishi yadav
asked
Mar 16, 2019
Theory of Computation
peter-linz
peter-linz-edition5
theory-of-computation
decidability
proof
+
–
0
votes
0
answers
5739
Peter Linz Edition 5 Exercise 12.2 Question 3 (Page No. 311)
Let $M_1$ and $M_2$ be arbitrary Turing machines. Show that the problem $“L(M_1)\subseteq L(M_2)”$ is undecidable.
Let $M_1$ and $M_2$ be arbitrary Turing machines. Show that the problem $“L(M_1)\subseteq L(M_2)”$ is undecidable.
Rishi yadav
226
views
Rishi yadav
asked
Mar 16, 2019
Theory of Computation
peter-linz
peter-linz-edition5
theory-of-computation
decidability
proof
+
–
1
votes
0
answers
5740
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 13 (Page No. 252)
A block of bits with n rows and k columns uses horizontal and vertical parity bits for error detection. Suppose that exactly 4 bits are inverted due to transmission errors. Derive an expression for the probability that the error will be undetected.
A block of bits with n rows and k columns uses horizontal and vertical parity bits forerror detection. Suppose that exactly 4 bits are inverted due to transmission errors...
ajaysoni1924
515
views
ajaysoni1924
asked
Mar 16, 2019
Computer Networks
computer-networks
data-link-layer
error-detection
tanenbaum
probability
+
–
0
votes
0
answers
5741
Kenneth Rosen Edition 7 Exercise 1.4 Question 28 (Page No. 54)
Translate each of these statements into logical expression using predicates, quantifiers, and logical connectives. Something is not in the correct place. All tools are in the correct place and are in excellent condition. Everyone is in ... in excellent condition. One of your tools is not in the correct, but it is in excellent condition.
Translate each of these statements into logical expression using predicates, quantifiers, and logical connectives.Something is not in the correct place.All tools are in t...
Pooja Khatri
691
views
Pooja Khatri
asked
Mar 16, 2019
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
propositional-logic
+
–
0
votes
0
answers
5742
Peter Linz Edition 5 Exercise 12.2 Question 2 (Page No. 311)
Show that the two problems mentioned at the end of the preceding section, namely $\text(a)$ $L(M)$ contains any string of length five, $\text(b)$ $L(M)$ is regular, are undecidable.
Show that the two problems mentioned at the end of the preceding section, namely$\text(a)$ $L(M)$ contains any string of length five,$\text(b)$ $L(M)$ is regular,are unde...
Rishi yadav
213
views
Rishi yadav
asked
Mar 16, 2019
Theory of Computation
peter-linz
peter-linz-edition5
theory-of-computation
decidability
proof
+
–
1
votes
0
answers
5743
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 10 (Page No. 252)
A 12-bit Hamming code whose hexadecimal value is 0xE4F arrives at a receiver. What was the original value in hexadecimal? Assume that not more than 1 bit is in error.
A 12-bit Hamming code whose hexadecimal value is 0xE4F arrives at a receiver.What was the original value in hexadecimal? Assume that not more than 1 bit is inerror.
ajaysoni1924
773
views
ajaysoni1924
asked
Mar 16, 2019
Computer Networks
computer-networks
data-link-layer
error-detection
hamming-code
tanne
tanenbaum
+
–
0
votes
0
answers
5744
Peter Linz Edition 5 Exercise 12.2 Question 1 (Page No. 311)
$\text{Theorem}:$ Let $M$ be any Turing machine. Then the question of whether or not $L(M)$ is finite is undecidable. Show in detail how the machine $\widehat{M}$ in $\text{Theorem}$ is constructed.
$\text{Theorem}:$ Let $M$ be any Turing machine. Then the question of whether or not $L(M)$ is finite is undecidable.Show in detail how the machine $\widehat{M}$ in $\tex...
Rishi yadav
175
views
Rishi yadav
asked
Mar 16, 2019
Theory of Computation
peter-linz
peter-linz-edition5
theory-of-computation
decidability
proof
+
–
0
votes
0
answers
5745
Kenneth Rosen Edition 7 Exercise 1.4 Question 27 (Page No. 54)
Translate each of these statements into logical expression in three different ways by varying the domain and by using predicates with one and with two variables. A student in your school has lived in Vietnam. There is a student in ... Prolog, and C++. Everyone in your class enjoys Thai food. Someone in your class does not play hockey.
Translate each of these statements into logical expression in three different ways by varying the domain and by using predicates with one and with two variables.A student...
Pooja Khatri
1.3k
views
Pooja Khatri
asked
Mar 16, 2019
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
propositional-logic
+
–
0
votes
0
answers
5746
Kenneth Rosen Edition 7 Exercise 1.4 Question 26 (Page No. 54)
Translate each of these statements into logical expression in three different ways by varying the domain and by using predicates with one and with two variables. Someone in your school has visited Uzbekistan. Everyone in your class ... person in your school who is not happy. Everyone in your school was born in the twentieth century.
Translate each of these statements into logical expression in three different ways by varying the domain and by using predicates with one and with two variables.Someone i...
Pooja Khatri
668
views
Pooja Khatri
asked
Mar 16, 2019
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
propositional-logic
+
–
1
votes
0
answers
5747
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 8 (Page No. 252)
To provide more reliability than a single parity bit can give, an error-detecting coding scheme uses one parity bit for checking all the odd-numbered bits and a second parity bit for all the even-numbered bits. What is the Hamming distance of this code?
To provide more reliability than a single parity bit can give, an error-detecting codingscheme uses one parity bit for checking all the odd-numbered bits and a second par...
ajaysoni1924
899
views
ajaysoni1924
asked
Mar 16, 2019
Computer Networks
computer-networks
data-link-layer
tanenbaum
error-detection
hamming-code
+
–
0
votes
0
answers
5748
Kenneth Rosen Edition 7 Exercise 1.4 Question 22 (Page No. 54)
For each of these statements find a domain for which the statement is true and a domain for which the statement is false. Everyone speak Hindi. There is someone older than 21 years. Everyone two people have the same first name. Someone knows more than two other people.
For each of these statements find a domain for which the statement is true and a domain for which the statement is false.Everyone speak Hindi.There is someone older than ...
Pooja Khatri
777
views
Pooja Khatri
asked
Mar 16, 2019
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
propositional-logic
+
–
0
votes
0
answers
5749
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 1 (Page No. 251)
An upper-layer packet is split into 10 frames, each of which has an 80% chance of arriving undamaged. If no error control is done by the data link protocol, how many times must the message be sent on average to get the entire thing through?
An upper-layer packet is split into 10 frames, each of which has an 80% chance of arrivingundamaged. If no error control is done by the data link protocol, how manytimes ...
ajaysoni1924
494
views
ajaysoni1924
asked
Mar 16, 2019
Computer Networks
computer-networks
tanenbaum
data-link-layer
+
–
0
votes
0
answers
5750
Kenneth Rosen Edition 7 Exercise 1.4 Question 20 (Page No. 54)
Suppose that the domain of the propositional function $P(x)$ consists of $-5,-3,-1,1,3,5.$ Express these statements without using quantifiers, instead using only negations, disjunctions, and conjunctions. $\exists x p(x)$ $\forall x p(x)$ ... $\exists x (\sim p(x)) \wedge \forall x ((x<0) \rightarrow p(x))$
Suppose that the domain of the propositional function $P(x)$ consists of $-5,-3,-1,1,3,5.$ Express these statements without using quantifiers, instead using only negation...
Pooja Khatri
451
views
Pooja Khatri
asked
Mar 16, 2019
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
propositional-logic
+
–
0
votes
0
answers
5751
Kenneth Rosen Edition 7 Exercise 1.4 Question 19 (Page No. 54)
Suppose that the domain of the propositional function $P(x)$ consists of the integers $1,2,3,4,5.$ Express these statements without using quantifiers, instead using only negations, disjunctions, and conjunctions. $\exists x P(x)$ $\forall x P(x)$ ... $\forall x ((x \neq 3) \rightarrow P(x)) \vee \exists x \sim P(x)$
Suppose that the domain of the propositional function $P(x)$ consists of the integers $1,2,3,4,5.$ Express these statements without using quantifiers, instead using only ...
Pooja Khatri
534
views
Pooja Khatri
asked
Mar 16, 2019
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
propositional-logic
+
–
0
votes
0
answers
5752
Kenneth Rosen Edition 7 Exercise 1.4 Question 18 (Page No. 53)
Suppose that the domain of the propositional function $P(x)$ consists of the integers $-2,-1,0,1,2.$ Write out each of these propositions using disjunctions, conjunctions, and negations. $\exists x P(x)$ $\forall x P(x)$ $\exists x \sim p(x)$ $\forall x \sim P(x)$ $\sim \exists x P(x)$ $\sim \forall x P(x)$
Suppose that the domain of the propositional function $P(x)$ consists of the integers $-2,-1,0,1,2.$ Write out each of these propositions using disjunctions, conjunctions...
Pooja Khatri
630
views
Pooja Khatri
asked
Mar 16, 2019
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
propositional-logic
+
–
0
votes
0
answers
5753
Kenneth Rosen Edition 7 Exercise 1.4 Question 16 (Page No. 53)
Determine the truth value of each of these statements if the domain of each variable consists of all real numbers. $\exists x (x^2 = 2)$ $\exists x (x^2= -1)$ $\exists x (x^2+2 >=1)$ $\forall x (x^2 \neq x)$
Determine the truth value of each of these statements if the domain of each variable consists of all real numbers.$\exists x (x^2 = 2)$$\exists x (x^2= -1)$$\exists x (x^...
Pooja Khatri
556
views
Pooja Khatri
asked
Mar 16, 2019
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
propositional-logic
+
–
0
votes
0
answers
5754
Kenneth Rosen Edition 7 Exercise 1.4 Question 12 (Page No. 53)
Let $Q(x)$ be the statement “$x+1>2x.$” If the domain consists of all integers, what are these truth values? $Q(0)$ $Q(-1)$ $Q(1)$ $\exists xQ(x)$ $\forall x Q(x)$ $\exists x \sim Q(x)$ $\forall x \sim Q(x)$
Let $Q(x)$ be the statement “$x+1>2x.$” If the domain consists of all integers, what are these truth values?$Q(0)$$Q(-1)$$Q(1)$$\exists xQ(x)$$\forall x Q(x)$$\exists...
Pooja Khatri
398
views
Pooja Khatri
asked
Mar 16, 2019
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
propositional-logic
+
–
0
votes
0
answers
5755
Kenneth Rosen Edition 7 Exercise 1.4 Question 10 (Page No. 53)
Let $C(x)$ be the statement $x$ has a cat, let $D(x)$ be the statement $x$ has a dog, and let $F(x)$ be the statement $x$ ... and a ferret. For each of the three animals, cats,dogs, and ferrets, there is a student in your class who has this animal as a pet.
Let $C(x)$ be the statement “$x$ has a cat,” let $D(x)$ be the statement “$x$ has a dog,” and let $F(x)$ be the statement “$x$ has a ferret.” Express each of ...
Pooja Khatri
505
views
Pooja Khatri
asked
Mar 16, 2019
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
propositional-logic
+
–
0
votes
0
answers
5756
Kenneth Rosen Edition 7 Exercise 1.4 Question 7 (Page No. 53)
Translate these statements into English, where $C (x)$ is “$x$ is comedian” and $F(x)$ is “$x$ is funny” and the domain consists of all poeple. $\forall x (C (x) \rightarrow F(x))$ $\forall x (C(x) \wedge F(x))$ $\exists x (C(x) \rightarrow F(x))$ $\exists x (C(x) \wedge F(x))$
Translate these statements into English, where $C (x)$ is “$x$ is comedian” and $F(x)$ is “$x$ is funny” and the domain consists of all poeple.$\forall x (C (x) ...
Pooja Khatri
427
views
Pooja Khatri
asked
Mar 16, 2019
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
propositional-logic
+
–
0
votes
0
answers
5757
GATE 2019 Admission
@arjunsir @pragyAgrawal Is the career suggestion link in gate college predictor working? I haven't received any mail regarding the same. I have 64.33/100 marks and 737/1000 score. My rank is 498 in General category. Please suggest which colleges I should focus on. How do I gauge which colleges I can get?
@arjunsir @pragyAgrawal Is the career suggestion link in gate college predictor working? I haven't received any mail regarding the same.I have 64.33/100 marks and 737/10...
Nidhi Budhraja
1.7k
views
Nidhi Budhraja
asked
Mar 15, 2019
Written Exam
admissions
getting-to-iits
usergate2019
usermod
iit
iisc
+
–
0
votes
0
answers
5758
Kenneth Rosen Edition 7 Exercise 1.3 Question 7 (Page No. 34)
Use De Morgan’s laws to find negation of each of the following statements. Jan is rich and happy. Carlos will bicycle or run tomorrow. Mei walks or takes the bus to class. Ibrahim is smart and hard working.
Use De Morgan’s laws to find negation of each of the following statements.Jan is rich and happy.Carlos will bicycle or run tomorrow.Mei walks or takes the bus to class....
Pooja Khatri
626
views
Pooja Khatri
asked
Mar 15, 2019
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
propositional-logic
+
–
0
votes
0
answers
5759
Kenneth Rosen Edition 7 Exercise 1.3 Question 6 (Page No. 34)
Use a truth table to verify the first De Morgan law $\sim(p \wedge q)$ $\equiv$ $\sim p \vee \sim q$
Use a truth table to verify the first De Morgan law$\sim(p \wedge q)$ $\equiv$ $\sim p \vee \sim q$
Pooja Khatri
387
views
Pooja Khatri
asked
Mar 15, 2019
Mathematical Logic
kenneth-rosen
discrete-mathematics
propositional-logic
mathematical-logic
+
–
1
votes
0
answers
5760
Time complexity
Is this the correct way to solve ? Q) int algorithm(int n) { int sum =0;k,j; for (k=0;k<n/2;k++) for(j=0;j<10;j++) sum++; return 4*algorithm(n/2)*algorithm(n/2)+algorithm(n/2)*algorithm(n/2) }
Is this the correct way to solve ?Q) int algorithm(int n){ int sum =0;k,j; for (k=0;k<n/2;k++) for(j=0;j<10;j++) sum++; return 4*algorithm(n/2)*algorit...
syncronizing
1.3k
views
syncronizing
asked
Mar 15, 2019
Algorithms
time-complexity
algorithms
recurrence-relation
+
–
Page:
« prev
1
...
187
188
189
190
191
192
193
194
195
196
197
...
593
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register