Register

Recent questions tagged nielit2017oct-assistanta-it

411
views
0 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section D: 1
Twelve $1\;\Omega$ resistances are used as edges to from a cube. The resistance between two diagonally opposite corners of the cube is$\frac{5}{6}\;\Omega$\frac{1}{6}\;\Omega$\frac{6}{5}\;\Omega$\frac{3}{2}\;\Omega$
User Avatar
435
views
0 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section D: 6
A solution for the differential equation $x’(t) + 2x(t) = \delta(t)$ with initial condition $x(\overline{0}) = 0$e^{-2t}u(t)$e^{2t}u(t)$e^{-t}u(t)$e^{t}u(t)$
User Avatar
1.0k
views
4 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section D: 10
A $4$ bit ripple counter and a $4$ bit synchronous counter are made using flip-flops having a propagation delay of $10$ ns each. If the worst case delay in the ripple counter and the ... $S = 30$ ns$R = 30$ ns, $S = 10$ ns
User Avatar
479
views
0 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section D: 11
In MOSFET fabrication, the channel; length is defined during the process ofIsolation oxide growthChannel stop implantationPoly-silicon gate patterningLithography step leading to the contact pad
User Avatar
1.0k
views
1 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 1
The question is based on the following program fragment.f(intY[10],int x){ int u,j,k; i=0;j=9; do{ k=(i+j)/2; if(Y[k] < x) i=k; else j=k; } while((Y[k]!=x) && (i<j)) ... $[2\;4\;6\;8\;10\;12\;14\;16\;18\;20]$ and $2<x<20$ and $'x'$ is even
User Avatar
996
views
1 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 2
An algorithm is made up pf two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then the order of algorithm is$max(f(n),g(n))$min(f(n),g(n))$f(n) + g(n)$f(n) \times g(n)$
User Avatar
1.4k
views
1 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 3
By open domain CASE tools we meantools available in open domainsoftware packages which can be downloaded from the internetsoftware packages to aid each phase of ... can be downloaded free of cost from the internetsource codes of CASE tools
User Avatar
794
views
2 answers
1 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 4
Bit stuffing refers toInserting a $’0’$ in user data stream to differentiate it with a flagInserting a $’0’$ in flag stream to avoid ambiguityAppending a nibble to the flag sequenceAppending a nibble to the user data stream
User Avatar
1.0k
views
2 answers
1 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 5
Assume transaction $A$ holds a shared lock $R.$ If transaction $B$ also requests for a shared lock on $R.$ It willresult in deadlock situationimmediately be grantedimmediately be rejectedbe granted as soon as it is released by $A$
User Avatar
757
views
0 answers
1 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 6
Given relations $R(w,x)$ and $S(y,z),$ the result of SELECT DISTINCT $w,x$ from $R,S$R$ has no duplicates and $S$ is non-empty$R$ and $S$ have no duplicates$S$ has no duplicates and $R$ is non-empty$R$ and $S$ has the same number of tuples
User Avatar
800
views
1 answers
1 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 7
A decimal has $25$ digits. The number of bits needed for its equivalent binary representation is approximately$50$74$40$60$
User Avatar
1.7k
views
1 answers
3 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 8
Match list $I$ with List $II$ ... , C-iv, D-iA-ii, B-iii, C-i, D-ivA-i, B-iv, C-ii, D-iii
User Avatar
653
views
1 answers
1 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 9
Which of the following definitions generates the same languages as $L,$ where$L = \{x^{n}y^{n},n \geq 1\}$E \rightarrow xEy \mid xy$xy \mid x^{+}xyy^{+}$x^{+}y^{+}$ $(i)$ Only$(i)$ and $(ii)$ only$(ii)$ and $(iii)$ only$(ii)$ only
User Avatar
1.8k
views
2 answers
2 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 10
The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ records per page, with $1$ free main memory frame is recorded as ... $6,4$7,2$4,6$
User Avatar
1.1k
views
1 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 11
If the channel is band limited to $6\;kHz$ and signal to noise ratio is $16,$ what would be the capacity of channel?$16.15$ kbps$23.24$ kbps$40.12$ kbps$24.74$ kbps
User Avatar
279
views
0 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 12
At $100\%$ modulation, the power in each sideband is _______ of that of carrier.$50\%$40\%$60\%$25\%$
User Avatar
883
views
2 answers
1 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 1
What will be the output of following?main() { Static int a = 3; Printf(“%d”,a--); If(a) main(); }$3$3\;2\;1$3\;3\;3$Program will fall in continuous loop and print $3$
User Avatar
1.1k
views
1 answers
2 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 2
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number number of nodes in a binary tree of height $h$ is $2^{h}$2^{h-1} – 1$2^{h+1} – 1$2^{h+1}$
User Avatar
1.7k
views
1 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 3
Web links are stored within the page itself and when you wish to ‘jump’ to the page that is linked, we select the hotspot or anchor. This technique is calledHypertextHypermediaBoth $(A)$ and $(B)$Anchoring
User Avatar
1.5k
views
1 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 4
If the objects focus on the problem domain, then we are concerned withObject Oriented AnalysisObject Oriented DesignObject Oriented Analysis and DesignNone of the above
User Avatar
704
views
1 answers
2 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 5
Which of the following is not a form of main memory?Instruction cacheInstruction registerInstruction opcodeTranslation look-aside buffer
User Avatar
730
views
2 answers
1 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 6
Which of the following is useful in traversing a given graph by breadth first search?StackSetListQueue
User Avatar
635
views
1 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 7
$M$ is a square matrix of order $’n’$ and its determinant value is $5.$ If all the elements of $M$ are multiplied by $2,$ its determinant value becomes $40.$ The value of $’n’$ is$2$3$5$4$
User Avatar
1.0k
views
1 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 8
Is null an object?YesNoSometimes yesNone of these
User Avatar
3.5k
views
2 answers
3 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 9
Which of the following scheduling algorithms could result in starvation?PriorityRound RobinFCFSNone of the above
User Avatar
1.4k
views
1 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 10
Which of the following is a desirable property of module?IndependencyLow cohesivenessHigh CouplingMultifunctional
User Avatar
4.0k
views
1 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 11
Which of these events will be generated if we close an applet’s window?ActionEventComponentEventAdjustmentEventWindowEvent
User Avatar
4.0k
views
2 answers
1 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 12
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?$O(n),O(n)$O(n),O(1)$O(1),O(n)$O(1),O(1)$
User Avatar
581
views
0 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 13
The following program fragment printsint i = 5; do { putchar(i+100); printf(“%d”, i--;) } while(i);i5h4g3f2el14h3g2f1e0An error messageNone of the above
User Avatar
934
views
0 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 14
The running time of an algorithm $T(n),$ where $’n’$ is the input size , is given by$T(n) = 8T(n/2) + qn,$ if $n>1$ $= p,$ if $n = 1$Where $p,q$ are constants. The order of this algorithm is$n^{2}$n^{n}$n^{3}$n$
User Avatar
Page: