Log In

Recent posts in Theory of Computation

Queue is FIFO and W is arriving first. Now, when P is blocked it should go behind W in queue.
posted Aug 30, 2020 in Theory of Computation Deepakk Poonia (Dee) 11,608 views
2, 3 and 4 are possible for implementing inverted list. Basically we need an indexed access to the file (as in hashing) but this might not be there in a simple sequential file.
posted Nov 7, 2019 in Theory of Computation Shaik Masthan
edited Feb 5 by Shaik Masthan
Yes. Because both are ADD instructions and before the write to R2 in the second instruction the Read for I1 would be completed. But this assumes I1 is not waiting for any other operand- no other data dependencies.
posted Sep 20, 2019 in Theory of Computation Arjun 2,743 views
It is true that the counting starts from 0, so the 29th sector is actually the 30th sector. Or is it?! Notice that although the counting begins with 0, the starting sector is labelled the 0th sector, and not the first. So, to reach the sector marked by the address <0, 0, 3>, we need to goto ... 0th sector <0,0,1> = 1st sector <0,0,2> = 2nd sector <0,0,3> = 3rd sector ... <0,0,29> = 29th sector.
posted Jan 16, 2019 in Theory of Computation Arjun
edited Jan 27, 2019 by Arjun
One more reference link:
posted Sep 14, 2018 in Theory of Computation Balaji Jegan
edited Nov 23, 2018 by Balaji Jegan
The truth table ${\begin{array}{|c|c|c|}\hline \textbf{X}& \textbf{Y}& \textbf{(X,Y)} \\\hline 0& 0& 0 \\ \hline 0& 1&0\\ \hline 1& 0& 1 \\\hline 1& 1& 1 \\\hline \end{array}}$ represents the Boolean function $X$ $X + Y$ $X \oplus Y$ $Y$
posted Jan 22, 2016 in Theory of Computation bahirNaik 351 views
To see more, click for the full list of questions or popular tags.