1 answer
1
isn't the answer is directly speedup = number of stages * efficiencyplease confirm
1 answer
2
If packet with TTL value = 0 received at destination, then destination discard that packet or accept that packet.
1 answer
12
Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is ...
1 answer
14
answer given is : 0.153
0 answers
15
0 answers
16
I'm getting 9.8 Bytesin such question can we answer in float, as utilization is given not its range?
0 answers
17
Answer given is : Baccording to me it should be Dplease verify
0 answers
18
given answer is won't there be an edge b/w (E and =) and (= and the uppermost node)
1 answer
19
How to make sure that the answer we got is the minimum one in such questions?answer for this question : 6 (3 or gate , 3 not gate)
1 answer
20
here for 1st relation algebra operation the join operation is given without condition , will it be considered as natural join or cartesian product?
0 answers
24
1 answer
25
1 answer
26
Given a finite automata M, is it the minimum state FA accepting L(M)is this problem decidable, if yes then why?
0 answers
29
1 answer
30
How to solve this question?