Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
ISRO 2007 Computer Science Questions with Solution
Recent questions tagged isro2007
5
votes
2
answers
61
ISRO2007-16, ISRO2009-30, ISRO2014-43
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
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 ...
go_editor
10.5k
views
go_editor
asked
Jun 10, 2016
DS
isro2007
stack
isro2009
isro2014
+
–
8
votes
3
answers
62
ISRO2007-15
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
Consider the following pseudo-codex:=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?4567
go_editor
15.9k
views
go_editor
asked
Jun 10, 2016
Programming in C
isro2007
loop-invariants
+
–
8
votes
4
answers
63
ISRO2007-14
The principal of the locality of reference justifies the use of virtual memory interrupts main memory cache memory
The principal of the locality of reference justifies the use ofvirtual memoryinterruptsmain memorycache memory
go_editor
5.8k
views
go_editor
asked
Jun 10, 2016
CO and Architecture
isro2007
co-and-architecture
cache-memory
+
–
5
votes
2
answers
64
ISRO2007-13
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$
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$
go_editor
4.7k
views
go_editor
asked
Jun 10, 2016
Computer Networks
isro2007
communication
encoding
+
–
5
votes
3
answers
65
ISRO2007-12
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$
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...
go_editor
13.2k
views
go_editor
asked
Jun 10, 2016
Operating System
isro2007
operating-system
process-scheduling
+
–
21
votes
6
answers
66
ISRO2007-11, GATE CSE 2001 | Question: 1.19
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
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 resul...
go_editor
13.0k
views
go_editor
asked
Jun 10, 2016
Operating System
isro2007
operating-system
process-scheduling
gatecse-2001
+
–
6
votes
3
answers
67
ISRO2007-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 ... letting job reside in memory for a certain amount of time so that the number of pages required can be estimated accurately.
The term ‘aging’ refers tobooting up the priority of the process in multi-level of queue without feedback.gradually increasing the priority of jobs that wait ...
go_editor
5.6k
views
go_editor
asked
Jun 10, 2016
Operating System
isro2007
operating-system
memory-management
page-replacement
+
–
5
votes
3
answers
68
ISRO2007-09
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} \\ -n && a^n \end{bmatrix}$
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 \\ ...
go_editor
4.1k
views
go_editor
asked
Jun 10, 2016
Linear Algebra
isro2007
linear-algebra
matrix
eigen-value
+
–
6
votes
2
answers
69
ISRO2007-08
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
A read bit can be readand written by CPUand written by peripheralby peripheral and written by CPUby CPU and written by the peripheral
go_editor
4.7k
views
go_editor
asked
Jun 10, 2016
CO and Architecture
isro2007
co-and-architecture
registers
+
–
8
votes
2
answers
70
ISRO2007-07
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$
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$
go_editor
4.0k
views
go_editor
asked
Jun 10, 2016
Graph Theory
isro2007
graph-theory
graph-coloring
+
–
11
votes
2
answers
71
ISRO2007-06
A graph with $n$ vertices and $n-1$ edges that is not a tree, is Connected Disconnected Euler A circuit
A graph with $n$ vertices and $n-1$ edges that is not a tree, isConnectedDisconnectedEulerA circuit
go_editor
2.9k
views
go_editor
asked
Jun 10, 2016
Graph Theory
isro2007
graph-theory
euler-graph
+
–
5
votes
3
answers
72
ISRO2007-05
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$
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$
go_editor
13.0k
views
go_editor
asked
Jun 10, 2016
Digital Logic
isro2007
digital-logic
flip-flop
+
–
9
votes
5
answers
73
ISRO2007-04
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
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 tosubtract $0011$ from the sumadd $001...
go_editor
10.6k
views
go_editor
asked
Jun 10, 2016
Digital Logic
isro2007
digital-logic
number-representation
+
–
7
votes
2
answers
74
ISRO2007-03
The circuit shown in the given figure is a full adder full subtracter shift register decade counter
The circuit shown in the given figure is afull adderfull subtractershift registerdecade counter
go_editor
6.0k
views
go_editor
asked
Jun 5, 2016
Digital Logic
isro2007
digital-logic
digital-circuits
adder
+
–
6
votes
2
answers
75
ISRO2007-02
The circuit shown in the following figure realizes the function. $(\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})$
The circuit shown in the following figure realizes the function.$(\overline{A+B}+C)(\overline{D}\;\overline{E})$$(\overline{A+B}+C)(D\overline{E})$$(A+ \overline{B+C})(\o...
go_editor
5.3k
views
go_editor
asked
Jun 5, 2016
Digital Logic
isro2007
digital-logic
digital-circuits
circuit-output
+
–
10
votes
4
answers
76
ISRO2007-01
The Boolean expression $\text{Y = (A}+\overline{\text{B}}+\overline{\text{A}}\text{B})\overline{\text{C}}$ is given by $\text{A}\overline{\text{C}}$ $\text{B}\overline{\text{C}}$ $\overline{\text{C}}$ $\text{AB}$
The Boolean expression $\text{Y = (A}+\overline{\text{B}}+\overline{\text{A}}\text{B})\overline{\text{C}}$ is given by$\text{A}\overline{\text{C}}$$\text{B}\overline{\tex...
go_editor
3.0k
views
go_editor
asked
Jun 5, 2016
Digital Logic
isro2007
digital-logic
boolean-algebra
+
–
88
votes
7
answers
77
GATE CSE 2004 | Question: 23, ISRO2007-32
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)))$
Identify the correct translation into logical notation of the following assertion.Some boys in the class are taller than all the girlsNote: $\text{taller} (x, y)$ is true...
Kathleen
131k
views
Kathleen
asked
Sep 18, 2014
Mathematical Logic
gatecse-2004
mathematical-logic
easy
isro2007
first-order-logic
+
–
66
votes
9
answers
78
GATE CSE 2004 | Question: 21, ISRO2007-44
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
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined bythe instruction set architecturepage sizenum...
Kathleen
23.9k
views
Kathleen
asked
Sep 18, 2014
Operating System
gatecse-2004
operating-system
virtual-memory
page-replacement
normal
isro2007
+
–
47
votes
9
answers
79
GATE CSE 2004 | Question: 18, ISRO2007-31
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
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$Inde...
Kathleen
22.3k
views
Kathleen
asked
Sep 18, 2014
Digital Logic
gatecse-2004
digital-logic
easy
isro2007
flip-flop
+
–
42
votes
5
answers
80
GATE CSE 2003 | Question: 60, ISRO2007-45
A program consists of two modules executed sequentially. Let $f_1(t)$ and $f_2(t)$ ... $\int_0^t f_1(x)f_2(t-x)dx$ $\max\{f_1(t),f_2(t)\}$
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 ...
Kathleen
9.2k
views
Kathleen
asked
Sep 17, 2014
Probability
gatecse-2003
probability
normal
isro2007
probability-density-function
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register