# Recent questions tagged nielit2017oct-assistanta-it 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$
2
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)$
1 vote
3
A sequential circuit using D flip-flop and logic gates is shown in Figure, where $X$ and $Y$ are the inputs and $Z$ is the output. The circuit is $\text{S-R}$ Flip-flop with inputs $X = R$ and $Y=S$ $\text{S-R}$ Flip-flop with inputs $X = S$ and $Y=R$ $\text{J-K}$ Flip-flop with inputs $X = J$ and $Y=K$ $\text{J-K}$ Flip-flop with inputs $X = K$ and $Y=J$
4
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 synchronous counter be $R$ and $S$ respectively, then $R = 10$ ns, $S = 40$ ns $R = 40$ ns, $S = 10$ ns $R = 10$ ns, $S = 30$ ns $R = 30$ ns, $S = 10$ ns
5
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
6
The question is based on the following program fragment. f(intY,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)); if (Y[k]==x) printf( x is in the array. ); else printf( x is not in the array. ); } On which of the following contents of ... $x>2$ $Y$ is $[2\;4\;6\;8\;10\;12\;14\;16\;18\;20]$ and $2<x<20$ and $'x'$ is even
7
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)$
8
By open domain CASE tools we mean tools available in open domain software packages which can be downloaded from the internet software packages to aid each phase of the systems analysis and design which can be downloaded free of cost from the internet source codes of CASE tools
9
Bit stuffing refers to Inserting a $’0’$ in user data stream to differentiate it with a flag Inserting a $’0’$ in flag stream to avoid ambiguity Appending a nibble to the flag sequence Appending a nibble to the user data stream
1 vote
10
Assume transaction $A$ holds a shared lock $R.$ If transaction $B$ also requests for a shared lock on $R.$ It will result in deadlock situation immediately be granted immediately be rejected be granted as soon as it is released by $A$
1 vote
11
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
1 vote
12
A decimal has $25$ digits. The number of bits needed for its equivalent binary representation is approximately $50$ $74$ $40$ $60$
13
Match list $I$ with List $II$ ... A-i, B-ii, C-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
1 vote
14
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
15
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 follows. What is the number of Page Faults? $0100,0200,0430,0499,0510,0530,0560,0120,0220,0240,0260,0320,0370.$ $15,4$ $6,4$ $7,2$ $4,6$
16
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
17
At $100\%$ modulation, the power in each sideband is _______ of that of carrier. $50\%$ $40\%$ $60\%$ $25\%$
18
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$
19
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}$
20
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
21
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
22
Which of the following is not a form of main memory? Instruction cache Instruction register Instruction opcode Translation look-aside buffer
23
Which of the following is useful in traversing a given graph by breadth first search? Stack Set List Queue
24
$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$
25
Is null an object? Yes No Sometimes yes None of these
26
Which of the following scheduling algorithms could result in starvation? Priority Round Robin FCFS None of the above
27
Which of the following is a desirable property of module? Independency Low cohesiveness High Coupling Multifunctional
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)$