Register
Filter

Questions by alpha

0 votes
1 answer
1
ravula test series
Which of the following statements is/are TRUE? S1: Suppose L is Turing recognizable but not Turing decidable. Then any Turing machine that recognizes L must fail to halt on an infinite number of strings. S2: The language A'TM={⟨M,w⟩ | M does not accept w} is Turing recognizable.
Which of the following statements is/are TRUE?S1: Suppose L is Turing recognizable but not Turing decidable. Then any Turing machine that recognizes L must fail to halt o...
0 votes
0 answers
2
test series
Consider the following code: S1 Parbegin Begin S2:S4 End; Begin S3; Parbegin S5; Begin S6:S8 End Parend End S7 Parend S9 Find the precedence graph?
Consider the following code:S1ParbeginBeginS2:S4End;BeginS3;ParbeginS5;BeginS6:S8EndParendEndS7ParendS9Find the precedence graph?
1 votes
1 answer
3
ace test series
A TCP sender choses its initial sequence number as 1093 and sends 1460 bytes of data to the reciever The reciever has an initial sequence number 391 and acknowledges the data of sender The acknowledgment number sent by the receiver is_______ ?
A TCP sender choses its initial sequence number as 1093 and sends 1460bytes of data to the reciever The reciever has an initial sequence number391 and acknowledges the ...