ISRO Scientist or Engineer Computer Science 2007

$$A\overline{C}$$

$$B\overline{C}$$

$$\overline{C}$$

$$AB$$

$$(\overline{A + B} + C)(\overline{D} \overline{E})$$

$$ (\overline{ A+B}+C)(D \overline{E})$$

$$(A + \overline {B + C})(\overline{D} E)$$

$$(A + B + \overline{C})(\overline{D}  \overline{E})$$

full adder

full subtracter

shift register

decade counter

subtract 0011 from the sum

add 0011 to the sum

subtract 0110 from the sum

add 0110 to the sum

$$Q_{n + 1} = S + RQ_{n}$$

$$Q_{n + 1} = R \overline{Q}_n + \overline{S}Q_n$$

$$Q_{n + 1} = \overline{S} + RQ_n$$

$$Q_{n+1} = S + \overline{R} Q_{n}$$

Connected

Disconnected

Euler

A circuit

1

K

K-1

$$\frac{K}{2}$$

and written by CPU

and written by peripheral

by pheripheral and written by CPU

by CPU and written by the peripheral

$$\begin{bmatrix}a^{n} & 1 \\ 0 & a^{n} \end{bmatrix} $$

$$\begin{bmatrix}a^{n} &n \\ 0 & a^{n} \end{bmatrix} $$

$$\begin{bmatrix}a^{n} &n.a^{n-1} \\ 0 & a^{n} \end{bmatrix}$$

$$\begin{bmatrix}a^{n} &n.a^{n-1} \\ -n & a^{n} \end{bmatrix}$$

booting up the priority of a process in multi-level of queue without feedback.

gradually increasing the priority of jobs that wait in the system for a long time to remedyinfinite blocking.

keeping track of the following a page has been in memory for the purpose of LRU replacement

letting job reside in memory for a certain amount of time so that the number of pages required can be estimated accurately.