ISRO 2007 Computer Science Questions with Solution

# Recent questions tagged isro2007

1
The five items: A, B, C, D, and E are pushed in a stack, one after other starting from A. The stack is popped four items and each element is inserted in a queue. The two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is A B C D
2
Consider the following pseudo-code x:=1; i:=1; while (x <= 1000) begin x:=2^x; i:=i+1; end; What is the value of i at the end of the pseudo-code? 4 5 6 7
3
The principal of the locality of reference justifies the use of virtual memory interrupts main memory cache memory
4
By using an eight bit optical encoder the degree of resolution that can be obtained is (approximately) $1.8^\circ$ $3.4^\circ$ $2.8^\circ$ $1.4^\circ$
5
Consider a job scheduling problem with 4 jobs $J_1, J_2, J_3$ and $J_4$ with corresponding deadlines: $(d_1, d_2, d_3, d_4) = (4, 2, 4, 2)$. Which of the following is not a feasible schedule without violating any job schedule? $J_2, J_4, J_1, J_3$ $J_4, J_1, J_2, J_3$ $J_4, J_2, J_1, J_3$ $J_4, J_2, J_3, J_1$
6
Consider a set of n tasks with known runtimes $r_1, r_2, \dots r_n$ to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput? Round Robin Shortest job first Highest response ratio next first come first served
7
The term &lsquo;aging&rsquo; 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 ... letting job reside in memory for a certain amount of time so that the number of pages required can be estimated accurately.
8
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}$
9
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
10
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
11
A graph with $n$ vertices and $n-1$ edges that is not a tree, is Connected Disconnected Euler A circuit
12
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$
13
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
14
The circuit shown in the given figure is a full adder full subtracter shift register decade counter
15
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})$
16
The Boolean expression $Y=(A+\bar{B}+\bar{A}B)\bar{C}$ is given by $A\bar{C}$ $B\bar{C}$ $\bar{C}$ $AB$
17
Identify the correct translation into logical notation of the following assertion. Some boys in the class are taller than all the girls Note: $\text{taller} (x, y)$ is true if $x$ is taller than $y$ ... $(\exists x) (\text{boy}(x) \land (\forall y) (\text{girl}(y) \rightarrow \text{taller}(x, y)))$
In an $SR$ latch made by cross-coupling two NAND gates, if both $S$ and $R$ inputs are set to $0$, then it will result in $Q = 0, Q' = 1$ $Q = 1, Q' = 0$ $Q = 1, Q' = 1$ Indeterminate states
A program consists of two modules executed sequentially. Let $f_1(t)$ and $f_2(t)$ respectively denote the probability density functions of time taken to execute the two modules. The probability density function of the overall time taken to execute the program is given by $f_1(t)+f_2(t)$ $\int_0^t f_1(x)f_2(x)dx$ $\int_0^t f_1(x)f_2(t-x)dx$ $\max\{f_1(t),f_2(t)\}$