Consider the state space realization $$$\left[ {\matrix{ {\mathop x\limits^ \bullet } & {\left( t \right)} \cr {\mathop x\limits^ \bullet } & {\left( t \right)} \cr } } \right] = \left[ {\matrix{ 0 & 0 \cr 0 & { - 9} \cr } } \right]\left[ {\matrix{ {{x_1}} & {\left( t \right)} \cr {{x_2}} & {\left( t \right)} \cr } } \right] + \left[ {\matrix{ 0 \cr {45} \cr } } \right]u\left( t \right),$$$ with the initial condition $$\left[ {\matrix{ {{x_1}} & {\left( 0 \right)} \cr {{x_2}} & {\left( 0 \right)} \cr } } \right] = \left[ {\matrix{ 0 \cr 0 \cr } } \right];$$
Where u(t) denotes the unit step function.
The value of $$\mathop {Lt}\limits_{x \to \infty } \left| {\sqrt {{x_1}^2\left( t \right) + {x_2}^2\left( t \right)} } \right|$$ is ______

The state diagram of a finite state machine (FSM) designed to detect an overlapping sequence of three bits is shown in the figure. The FSM has an input 'In' and an output 'Out'. The initial state of the FSM is S₀.

If the input sequence is 10101101001101, starting with the left-most bit, then the number of times 'Out' will be 1 is __________.

In a DRAM,

Consider the circuit shown in the figure. The Boolean expression F implemented by the circuit is