Register
Filter

Recent activity by atul_21

2 answers
1
Decidability
Whether a TM has finite number of states? Decidable or undecidable??
Whether a TM has finite number of states?Decidable or undecidable??
0 answers
3
Graph theory
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 degree 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 ...
0 answers
4
Number of topological ordering
0 answers
6
Manchester encoding
For a fixed baud rate, Manchester encoding communication bits twice as fast as NRZ. True or False? Please explain anyone.
For a fixed baud rate, Manchester encoding communication bits twice as fast as NRZ.True or False?Please explain anyone.
1 answer
9
Self Doubt on CSMA/CD
In how much time ,the collision is detected, Is it (Propagation delay) or (2* Propagation delay) ??
In how much time ,the collision is detected, Is it (Propagation delay) or (2* Propagation delay) ??
0 answers
10
Block Accesses
1 answer
14
Sum is even?
1 answer
15
Addressing Mode
S1 : Relative mode is the addressing mode which can be used to write code in which reallocation is done at run time. S2 : Indirect addressing through registers can be used to access global variables. Which of the following option is correct?
S1 : Relative mode is the addressing mode which can be used to write code in which reallocation is done at run time.S2 : Indirect addressing through registers can be used...
0 answers
16
CFL or not
L = {ww' : w ∈ {a, b}*}, where w' stands for w with each occurrence of a replaced by b, and vice versa Is this CFL ??
L = {ww' : w ∈ {a, b}*}, where w' stands for w with each occurrence of a replaced by b, and vice versaIs this CFL ??
0 answers
17
C Output-Doubt
why it is showing 56 as output????
why it is showing 56 as output????
0 answers
18
Fermat's theorem
plz explain this.
plz explain this.
1 answer
19
2NF bt not in 3NF
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 answer?
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...
0 answers
20
OSPF routers
Any idea about this???
Any idea about this???
0 answers
21
What is the language ?
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???
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 answer
22
Tautology or Contingency
I tried this two times, I was getting it "Contingency" . Please check.
I tried this two times, I was getting it "Contingency" . Please check.
0 answers
23
Number of nodes in Binary tree
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 degree method was good.)
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...
0 answers
24
Countability
0 answers
25
What is PCP ???
0 answers
26
Searching
1 answer
27
Calculate the cost of sorting using m-way merge sort :
Assume 5 buffer pages are available to sort a file of 105 pages. The cost of sorting using m-way merge sort is A. 206 B. 618 C. 840 D. 926
Assume 5 buffer pages are available to sort a file of 105 pages. The cost of sorting using m-way merge sort isA. 206B. 618C. 840D. 926
0 answers
28
Variation of Merge sort
1 answer
29
Bit vector: Number of blocks
1 answer
30
Minimum retrieval time
please explain the approach.
please explain the approach.