The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged isro2007
ISRO 2007 Computer Science Questions with Solution
+6
votes
2
answers
1
ISRO200716, ISRO200930, ISRO201443
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
by
jothee
Veteran
(
105k
points)

4.4k
views
isro2007
stack
isro2009
isro2014
+8
votes
3
answers
2
ISRO200715
Consider the following pseudocode 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 pseudocode? 4 5 6 7
asked
Jun 10, 2016
in
Programming
by
jothee
Veteran
(
105k
points)

2.3k
views
isro2007
loopinvariants
+7
votes
3
answers
3
ISRO200714
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
by
jothee
Veteran
(
105k
points)

4k
views
isro2007
coandarchitecture
cachememory
+4
votes
2
answers
4
ISRO200713
By using an eight bit optical encoder the degree of resolution that can be obtained is (approximately) $1.8^0$ $3.4^0$ $2.8^0$ $1.4^0$
asked
Jun 10, 2016
in
Computer Networks
by
jothee
Veteran
(
105k
points)

2.6k
views
isro2007
communication
encoding
+5
votes
2
answers
5
ISRO200712
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
by
jothee
Veteran
(
105k
points)

2.8k
views
isro2007
operatingsystem
processschedule
+15
votes
4
answers
6
ISRO200711, GATE20011.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
asked
Jun 10, 2016
in
Operating System
by
jothee
Veteran
(
105k
points)

4.3k
views
isro2007
operatingsystem
processschedule
gate2001
+4
votes
3
answers
7
ISRO200710
The term ‘aging’ refers to booting up the priority of the process in multilevel 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.
asked
Jun 10, 2016
in
Operating System
by
jothee
Veteran
(
105k
points)

2k
views
isro2007
operatingsystem
memorymanagement
pagereplacement
+4
votes
3
answers
8
ISRO200709
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^{n1} \\ n && a^n \end{bmatrix}$
asked
Jun 10, 2016
in
Linear Algebra
by
jothee
Veteran
(
105k
points)

2.3k
views
isro2007
linearalgebra
matrices
eigenvalue
+6
votes
1
answer
9
ISRO200708
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
by
jothee
Veteran
(
105k
points)

3.2k
views
isro2007
coandarchitecture
+5
votes
2
answers
10
ISRO200707
If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is 1 k k1 k/2
asked
Jun 10, 2016
in
Graph Theory
by
jothee
Veteran
(
105k
points)

2.3k
views
isro2007
graphtheory
graphcoloring
+8
votes
2
answers
11
ISRO200706
A graph with $n$ vertices and $n1$ edges that is not a tree, is Connected Disconnected Euler A circuit
asked
Jun 10, 2016
in
Graph Theory
by
jothee
Veteran
(
105k
points)

1.6k
views
isro2007
graphtheory
+5
votes
3
answers
12
ISRO200705
The characteristic equation of an SR flipflop 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
by
jothee
Veteran
(
105k
points)

1.6k
views
isro2007
digitallogic
flipflop
+7
votes
4
answers
13
ISRO200704
When two numbers are added in excess3 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
by
jothee
Veteran
(
105k
points)

3.1k
views
isro2007
digitallogic
numberrepresentation
excess3
+6
votes
2
answers
14
ISRO200703
The circuit shown in the given figure is a full adder full subtracter shift register decade counter
asked
Jun 5, 2016
in
Digital Logic
by
jothee
Veteran
(
105k
points)

2k
views
isro2007
digitallogic
digitalcircuits
adder
+6
votes
2
answers
15
ISRO200702
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
by
jothee
Veteran
(
105k
points)

1.7k
views
isro2007
digitallogic
digitalcircuits
+6
votes
4
answers
16
ISRO200701
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
by
jothee
Veteran
(
105k
points)

1.9k
views
isro2007
booleanalgebra
+50
votes
4
answers
17
GATE200423, ISRO200732
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
by
Kathleen
Veteran
(
52.2k
points)

4.5k
views
gate2004
mathematicallogic
easy
isro2007
firstorderlogic
+43
votes
6
answers
18
GATE200421, ISRO200744
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
by
Kathleen
Veteran
(
52.2k
points)

6.9k
views
gate2004
operatingsystem
virtualmemory
pagereplacement
normal
isro2007
+30
votes
11
answers
19
GATE200418, ISRO200731
In an $SR$ latch made by crosscoupling 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
by
Kathleen
Veteran
(
52.2k
points)

6.2k
views
gate2004
digitallogic
easy
isro2007
flipflop
+20
votes
3
answers
20
GATE200360, ISRO200745
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(tx)dx$ $\max\{f_1(t),f_2(t)\}$
asked
Sep 17, 2014
in
Probability
by
Kathleen
Veteran
(
52.2k
points)

3k
views
gate2003
probability
normal
isro2007
Page:
« prev
1
2
3
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
Follow @csegate
Recent questions tagged isro2007
Recent Blog Comments
Lakshman Patel RJIT Do you have such notes...
Great work sir
Yes Sir, It will be very helpful if we get...
@arjun sir is there a pdf...
Really helpful sir Thanks a tonππ
50,645
questions
56,557
answers
195,717
comments
101,584
users