Register
Filter

Answers by `JEET

1 votes
31
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$$...
5 votes
33
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+...
0 votes
36
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...
4 votes
37
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 ...
3 votes
38
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$
3 votes
39
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$
0 votes
41
ISRO2020-75
A grammar is defined as $A \rightarrow BC$ $B \rightarrow x \mid Bx$ $C \rightarrow B \mid D$ $D \rightarrow y \mid Ey$ $E \rightarrow z$ The non terminal alphabet of the grammar is $\{A,B,C,D,E\}$ $\{B,C,D,E\}$ $\{A,B,C,D,E,x,y,z\}$ $\{x,y,z\}$
A grammar is defined as$A \rightarrow BC$$B \rightarrow x \mid Bx$$C \rightarrow B \mid D$$D \rightarrow y \mid Ey$$E \rightarrow z$The non terminal alphabet of the gram...
5 votes
44
ISRO2020-25
What is compaction refers to a technique for overcoming internal fragmentation a paging technique a technique for overcoming external fragmentation a technique for compressing the data
What is compaction refers toa technique for overcoming internal fragmentationa paging techniquea technique for overcoming external fragmentationa technique for compressin...
3 votes
45
ISRO2020-65
Of the following sort algorithms, which has execution time that is least dependant on initial ordering of the input? Insertion sort Quick sort Merge sort Selection sort
Of the following sort algorithms, which has execution time that is least dependant on initial ordering of the input?Insertion sortQuick sortMerge sortSelection sort
0 votes
46
ISRO2020-29
An aid to determine the deadlock occurrence is resource allocation graph starvation graph inversion graph none of the above
An aid to determine the deadlock occurrence isresource allocation graphstarvation graphinversion graphnone of the above
2 votes
48
ISRO2020-27
Which of the following algorithms defines time quantum? shortest job scheduling algorithm round robin scheduling algorithm priority scheduling algorithm multilevel queue scheduling algorithm
Which of the following algorithms defines time quantum?shortest job scheduling algorithmround robin scheduling algorithmpriority scheduling algorithmmultilevel queue sche...
14 votes
50
ISRO2020-62
What is output of the following ‘C’ code assuming it runs on a byte addressed little endian machine? #include<stdio.h> int main() { int x; char *ptr; x=622,100,101; printf("%d",(*(char *)&x)*(x%3)); return 0; } $622$ $311$ $22$ $110$
What is output of the following ‘C’ code assuming it runs on a byte addressed little endian machine?#include<stdio.h int main() { int x; char *ptr; x=622,100,101; pri...
5 votes
51
ISRO2011-40
Consider the following pseudocode x:=1; i:=1; while ( x <= 500) begin x:=2^x; i:=i+1; end What is the value of $\textsf{i}$ at the end of the pseudocode? $4$ $5$ $6$ $7$
Consider the following pseudocodex:=1; i:=1; while ( x <= 500) begin x:=2^x; i:=i+1; endWhat is the value of $\textsf{i}$ at the end of the pseudocode?$4$$5$$6$$7$
1 votes
53
ISRO2008-48
Which of the following is termed as minimum error code ? Binary code Gray code Excess-$3$ code Octal code
Which of the following is termed as minimum error code ?Binary codeGray codeExcess-$3$ codeOctal code
0 votes
54
ISRO2008-74
A Steiner patch is Biquadratic Bezeir patch Bicubic patch Circular patch only Bilinear Bezier patch
A Steiner patch isBiquadratic Bezeir patchBicubic patchCircular patch onlyBilinear Bezier patch
1 votes
55
ISI2015-DCG-2
Let $S=\{6, 10, 7, 13, 5, 12, 8, 11, 9\}$ and $a=\underset{x \in S}{\Sigma} (x-9)^2$ & $b = \underset{x \in S}{\Sigma} (x-10)^2$. Then $a <b$ $a>b$ $a=b$ None of these
Let $S=\{6, 10, 7, 13, 5, 12, 8, 11, 9\}$ and $a=\underset{x \in S}{\Sigma} (x-9)^2$ & $b = \underset{x \in S}{\Sigma} (x-10)^2$. Then$a <b$$a>b$$a=b$None of these
2 votes
60
ISRO2018-75
ln neural network, the network capacity is defined as: The traffic (tarry capacity of the network The total number of nodes in the network The number of patterns that can be stored and recalled in a network None of the above
ln neural network, the network capacity is defined as:The traffic (tarry capacity of the networkThe total number of nodes in the networkThe number of patterns that can be...
Page: