1 answer
4
Answer for Minimum no of nor gates question
1 answer
6
Consider the following relation:R (A1, A2, ….An) and every (n-2) attributes of R forms a candidate key. How many superkeys are there in R?
2 answers
7
Consider the following relation R(A1, A2,...A15) with (A1,A2, ... A6) of relation R are simple candidate key. The number of possible superkey in relation R is_
1 answer
8
please provide the detailed solution
1 answer
9
tell which are cascadeless or strict or bothW1(A),W2(A),COMMIT1,COMMIT2R1(A),R2(A),COMMIT1,COMMIT2R1(A),W1(A),R2(A),COMMIT1,COMMIT2R1(A),W2(A),COMMIT1,COMMIT2
4 answers
10
Is the below statement correct:Bellman Ford finds all negative weight cycles in the graph.This is true or false?
2 answers
12
1 answer
13
L = { w $\epsilon$ {0,1} | w has equal occurrence of 001 and 010 }Is the language regular ?
1 answer
14
Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00or 11.
1 answer
15
The average no. of comparisons performed by the merge sort algorithm, in merging 2 sorted lists of length 2 is___________.Ans: $\frac{8}{3}$
0 answers
17
In the given network system, station A needs to send a payload of 1600 B from its network layer to station B. If fragmentation is done, then the actual data size to be tr...
1 answer
19
minimum no fo relation require for this ER diagrami am thinking 3 relation but given answer is______something else
0 answers
20
A grammar that has no epsilon productions and also free from unit productions. The maximum number of reduce moves that can be taken during bottom-up evaluation of 25 toke...
1 answer
22
Number of state in DFA accepting a language L={anbn,1<= n <=3 } over {a,b} ……..
1 answer
24
0 answers
29
MOD-8 synchronous down counterMOD-8 asynchronous up counterMOD-10 asynchronous up counterMOD-8 asynchronous down counterPlease explain why it is down counter?