# Recent posts tagged gate2020

1
Yeah why not you have found a solution it cab be one of the option but always choose the best one
2
hi I have already posted the same thing . Please have a look ! My question is different !
3
more details plzzz
5
6
Which of following statement is true ? S1. Any boolean function can be realized using decoder s2. One multiplexer can realize 1 function at a time a) S1 is true b) S2 is true 3) Both are true d) none of them
7
The baud rate is the rate at which information is transferred in a communication channel. Serial ports use two-level (binary) signaling, so the data rate in bits per second is equal to the symbol rate in bauds. Ref: https://en.wikipedia.org/wiki/Serial_port#Speed. ... bit $=12\text{ bits}$. So, number of characters transmitted per second $=\dfrac{9600}{12}=800$. Correct Answer: $B$
9
Answer: A and C. For every NFA there exists a DFA. For every NPDA there does not exist a deterministic PDA. Every nondeterministic Turing machine has an equivalent deterministic Turing Machine.
10
As it is already written that x is a intermediate node so it cann't be the last node. Hence, complexity should be O(1) by the algo that gate_asp have given below. Tell me if i am wrong?
13
first we find forbidden latency which is distance between each pair or X in the same row=(2,4) ... FL indicate another task can not initiated after this permissible latency =(1,3) we may initiate another task after this. now we can find collision vector using FL .. this collision vector ... or avg latency of (1,5)=(1+5)/2=3) so the answer is 3 http://www2.cs.siu.edu/~cs401/Textbook/ch3.pdf
14
If the list of letters $P$, $R$, $S$, $T$, $U$ is an arithmetic sequence, which of the following are also in arithmetic sequence? $2P, 2R, 2S, 2T, 2U$ $P-3, R-3, S-3, T-3, U-3$ $P^2, R^2, S^2, T^2, U^2$ I only I and II II and III I and III
To see more, click for the full list of questions or popular tags.