Register
all the questions of ISRO 2020 question paper

Recent questions tagged isro-2020

3 votes
3 answers
31
ISRO2020-52
To send same bit sequence, $\text{NRZ}$ encoding require Same clock frequency as Manchester encoding Half the clock frequency as Manchester encoding Twice the clock frequency as Manchester encoding A clock frequency which depend on number of zeroes and ones in the bit sequence
To send same bit sequence, $\text{NRZ}$ encoding requireSame clock frequency as Manchester encodingHalf the clock frequency as Manchester encodingTwice the clock frequenc...
User Avatar
5 votes
12 answers
33
ISRO2020-50
If every non-key attribute functionally dependent on the primary key, then the relation will be in First normal form Second normal form Third normal form Fourth Normal form
If every non-key attribute functionally dependent on the primary key, then the relation will be inFirst normal formSecond normal formThird normal formFourth Normal form
User Avatar
2 votes
1 answer
34
ISRO2020-49
One instruction tries to write an operand before it is written by previous instruction. This may lead to a dependency called True dependency Anti-dependency Output dependency Control Hazard
One instruction tries to write an operand before it is written by previous instruction. This may lead to a dependency calledTrue dependencyAnti-dependencyOutput dependenc...
User Avatar
4 votes
1 answer
35
ISRO2020-80
A new flipflop with inputs $X$ and $Y$ ... $(X\wedge \overline{Q })\vee (Y \wedge Q)$ $(X\wedge \overline{Q })\vee (\overline{Y } \wedge Q)$
A new flipflop with inputs $X$ and $Y$, has the following property$$\begin{array}{|c|c|c|}\hline \bf{X}& \bf{Y}& \bf{Current\ state}&\bf{ Next\ state} \\\hline 0&0&Q&...
User Avatar
5 votes
4 answers
38
ISRO2020-14
In a two-pass assembler, resolution of subroutine calls and inclusion of labels in the symbol table is done during second pass first pass and second pass respectively second pass and first pass respectively first pass
In a two-pass assembler, resolution of subroutine calls and inclusion of labels in the symbol table is done duringsecond passfirst pass and second pass respectivelysecond...
User Avatar
3 votes
3 answers
39
ISRO2020-13
The number of tokens in the following C code segment is switch(inputvalue) { case 1 : b =c*d; break; default : b =b++; break; } $27$ $29$ $26$ $24$
The number of tokens in the following C code segment isswitch(inputvalue) { case 1 : b =c*d; break; default : b =b++; break; }$27$$29$$26$$24$
User Avatar
8 votes
3 answers
40
ISRO2020-12
If $ABCD$ is a $4$-bit binary number, then what is the code generated by the following circuit? BCD code Gray code $8421$ code Excess-$3$ code
If $ABCD$ is a $4$-bit binary number, then what is the code generated by the following circuit?BCD codeGray code$8421$ codeExcess-$3$ code
User Avatar
6 votes
2 answers
41
ISRO2020-11
Minimum number of NAND gates required to implement the following binary equation $Y = (\overline{A}+\overline{B})(C+D)$ $4$ $5$ $3$ $6$
Minimum number of NAND gates required to implement the following binary equation$Y = (\overline{A}+\overline{B})(C+D)$$4$$5$$3$$6$
User Avatar
10 votes
3 answers
42
ISRO2020-36
What is the complexity of the following code? sum=0; for(i=1;i<=n;i*=2) for(j=1;j<=n;j++) sum++; Which of the following is not a valid string? $O(n^2)$ $O(n\log\ n)$ $O(n)$ $O(n\log\ n\log\ n)$
What is the complexity of the following code?sum=0; for(i=1;i<=n;i*=2) for(j=1;j<=n;j++) sum++;Which of the following is not a valid string?$O(n^2)$$O(n\log\ n)$$O(n)$$O(...
User Avatar
5 votes
2 answers
44
ISRO2020-34
Huffman tree is constructed for the following data :$\{A,B,C,D,E\}$ with frequency $\{0.17,0.11,0.24,0.33\ \text{and} \ 0.15 \}$ respectively. $100\ 00\ 01101$ is decoded as $BACE$ $CADE$ $BAD$ $CADD$
Huffman tree is constructed for the following data :$\{A,B,C,D,E\}$ with frequency $\{0.17,0.11,0.24,0.33\ \text{and} \ 0.15 \}$ respectively. $100\ 00\ 01101$ is decoded...
User Avatar
5 votes
5 answers
45
ISRO2020-33
If an array $A$ contains the items $10,4,7,23,67,12$ and $5$ in that order, what will be the resultant array $A$ after third pass of insertion sort? $67,12,10,5,4,7,23$ $4,7,10,23,67,12,5$ $4,5,7,67,10,12,23$ $10,7,4,67,23,12,5$
If an array $A$ contains the items $10,4,7,23,67,12$ and $5$ in that order, what will be the resultant array $A$ after third pass of insertion sort?$67,12,10,5,4,7,23$$4,...
User Avatar
6 votes
3 answers
47
ISRO2020-71
Of the following, which best approximates the ratio of the number of nonterminal nodes in the total number of nodes in a complete $K$-ary tree of depth $N$ ? $1/N$ $N-1/N$ $1/K$ $K-1/K$
Of the following, which best approximates the ratio of the number of nonterminal nodes in the total number of nodes in a complete $K$-ary tree of depth $N$ ?$1/N$$N-1/N$$...
User Avatar
3 votes
1 answer
48
ISRO2020-70
In a class definition with $10$ methods, to make the class maximally cohesive, number of direct and indirect connections required among the methods are $90,0$ $45,0$ $10,10$ $45,45$
In a class definition with $10$ methods, to make the class maximally cohesive, number of direct and indirect connections required among the methods are$90,0$$45,0$$10,10$...
User Avatar
4 votes
3 answers
50
ISRO2020-4
Convert the pre-fix expression to in-fix $- ^{\ast} +ABC^{\ast} – DE+FG$ $(A-B)^{\ast}C+(D^{\ast}E)-(F+G)$ $(A+B)^{\ast}C-(D-E)^{\ast}(F+G)$ $(A+B-C)^{\ast}(D-E)^{\ast}(F+G)$ $(A+B)^{\ast}C-(D^{\ast}E)-(F+G)$
Convert the pre-fix expression to in-fix $- ^{\ast} +ABC^{\ast} – DE+FG$$(A-B)^{\ast}C+(D^{\ast}E)-(F+G)$$(A+B)^{\ast}C-(D-E)^{\ast}(F+G)$$(A+B-C)^{\ast}(D-E)^{\ast}(F+...
User Avatar
2 votes
1 answer
51
ISRO2020-3
Which of the following affects the processing power assuming they do not influence each other Data bus capability Address scheme Clock speed $3$ only $1$ and $3$ only $2$ and $3$ only $1,2$ and $3$
Which of the following affects the processing power assuming they do not influence each otherData bus capabilityAddress schemeClock speed$3$ only$1$ and $3$ only$2$ and $...
User Avatar
1 votes
1 answer
54
ISRO2020-22
Raymonds tree based algorithm ensures no starvation, but deadlock may occur in rare cases no deadlock, but starvation may occur neither deadlock nor starvation can occur deadlock may occur in cases where the process is already starved
Raymonds tree based algorithm ensuresno starvation, but deadlock may occur in rare casesno deadlock, but starvation may occurneither deadlock nor starvation can occurdead...
User Avatar
3 votes
2 answers
55
ISRO2020-21
The master theorem assumes the subproblems are unequal sizes can be used if the subproblems are of equal size cannot be used for divide and conquer algorithms cannot be used for asymptotic complexity analysis
The master theoremassumes the subproblems are unequal sizescan be used if the subproblems are of equal sizecannot be used for divide and conquer algorithmscannot be used ...
User Avatar
5 votes
3 answers
56
ISRO2020-20
The minimum height of an AVL tree with $n$ nodes is $\text{Ceil } (\log_2(n+1))$ $1.44\ \log_2n$ $\text{Floor } (\log_2(n+1))$ $1.64\ \log_2n$
The minimum height of an AVL tree with $n$ nodes is$\text{Ceil } (\log_2(n+1))$$1.44\ \log_2n$$\text{Floor } (\log_2(n+1))$$1.64\ \log_2n$
User Avatar
2 votes
3 answers
57
ISRO2020-19
What is the in-order successor of $15$ in the given binary search tree? $18$ $6$ $17$ $20$
What is the in-order successor of $15$ in the given binary search tree?$18$$6$$17$$20$
User Avatar
Page: