Question 1 |
The Boolean expression Y=(A+\bar{B}+\bar{A}B)\bar{C} is given by
A\bar{C} | |
B\bar{C} | |
\bar{C} | |
AB |
Question 1 Explanation:
Question 2 |
The circuit shown in the following figure realizes the function.


(\overline{A+B}+C)(\bar{D}\bar{E}) | |
(\overline{A+B}+C)(D\bar{E}) | |
(A+ \overline{B+C})(\bar{D}E) | |
(A+ B+\bar{C})(\bar{D} \bar{E}) |
Question 2 Explanation:
Question 3 |
The circuit shown in the given figure is a


full adder | |
full subtracter | |
shift register | |
decade counter |
Question 3 Explanation:
Question 4 |
When two numbers are added in excess-3 code and the sum is less than 9, then in order to get the correct answer it is necessary to
subtract 0011 from the sum | |
add 0011 to the sum | |
subtract 0110 from the sum | |
add 0110 to the sum |
Question 4 Explanation:
Question 5 |
The characteristic equation of an SR flip-flop is given by :
Q_{n+1}=S+RQ_n | |
Q_{n+1}=R\bar{Q}_n + \bar{S}Q_n | |
Q_{n+1}=\bar{S}+RQ_n | |
Q_{n+1}=S+\bar{R}Q_n |
Question 5 Explanation:
Question 6 |
A graph with n vertices and n-1 edges that is not a tree, is
Connected | |
Disconnected | |
Euler | |
A circuit |
Question 6 Explanation:
Question 7 |
If a graph requires k different colours for its proper colouring, then the chromatic number of the graph is
1 | |
k | |
k-1 | |
k/2 |
Question 7 Explanation:
Question 8 |
A read bit can be read
and written by CPU | |
and written by peripheral | |
by peripheral and written by CPU | |
by CPU and written by the peripheral |
Question 8 Explanation:
Question 9 |
Eigen vectors of \begin{bmatrix} 1 && \cos \theta \\ \cos \theta && 1 \end{bmatrix} are
\begin{bmatrix} a^n && 1 \\ 0 && a^n \end{bmatrix} | |
\begin{bmatrix} a^n && n \\ 0 && a^n \end{bmatrix} | |
\begin{bmatrix} a^n && na^{n-1} \\ 0 && a^n \end{bmatrix} | |
\begin{bmatrix} a^n && na^{n-1} \\ -n && a^n \end{bmatrix} |
Question 9 Explanation:
Question 10 |
The term 'aging' refers to
booting up the priority of the process in multi-level of queue without feedback. | |
gradually increasing the priority of jobs that wait in the system for a long time to remedy infinite 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. |
Question 10 Explanation:
There are 10 questions to complete.