2 answers
1
Find $\left [ x^{50} \right ]$$\left ( x^{6}+x^{7}+x^{8}+.... \right )^{6}$
1 answer
2
0 answers
3
2 answers
4
Relation R which satisfy 3NF and atmost one compound candidate key is also in BCNF(pls explain give counter examples for both true and false)
7 answers
5
Let $f(n)= Ω(n), g(n)= O(n)$ and $h(n)= Ѳ(n)$. Then $[f(n). g(n)] + h(n)$ is:Ω (n)O (n)Ѳ (n)None of these
1 answer
6
A) Ο(logn)B) Ο(n logn)C) Ο(n)2D) Ο(n2 logn)
1 answer
7
True and falseWound-Wait algorithm always start with new time stamp after killing.Wait-Die algorithm always start with new time stamp after killing .pls explain both a...
0 answers
8
0 answers
9
1) language that contain epsilon can convert into CNF ?2) language that contain epsilon can convert into GNF ?
0 answers
10
IF any ICMP packet discacted by some router ,is icmp packet generated in response to it ?If ICMP echo request and reply is descarted by some router is icmp packet genera...
1 answer
11
Where is fragmentation is done in ipv4 ?..(at source or router or ob both )where is segmentation is done in ipv4 ?(at source or router or ob both)
5 answers
12
0 answers
13
0 answers
14
Which of the following causes for conflict in LL(1)?A) Left recurtion b) left factoring c) both A & BD) none of the above (pls explain with example)
0 answers
15
For any two languages A and B, if A ⊆ B, then A is reducible to B.true or false pls explain
0 answers
16
Is epsilon recursively enumerable ?pls explain.
0 answers
17
1) L(M) is recognized by a TM having even number of states.2) L(M) is infinite.whether this language are follow non-trivial property ?Whether this languages are decidable...
1 answer
18
0 answers
19
0 answers
20
can null graph can be biparted graph ?
0 answers
21
2 answers
22
2 answers
23
pls explain
2 answers
24
3 answers
25
I have doubt in 3rd statement second part
0 answers
26
1 answer
27
Find out canonical cover and minimal cover of following FDs:{ A >CAC ->DE - ADE ->H }
1 answer
28
how deadlock and starvation possible?
1 answer
29