ISRO 2016 Computer Science Questions with solution

Recent questions tagged isro2016

5 votes
3 answers
31
The extent to which the s/w can continue to operate correctly despite the introduction of invalid inputs is called asReliabilityRobustnessFault tolerancePortability
2 votes
2 answers
32
Which one of the following is a functional requirement ?MaintainabilityPortabilityRobustnessNone of the mentioned
5 votes
2 answers
34
Access time of the symbolic table will be logarithmic if it is implemented byLinear listSearch treeHash tableSelf organization list
11 votes
4 answers
37
The dynamic hazard problem occurs incombinational circuit alonesequential circuit onlyBoth (a) and (b)None of the above
5 votes
2 answers
38
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...
5 votes
3 answers
41
Which network protocol allows hosts to dynamically get a unique IP number on each bootupDHCPBOOTPRARPARP
6 votes
2 answers
42
In Ethernet CSMA/CD, the special bit sequence transmitted by media access management to handle collision is calledPreamblePostambleJamNone of these
6 votes
4 answers
43
Dynamic routing protocol enable routers toDynamically discover and maintain routesDistribute routing updates to other routersReach agreement with other routers about the ...
7 votes
2 answers
44
6 votes
4 answers
45
In which class of Flynn's taxanomy, Von Neumann architecture belongs to?SISDSIMDMIMDMISD
9 votes
5 answers
46
4 votes
4 answers
47
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
4 votes
3 answers
49
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...
8 votes
2 answers
50
Which of the following binary number is the same as its $2's$ complement ?$1010$$0101$$1000$$1001$
5 votes
1 answer
51
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 ...
12 votes
2 answers
52
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...
9 votes
1 answer
53
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$
5 votes
2 answers
55
4 votes
3 answers
56
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 ...
55 votes
8 answers
57
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
35 votes
6 answers
58
21 votes
7 answers
59