ISRO CSE 2007

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

A
(\overline{A+B}+C)(\bar{D}\bar{E})
B
(\overline{A+B}+C)(D\bar{E})
C
(A+ \overline{B+C})(\bar{D}E)
D
(A+ B+\bar{C})(\bar{D} \bar{E})
Digital Logic   Boolean Algebra
Question 3
The circuit shown in the given figure is a

A
full adder
B
full subtracter
C
shift register
D
decade counter
Digital Logic   Boolean Algebra
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
A
subtract 0011 from the sum
B
add 0011 to the sum
C
subtract 0110 from the sum
D
add 0110 to the sum
Digital Logic   Number System
Question 5
The characteristic equation of an SR flip-flop is given by :
A
Q_{n+1}=S+RQ_n
B
Q_{n+1}=R\bar{Q}_n + \bar{S}Q_n
C
Q_{n+1}=\bar{S}+RQ_n
D
Q_{n+1}=S+\bar{R}Q_n
Digital Logic   Sequential Circuit
Question 6
A graph with n vertices and n-1 edges that is not a tree, is
A
Connected
B
Disconnected
C
Euler
D
A circuit
Discrete Mathematics   Graph Theory
Question 7
If a graph requires k different colours for its proper colouring, then the chromatic number of the graph is
A
1
B
k
C
k-1
D
k/2
Discrete Mathematics   Graph Theory
Question 8
A read bit can be read
A
and written by CPU
B
and written by peripheral
C
by peripheral and written by CPU
D
by CPU and written by the peripheral
Computer Organization   IO Interface
Question 9
Eigen vectors of \begin{bmatrix} 1 && \cos \theta \\ \cos \theta && 1 \end{bmatrix} are
A
\begin{bmatrix} a^n && 1 \\ 0 && a^n \end{bmatrix}
B
\begin{bmatrix} a^n && n \\ 0 && a^n \end{bmatrix}
C
\begin{bmatrix} a^n && na^{n-1} \\ 0 && a^n \end{bmatrix}
D
\begin{bmatrix} a^n && na^{n-1} \\ -n && a^n \end{bmatrix}
Engineering Mathematics   Linear Algebra
Question 10
The term 'aging' refers to
A
booting up the priority of the process in multi-level of queue without feedback.
B
gradually increasing the priority of jobs that wait in the system for a long time to remedy infinite blocking
C
keeping track of the following a page has been in memory for the purpose of LRU replacement
D
letting job reside in memory for a certain amount of time so that the number of pages required can be estimated accurately.
Operating System   CPU Scheduling
There are 10 questions to complete.

Leave a Comment