Register

Recent questions tagged nielit2017oct-assistanta-it

0 votes
0 answers
1
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$
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}\;\...
User Avatar
0 votes
0 answers
2
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)$
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
0 votes
0 answers
4
NIELIT 2017 OCT Scientific Assistant A (IT) - Section D: 11
In MOSFET fabrication, the channel; length is defined during the process of Isolation oxide growth Channel stop implantation Poly-silicon gate patterning Lithography step leading to the contact pad
In MOSFET fabrication, the channel; length is defined during the process ofIsolation oxide growthChannel stop implantationPoly-silicon gate patterningLithography step lea...
User Avatar
0 votes
1 answer
6
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)$
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) + ...
User Avatar
1 votes
1 answer
11
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$
A decimal has $25$ digits. The number of bits needed for its equivalent binary representation is approximately$50$$74$$40$$60$
User Avatar
3 votes
1 answer
12
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 8
Match list $I$ with List $II$ ... iii, D-iv A-iii, B-ii, C-iv, D-i A-ii, B-iii, C-i, D-iv A-i, B-iv, C-ii, D-iii
Match list $I$ with List $II$ and select the correct answer using the codes given below the lists :$${\begin{array}{|c|c|c|}\hline&\textbf{List I} & & \textbf{List II}\\\...
User Avatar
0 votes
1 answer
15
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
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
0 votes
0 answers
16
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\%$
At $100\%$ modulation, the power in each sideband is _______ of that of carrier.$50\%$$40\%$$60\%$$25\%$
User Avatar
2 votes
1 answer
18
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}$
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} ...
User Avatar
0 votes
1 answer
19
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 called Hypertext Hypermedia Both $(A)$ and $(B)$ Anchoring
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 calledHypertext...
User Avatar
0 votes
1 answer
20
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 4
If the objects focus on the problem domain, then we are concerned with Object Oriented Analysis Object Oriented Design Object Oriented Analysis and Design None of the above
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
2 votes
1 answer
21
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 5
Which of the following is not a form of main memory? Instruction cache Instruction register Instruction opcode Translation look-aside buffer
Which of the following is not a form of main memory?Instruction cacheInstruction registerInstruction opcodeTranslation look-aside buffer
User Avatar
1 votes
2 answers
22
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? Stack Set List Queue
Which of the following is useful in traversing a given graph by breadth first search?StackSetListQueue
User Avatar
0 votes
1 answer
23
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$
$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 valu...
User Avatar
0 votes
1 answer
24
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 8
Is null an object? Yes No Sometimes yes None of these
Is null an object?YesNoSometimes yesNone of these
User Avatar
3 votes
2 answers
25
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 9
Which of the following scheduling algorithms could result in starvation? Priority Round Robin FCFS None of the above
Which of the following scheduling algorithms could result in starvation?PriorityRound RobinFCFSNone of the above
User Avatar
0 votes
1 answer
27
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 11
Which of these events will be generated if we close an applet’s window? ActionEvent ComponentEvent AdjustmentEvent WindowEvent
Which of these events will be generated if we close an applet’s window?ActionEventComponentEventAdjustmentEventWindowEvent
User Avatar
1 votes
2 answers
28
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)$
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
0 votes
0 answers
29
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 13
The following program fragment prints int i = 5; do { putchar(i+100); printf(“%d”, i--;) } while(i); i5h4g3f2el 14h3g2f1e0 An error message None of the above
The following program fragment printsint i = 5; do { putchar(i+100); printf(“%d”, i ;) } while(i);i5h4g3f2el14h3g2f1e0An error messageNone of the above
User Avatar
Page: