Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
ISRO 2016 Computer Science Questions with solution
Recent questions tagged isro2016
5
votes
3
answers
31
ISRO2016-61
The extent to which the s/w can continue to operate correctly despite the introduction of invalid inputs is called as Reliability Robustness Fault tolerance Portability
The extent to which the s/w can continue to operate correctly despite the introduction of invalid inputs is called asReliabilityRobustnessFault tolerancePortability
Desert_Warrior
4.8k
views
Desert_Warrior
asked
Jul 3, 2016
IS&Software Engineering
is&software-engineering
isro2016
+
–
2
votes
2
answers
32
ISRO2016-62
Which one of the following is a functional requirement ? Maintainability Portability Robustness None of the mentioned
Which one of the following is a functional requirement ?MaintainabilityPortabilityRobustnessNone of the mentioned
Desert_Warrior
13.6k
views
Desert_Warrior
asked
Jul 3, 2016
IS&Software Engineering
is&software-engineering
isro2016
+
–
6
votes
2
answers
33
ISRO2016-49
Working Set $(t,k)$ at an instant of time $t$ is the set of $k$ future references that the OS will make the set of future references that the OS will make in next $t$ unit of time the set of $k$ references with high frequency the $k$ set of pages that have been referenced in the last $t$ time units
Working Set $(t,k)$ at an instant of time $t$ isthe set of $k$ future references that the OS will makethe set of future references that the OS will make in next $t$ unit ...
Desert_Warrior
6.3k
views
Desert_Warrior
asked
Jul 3, 2016
Operating System
operating-system
page-replacement
isro2016
+
–
5
votes
2
answers
34
ISRO2016-39
Access time of the symbolic table will be logarithmic if it is implemented by Linear list Search tree Hash table Self organization list
Access time of the symbolic table will be logarithmic if it is implemented byLinear listSearch treeHash tableSelf organization list
Desert_Warrior
3.1k
views
Desert_Warrior
asked
Jul 3, 2016
Algorithms
isro2016
algorithms
symbol-table
+
–
10
votes
1
answer
35
ISRO2016-33
Let $L=\{w \in (0+1)^* \mid w \text{ has even number of 1's}\}$, i.e. $L$ is the set of all bit strings with even number of 1's. Which one of the regular expression below represents $L$? $(0^*10^*1)^*$ $0^*(10^*10^*)^*$ $0^*(10^*1^*)^*0^*$ $0^*1(10^*1)^*10^*$
Let $L=\{w \in (0+1)^* \mid w \text{ has even number of 1's}\}$, i.e. $L$ is the set of all bit strings with even number of 1's. Which one of the regular expression below...
Desert_Warrior
4.9k
views
Desert_Warrior
asked
Jul 3, 2016
Theory of Computation
theory-of-computation
regular-expression
isro2016
+
–
8
votes
2
answers
36
ISRO2016-32
AN FSM(finite state machine) can be considered to be a turing machine of finite tape length without rewinding capability and unidirectional tape movement rewinding capability and unidirectional tape movement without rewinding capability and bidirectional tape movement rewinding capability and bidirectional tape movement
AN FSM(finite state machine) can be considered to be a turing machine of finite tape lengthwithout rewinding capability and unidirectional tape movementrewinding capabili...
Desert_Warrior
8.3k
views
Desert_Warrior
asked
Jul 3, 2016
Theory of Computation
theory-of-computation
isro2016
turing-machine
+
–
11
votes
4
answers
37
ISRO2016-11
The dynamic hazard problem occurs in combinational circuit alone sequential circuit only Both (a) and (b) None of the above
The dynamic hazard problem occurs incombinational circuit alonesequential circuit onlyBoth (a) and (b)None of the above
Desert_Warrior
11.6k
views
Desert_Warrior
asked
Jul 3, 2016
Digital Logic
isro2016
digital-logic
digital-circuits
hazards
+
–
5
votes
2
answers
38
ISRO2016-80
When a DNS server accepts and uses incorrect information from a host that has no authority giving that information, then it is called DNS lookup DNS hijacking DNS spoofing None of the mentioned
When a DNS server accepts and uses incorrect information from a host that has no authority giving that information, then it is calledDNS lookupDNS hijackingDNS spoofingNo...
Desert_Warrior
6.4k
views
Desert_Warrior
asked
Jul 3, 2016
Computer Networks
isro2016
computer-networks
dns
+
–
5
votes
2
answers
39
ISRO2016-79
Which one of the following is correct about the statements given below? All function calls are resolved at compile time in C lang All function calls are resolved at compile time in C++ lang Only II is correct Both I and II are correct Only I is correct Both I and II are incorrect
Which one of the following is correct about the statements given below?All function calls are resolved at compile time in C langAll function calls are resolved at compile...
Desert_Warrior
6.4k
views
Desert_Warrior
asked
Jul 3, 2016
Programming in C
isro2016
programming-in-c
+
–
4
votes
2
answers
40
ISRO2016-78
If a class $C$ is derived from class $B$, which is derived form class $A$, all through public inheritance, then a class $C$ member function can access only protected and public data of $C$ and $B$ Only protected and public data of $C$ all data of $C$ and private data of $A$ and $B$ public and protected data of $A$ and $B$ and all data of $C$
If a class $C$ is derived from class $B$, which is derived form class $A$, all through public inheritance, then a class $C$ member function can accessonly protected and p...
Desert_Warrior
7.1k
views
Desert_Warrior
asked
Jul 3, 2016
Object Oriented Programming
non-gate
object-oriented-programming
isro2016
+
–
5
votes
3
answers
41
ISRO2016-70
Which network protocol allows hosts to dynamically get a unique IP number on each bootup DHCP BOOTP RARP ARP
Which network protocol allows hosts to dynamically get a unique IP number on each bootupDHCPBOOTPRARPARP
Desert_Warrior
4.6k
views
Desert_Warrior
asked
Jul 3, 2016
Computer Networks
isro2016
computer-networks
network-protocols
+
–
6
votes
2
answers
42
ISRO2016-69
In Ethernet CSMA/CD, the special bit sequence transmitted by media access management to handle collision is called Preamble Postamble Jam None of these
In Ethernet CSMA/CD, the special bit sequence transmitted by media access management to handle collision is calledPreamblePostambleJamNone of these
Desert_Warrior
5.2k
views
Desert_Warrior
asked
Jul 3, 2016
Computer Networks
computer-networks
csma-cd
isro2016
+
–
6
votes
4
answers
43
ISRO2016-68
Dynamic routing protocol enable routers to Dynamically discover and maintain routes Distribute routing updates to other routers Reach agreement with other routers about the network topology All of the above
Dynamic routing protocol enable routers toDynamically discover and maintain routesDistribute routing updates to other routersReach agreement with other routers about the ...
Desert_Warrior
4.3k
views
Desert_Warrior
asked
Jul 3, 2016
Computer Networks
isro2016
computer-networks
routing
+
–
7
votes
2
answers
44
ISRO2016-25
What will be output of the following program? Assume that you are running this program in little-endian processor. #include<stdio.h> int main() { short a=320; char *ptr; ptr=(char *)&a; printf("%d",*ptr); return 0; } 1 320 64 Compilation error
What will be output of the following program? Assume that you are running this program in little-endian processor.#include<stdio.h int main() { short a=320; char *ptr; pt...
sourav.
7.4k
views
sourav.
asked
Jul 3, 2016
Programming in C
programming-in-c
pointers
isro2016
little-endian-big-endian
+
–
6
votes
4
answers
45
ISRO2016-24
In which class of Flynn's taxanomy, Von Neumann architecture belongs to? SISD SIMD MIMD MISD
In which class of Flynn's taxanomy, Von Neumann architecture belongs to?SISDSIMDMIMDMISD
sourav.
9.7k
views
sourav.
asked
Jul 3, 2016
CO and Architecture
co-and-architecture
isro2016
instruction-format
+
–
9
votes
5
answers
46
ISRO2016-22
Let the page fault service time be $10$ ms in a computer with average memory access time being $20$ ns. If one page fault is generated for every $10^6$ memory accesses, what is the effective access time for the memory? 21.4 ns 29.9 ns 23.5 ns 35.1 ns
Let the page fault service time be $10$ ms in a computer with average memory access time being $20$ ns. If one page fault is generated for every $10^6$ memory accesses, w...
sourav.
6.4k
views
sourav.
asked
Jul 3, 2016
Operating System
operating-system
virtual-memory
paging
isro2016
+
–
4
votes
4
answers
47
ISRO2016-20
What is the output of this C code? #include<stdio.h> void main() { int k=5; int *p=&k; int **m=&p; printf("%d %d %d",k,*p,**m); } 5 5 5 5 5 junk 5 junk junk compile time error
What is the output of this C code?#include<stdio.h void main() { int k=5; int *p=&k; int m=&p; printf("%d %d %d",k,*p, m); }5 5 5 5 5 junk5 junk junkcompile time error
sourav.
4.0k
views
sourav.
asked
Jul 3, 2016
Programming in C
programming-in-c
pointers
isro2016
+
–
11
votes
6
answers
48
ISRO2016-19
Consider a non-pipelined processor with a clock rate of $2.5$ gigahertz and average cycles per instruction of four. The same processor is upgraded to a pipelined processor with five stages; but due to the internal pipeline delay, the clock speed is reduced to $2$ gigahertz. Assume ... no stalls in the pipeline. The speedup achieved in this pipelined processor is $3.2$ $3.0$ $2.2$ $2.0$
Consider a non-pipelined processor with a clock rate of $2.5$ gigahertz and average cycles per instruction of four. The same processor is upgraded to a pipelined processo...
sourav.
6.0k
views
sourav.
asked
Jul 3, 2016
CO and Architecture
co-and-architecture
pipelining
isro2016
+
–
4
votes
3
answers
49
ISRO2016-18
The functional difference between $SR$ flip-flop and $J$-$K$ flip-flop is that : $J$-$K$ flip-flop is faster than $SR$ flip-flop $J$-$K$ flip-flop has a feedback path $J$-$K$ flip-flop accepts both inputs $1$ None of them
The functional difference between $SR$ flip-flop and $J$-$K$ flip-flop is that :$J$-$K$ flip-flop is faster than $SR$ flip-flop$J$-$K$ flip-flop has a feedback path$J$-$K...
sourav.
6.2k
views
sourav.
asked
Jul 3, 2016
Digital Logic
digital-logic
flip-flop
isro2016
+
–
8
votes
2
answers
50
ISRO2016-17
Which of the following binary number is the same as its $2's$ complement ? $1010$ $0101$ $1000$ $1001$
Which of the following binary number is the same as its $2's$ complement ?$1010$$0101$$1000$$1001$
sourav.
11.4k
views
sourav.
asked
Jul 3, 2016
Digital Logic
digital-logic
number-representation
isro2016
+
–
5
votes
1
answer
51
ISRO2016-29
A Hash Function $f$ defined as $f(key)= key \mod 7$. With linear probing while inserting the keys $37,38,72,48,98,11,56$ into a table indexed from $0$, in which location key $11$ will be stored (Count table index $0$ as $0^{th}$ location)? 3 4 5 6
A Hash Function $f$ defined as $f(key)= key \mod 7$. With linear probing while inserting the keys $37,38,72,48,98,11,56$ into a table indexed from $0$, in which location ...
sh!va
4.8k
views
sh!va
asked
Jun 18, 2016
Algorithms
hashing
isro2016
linear-probing
+
–
12
votes
2
answers
52
ISRO2007-24, ISRO2016-67
Bit stuffing refers to inserting a $0$ in user stream to differentiate it with a flag inserting a $0$ in flag stream to avoid ambiguity appending a nipple to the flag sequence appending a nipple to the use data stream
Bit stuffing refers toinserting a $0$ in user stream to differentiate it with a flaginserting a $0$ in flag stream to avoid ambiguityappending a nipple to the flag sequen...
go_editor
9.7k
views
go_editor
asked
Jun 10, 2016
Computer Networks
isro2007
communication
isro2016
+
–
9
votes
1
answer
53
ISRO2016-7
The minimum number of $\text{NAND}$ gates required to implement the Boolean function $A + A\overline{B} + A\overline{B}C$ is equal to $0$ (Zero) $1$ $4$ $7$
The minimum number of $\text{NAND}$ gates required to implement the Boolean function $A + A\overline{B} + A\overline{B}C$ is equal to$0$ (Zero)$1$$4$$7$
neha singh
7.1k
views
neha singh
asked
Mar 25, 2016
Digital Logic
digital-logic
min-no-gates
isro2016
+
–
53
votes
8
answers
54
GATE IT 2004 | Question: 12, ISRO2016-77
Consider a system with $2$ level cache. Access times of Level $1$ cache, Level $2$ cache and main memory are $1$ $ns$, $10$ $ns$, and $500$ $ns$ respectively. The hit rates of Level $1$ and Level $2$ caches are $0.8$ and $0.9$, respectively. What is the average access time of the system ignoring the search time within the cache? $13.0$ $12.8$ $12.6$ $12.4$
Consider a system with $2$ level cache. Access times of Level $1$ cache, Level $2$ cache and main memory are $1$ $ns$, $10$ $ns$, and $500$ $ns$ respectively. The hit rat...
Ishrat Jahan
29.3k
views
Ishrat Jahan
asked
Nov 1, 2014
CO and Architecture
gateit-2004
co-and-architecture
cache-memory
normal
isro2016
+
–
5
votes
2
answers
55
GATE IT 2007 | Question: 4, ISRO2016-66
In the Spiral model of software development, the primary determinant in selecting activities in each iteration is Iteration size Cost Adopted process such as Rational Unified Process or Extreme Programming Risk
In the Spiral model of software development, the primary determinant in selecting activities in each iteration isIteration sizeCostAdopted process such as Rational Unifie...
Ishrat Jahan
6.2k
views
Ishrat Jahan
asked
Oct 29, 2014
IS&Software Engineering
gateit-2007
is&software-engineering
spiral-model
normal
isro2016
+
–
4
votes
3
answers
56
GATE IT 2008 | Question: 19, ISRO2016-76
Which of the following is TRUE only of XML but NOT HTML? It is derived from SGML It describes content and layout It allows user defined tags It is restricted only to be used with web browsers
Which of the following is TRUE only of XML but NOT HTML?It is derived from SGMLIt describes content and layoutIt allows user defined tagsIt is restricted only to be used ...
Ishrat Jahan
4.0k
views
Ishrat Jahan
asked
Oct 27, 2014
Web Technologies
gateit-2008
web-technologies
html
normal
isro2016
+
–
55
votes
8
answers
57
GATE CSE 1996 | Question: 2.13, ISRO2016-28
The average number of key comparisons required for a successful search for sequential search on $n$ items is $\frac{n}{2}$ $\frac{n-1}{2}$ $\frac{n+1}{2}$ None of the above
The average number of key comparisons required for a successful search for sequential search on $n$ items is$\frac{n}{2}$$\frac{n-1}{2}$$\frac{n+1}{2}$None of the above
Kathleen
31.4k
views
Kathleen
asked
Oct 9, 2014
Algorithms
gate1996
algorithms
easy
isro2016
searching
+
–
35
votes
6
answers
58
GATE CSE 1996 | Question: 1.16, ISRO2016-42
Relative mode of addressing is most relevant to writing: Co – routines Position – independent code Shareable code Interrupt Handlers
Relative mode of addressing is most relevant to writing:Co – routinesPosition – independent codeShareable codeInterrupt Handlers
Kathleen
12.5k
views
Kathleen
asked
Oct 9, 2014
CO and Architecture
gate1996
co-and-architecture
addressing-modes
easy
isro2016
+
–
21
votes
7
answers
59
GATE CSE 1994 | Question: 1.19, ISRO2016-31
Algorithm design technique used in quicksort algorithm is? Dynamic programming Backtracking Divide and conquer Greedy method
Algorithm design technique used in quicksort algorithm is?Dynamic programmingBacktrackingDivide and conquerGreedy method
Kathleen
18.3k
views
Kathleen
asked
Oct 4, 2014
Algorithms
gate1994
algorithms
algorithm-design-technique
quick-sort
easy
isro2016
+
–
31
votes
2
answers
60
GATE CSE 1997 | Question: 6.10, ISRO2016-54
Let $R (a, b, c)$ and $S(d, e, f)$ be two relations in which $d$ is the foreign key of $S$ that refers to the primary key of $R$. Consider the following four operations $R$ and $S$ Insert into $R$ Insert ... Which of the following can cause violation of the referential integrity constraint above? Both I and IV Both II and III All of these None of these
Let $R (a, b, c)$ and $S(d, e, f)$ be two relations in which $d$ is the foreign key of $S$ that refers to the primary key of $R$. Consider the following four operations $...
Kathleen
10.0k
views
Kathleen
asked
Sep 29, 2014
Databases
gate1997
databases
referential-integrity
easy
isro2016
+
–
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register