0 votes
2 answers
1
Whether a TM has finite number of states?Decidable or undecidable??
1 votes
0 answers
2
Assume that a simple connected graph with 6 nodes with only half the node pairs having an edge between them.What is the probability that a randomly chosen node will have ...
6 votes
0 answers
3
2 votes
0 answers
5
For a fixed baud rate, Manchester encoding communication bits twice as fast as NRZ.True or False?Please explain anyone.
2 votes
1 answer
8
In how much time ,the collision is detected, Is it (Propagation delay) or (2* Propagation delay) ??
1 votes
0 answers
9
L = {ww' : w ∈ {a, b}*}, where w' stands for w with each occurrence of a replaced by b, and vice versaIs this CFL ??
2 votes
0 answers
10
why it is showing 56 as output????
1 votes
0 answers
11
plz explain this.
1 votes
1 answer
12
In option C: we can write DB->AC as DB->A and DB->C . And clearly DB->C is a partial dependency. how is it in 2NF??please explain Option D also,how is that the a...
1 votes
0 answers
13
Any idea about this???
1 votes
0 answers
14
If L= set of all strings of 0's and 1's where last two symbols are different. My doubt is will the language include epsilon or not???
1 votes
0 answers
15
3 votes
1 answer
16
1 votes
0 answers
17
I did (12*3 +7*2 + x) = 2(No of edges) = 2(12+7+x-1)(x= no. of leaf nodes) . Am i wrong somewhere?? Please explain. Or any other good way to do this. (But the deg...
1 votes
0 answers
18
2 votes
1 answer
19
I tried this two times, I was getting it "Contingency" . Please check.
1 votes
0 answers
20