Register
Filter

Questions by thor

0 votes
3 answers
1
Question
Find minimal states in DFA accepting {w1aw2, |w1| = 2, |w2| >=3, w1,w2 $\in$ $(a+b)^*$}? Is it $7$ or $8$?
Find minimal states in DFA accepting {w1aw2, |w1| = 2, |w2| >=3, w1,w2 $\in$ $(a+b)^*$}?Is it $7$ or $8$?
0 votes
0 answers
2
set theory
1 votes
1 answer
3
Graph MST
For a simple, undirected, weighted graph each edge havind distinct weight, How is it possible that there can be more than $1$ second best minimum spanning tree?
For a simple, undirected, weighted graph each edge havind distinct weight, How is it possible that there can be more than $1$ second best minimum spanning tree?
0 votes
0 answers
4
find output
0 votes
1 answer
5
DAG ace test question
How does answer change when it is in SSA form? does answer remains 4 or 5
How does answer change when it is in SSA form? does answer remains 4 or 5
0 votes
0 answers
6
find output
1 votes
2 answers
7
please answer
0 votes
0 answers
8
logic
Which of above three are valid. I know A3 is valid.
Which of above three are valid. I know A3 is valid.
1 votes
1 answer
9
algo + bfs
0 votes
0 answers
10
PDautomata
What is language accepted by above PDA, where 0 is final state and 1 denotes non-final state ?
What is language accepted by above PDA, where 0 is final state and 1 denotes non-final state ?
2 votes
1 answer
12
Compare
Which of the following two is correct? If f(n) = Ο(g(n)) then h(f(n)) = Ο(h(g(n))) If f(n) ≠ Ο(g(n)) then g(n) = Ο(f(n))
Which of the following two is correct?If f(n) = Ο(g(n)) then h(f(n)) = Ο(h(g(n)))If f(n) ≠ Ο(g(n)) then g(n) = Ο(f(n))
1 votes
1 answer
13
Cache Memory
A byte addressable computer has a small data cache capable of holding 16 32-bit words. Each cache block consist of four 32 bits words. For the following sequence of addresses (in hexadecimal). The miss ratio if 4-way set associative LRU cache is used is ______. 100, 104, 108, 104, 107, 108, 105, 102, 108, 103
A byte addressable computer has a small data cache capable of holding 16 32-bit words. Each cache block consist of four 32 bits words. For the following sequence of addre...
0 votes
0 answers
15
Algo rec
What is the tightest upper bound to $T(n) = T(n-1) + 2^n$? $O(n2^n)$ $O(2^n)$ $O(2^{2n})$ None
What is the tightest upper bound to $T(n) = T(n-1) + 2^n$?$O(n2^n)$$O(2^n)$$O(2^{2n})$None
4 votes
1 answer
17
ME-CN
Assume a CSMA/CD network that transmit data at a rate of 20 Mbps over a 20 km cable with no repeater. If minimum frame size require for network is 5,000 KB then speed of the signal inside cable is __________ (in Km/sec). What should be correct ans : 19.53 or 20
Assume a CSMA/CD network that transmit data at a rate of 20 Mbps over a 20 km cable with no repeater. If minimum frame size require for network is 5,000 KB then speed of ...
0 votes
0 answers
18
What should be answer 51 or 52?
A B+ tree index is built on the key ‘CS’ attribute of the relation ME16. The attribute ‘CS’ is of length 32 bytes, disk blocks are of size 2048 bytes and index pointers are of size 8 bytes. The number of pointers per node is _______.
A B+ tree index is built on the key ‘CS’ attribute of the relation ME16. The attribute ‘CS’ is of length 32 bytes, disk blocks are of size 2048 bytes and index po...
0 votes
0 answers
19
REL epsilon
A Turing Machine goes on to an infinite loop on string $\epsilon$. Is it correct? And thus Any language containing $\epsilon$ is not REL. Is it correct?
A Turing Machine goes on to an infinite loop on string $\epsilon$. Is it correct? And thus Any language containing $\epsilon$ is not REL.Is it correct?
1 votes
0 answers
20
dbms ace
Page: