search
Log In
ISRO 2007 Computer Science Questions with Solution

Recent questions tagged isro2007

6 votes
2 answers
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
asked Jun 10, 2016 in DS jothee 5.4k views
8 votes
3 answers
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
asked Jun 10, 2016 in Programming jothee 3k views
7 votes
4 answers
3
The principal of the locality of reference justifies the use of virtual memory interrupts main memory cache memory
asked Jun 10, 2016 in CO and Architecture jothee 4.4k views
4 votes
2 answers
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$
asked Jun 10, 2016 in Computer Networks jothee 2.9k views
5 votes
2 answers
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$
asked Jun 10, 2016 in Operating System jothee 4.3k views
17 votes
4 answers
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
asked Jun 10, 2016 in Operating System jothee 5.4k views
4 votes
3 answers
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.
asked Jun 10, 2016 in Operating System jothee 2.4k views
4 votes
3 answers
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}$
asked Jun 10, 2016 in Linear Algebra jothee 2.6k views
6 votes
2 answers
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
asked Jun 10, 2016 in CO and Architecture jothee 3.4k views
5 votes
2 answers
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
asked Jun 10, 2016 in Graph Theory jothee 2.6k views
8 votes
2 answers
11
A graph with $n$ vertices and $n-1$ edges that is not a tree, is Connected Disconnected Euler A circuit
asked Jun 10, 2016 in Graph Theory jothee 1.8k views
5 votes
3 answers
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$
asked Jun 10, 2016 in Digital Logic jothee 1.9k views
7 votes
4 answers
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
asked Jun 10, 2016 in Digital Logic jothee 4k views
6 votes
2 answers
14
The circuit shown in the given figure is a full adder full subtracter shift register decade counter
asked Jun 5, 2016 in Digital Logic jothee 2.5k views
6 votes
2 answers
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})$
asked Jun 5, 2016 in Digital Logic jothee 2.1k views
7 votes
4 answers
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$
asked Jun 5, 2016 in Digital Logic jothee 2.1k views
55 votes
4 answers
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)))$
asked Sep 19, 2014 in Mathematical Logic Kathleen 5.9k views
52 votes
6 answers
18
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by the instruction set architecture page size number of processes in memory physical memory size
asked Sep 19, 2014 in Operating System Kathleen 9.4k views
35 votes
11 answers
19
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
asked Sep 19, 2014 in Digital Logic Kathleen 8.1k views
25 votes
3 answers
20
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)\}$
asked Sep 17, 2014 in Probability Kathleen 3.8k views
...