search
Log In

Recent questions tagged nielit2017oct-assistanta-it

0 votes
0 answers
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$
asked Aug 28, 2020 in Digital Signal Processing Lakshman Patel RJIT 80 views
0 votes
0 answers
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)$
asked Aug 28, 2020 in Calculus Lakshman Patel RJIT 68 views
1 vote
1 answer
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$
asked Aug 28, 2020 in Digital Logic Lakshman Patel RJIT 739 views
0 votes
3 answers
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
asked Aug 28, 2020 in Digital Logic Lakshman Patel RJIT 256 views
0 votes
0 answers
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
asked Aug 28, 2020 in Digital Signal Processing Lakshman Patel RJIT 49 views
0 votes
1 answer
6
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)); 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
asked Apr 1, 2020 in Programming Lakshman Patel RJIT 406 views
0 votes
1 answer
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)$
asked Apr 1, 2020 in Algorithms Lakshman Patel RJIT 327 views
0 votes
1 answer
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
asked Apr 1, 2020 in IS&Software Engineering Lakshman Patel RJIT 257 views
0 votes
2 answers
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
asked Apr 1, 2020 in Computer Networks Lakshman Patel RJIT 269 views
1 vote
2 answers
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$
asked Apr 1, 2020 in Databases Lakshman Patel RJIT 318 views
1 vote
1 answer
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
asked Apr 1, 2020 in Databases Lakshman Patel RJIT 212 views
1 vote
1 answer
12
1 vote
2 answers
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
asked Apr 1, 2020 in Theory of Computation Lakshman Patel RJIT 227 views
2 votes
2 answers
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$
asked Apr 1, 2020 in Operating System Lakshman Patel RJIT 219 views
0 votes
2 answers
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
asked Apr 1, 2020 in Others Lakshman Patel RJIT 121 views
0 votes
1 answer
17
0 votes
1 answer
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$
asked Apr 1, 2020 in Programming Lakshman Patel RJIT 254 views
0 votes
1 answer
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}$
asked Apr 1, 2020 in DS Lakshman Patel RJIT 367 views
0 votes
1 answer
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
asked Apr 1, 2020 in Web Technologies Lakshman Patel RJIT 163 views
0 votes
1 answer
21
0 votes
2 answers
23
0 votes
1 answer
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$
asked Apr 1, 2020 in Linear Algebra Lakshman Patel RJIT 145 views
0 votes
1 answer
28
0 votes
1 answer
29
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)$
asked Apr 1, 2020 in DS Lakshman Patel RJIT 266 views
0 votes
1 answer
30
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
asked Apr 1, 2020 in Programming Lakshman Patel RJIT 166 views
...