Register

Recent questions tagged nielit-2018

2 votes
3 answers
61
NIELIT 2018-61
The ALU uses _____ to store intermediate result Cache Registers Accumulators Stack
The ALU uses _____ to store intermediate resultCacheRegistersAccumulatorsStack
User Avatar
0 votes
2 answers
62
NIELIT 2018-62
Among all given option, ____ must reside in the main memory. Assembler Compiler Linker Loader
Among all given option, ____ must reside in the main memory.AssemblerCompilerLinkerLoader
User Avatar
0 votes
2 answers
63
NIELIT 2018-63
Identify the true statement from the given statements. Lossless, dependency-preserving Decompositoin into $3$ NF is always possible Any relation with two attributes is BCNF $1$ $2$ $1$ and $2$ None of these
Identify the true statement from the given statements.Lossless, dependency-preserving Decompositoin into $3$ NF is always possibleAny relation with two attributes is BCNF...
User Avatar
1 votes
2 answers
64
NIELIT 2018-64
Which of the following code replacements is an example of operator strength reduction? Replace $ \text{P^2} $ by $P^*P$ Replace $ P^*16$ by $P<<4$ Replace $ \text{pow}(P,3) $ by $P^*P^*P$ Replace $ (P <<5) -P $ by $P^*3$
Which of the following code replacements is an example of operator strength reduction?Replace $ \text{P^2} $ by $P^*P$Replace $ P^*16$ by $P<<4$Replace $ \text{pow}(P,3) ...
User Avatar
1 votes
2 answers
65
NIELIT 2018-65
For a given hash table $T$ with $10$ slots that stores $1000$ elements, the load factor $\alpha$ for $T$ is $100$ $0.01$ $200$ $1.05$
For a given hash table $T$ with $10$ slots that stores $1000$ elements, the load factor $\alpha$ for $T$ is$100$$0.01$$200$$1.05$
User Avatar
4 votes
2 answers
66
NIELIT 2018-66
____ number of gates are required to implement the Boolean function $(AB+C)$ with using only $2$-input NOR gates. $2$ $3$ $4$ $5$
____ number of gates are required to implement the Boolean function $(AB+C)$ with using only $2$-input NOR gates.$2$$3$$4$$5$
User Avatar
1 votes
1 answer
67
NIELIT 2018-67
____ is the worst-case time complexity for all operations (i.e.,) search, update and delete) in a general Binary Search tree $O(n)$ $O(n \log n)$ $O( \log n)$ for search and insert, and $O(n)$ for delete None of these
____ is the worst-case time complexity for all operations (i.e.,) search, update and delete) in a general Binary Search tree$O(n)$$O(n \log n)$$O( \log n)$ for search and...
User Avatar
3 votes
3 answers
68
NIELIT 2018-68
_____ IP address can be used in WAN $256.0.0.1$ $172.16.0.10$ $15.1.5.6$ $127.256.0.1$
_____ IP address can be used in WAN$256.0.0.1$$172.16.0.10$$15.1.5.6$$127.256.0.1$
User Avatar
2 votes
3 answers
69
NIELIT 2018-69
____ number of queues are needed to implement a stack $1$ $2$ $3$ $4$
____ number of queues are needed to implement a stack$1$$2$$3$$4$
User Avatar
1 votes
2 answers
70
NIELIT 2018-70
____ number of underlined graphs can be constructed using $V=(v1,v2, \dots,vn)$. $n^3$ $2^{n(n-1)}/2$ $n-1/2$ $2^{(n-1)}/2$
____ number of underlined graphs can be constructed using $V=(v1,v2, \dots,vn)$.$n^3$$2^{n(n-1)}/2$$n-1/2$$2^{(n-1)}/2$
User Avatar
4 votes
2 answers
71
NIELIT 2018-71
In the given truth table, $f(x,y)$ represent the Boolean function. $\begin{array}{|c|c|c|} \hline x & y & f(x,y) \\ \hline 0 & 0 & 1 \\ \hline 0 & 1 & 0 \\ \hline 1 & 0 & 0 \\ \hline 1 & 1 & 1 \\ \hline \end{array}$ $x \leftrightarrow y$ $ x \wedge y$ $x \vee y$ $x \rightarrow y$
In the given truth table, $f(x,y)$ represent the Boolean function.$$\begin{array}{|c|c|c|} \hline x & y & f(x,y) \\ \hline 0 & 0 & 1 \\ \hline 0 & 1 & 0 \\ \hline 1 & 0 &...
User Avatar
2 votes
3 answers
72
NIELIT 2018-72
____ number of leaf nodes in a rooted tree of $n$ nodes, where each node is having $0$ or $3$ children $\frac{n}{2}$ $\frac{(2n+1)}{3}$ $\frac{(n-1)}{n}$ $(n-1)$
____ number of leaf nodes in a rooted tree of $n$ nodes, where each node is having $0$ or $3$ children$\frac{n}{2}$$\frac{(2n+1)}{3}$$\frac{(n-1)}{n}$$(n-1)$
User Avatar
1 votes
2 answers
73
NIELIT 2018-73
Minimum ____ full adders and ____ half adders are required by the BCD adder to add two decimal digits. $3,2$ $9,4$ $6,5$ $5,2$
Minimum ____ full adders and ____ half adders are required by the BCD adder to add two decimal digits.$3,2$$9,4$$6,5$$5,2$
User Avatar
0 votes
2 answers
74
NIELIT 2018-74
Dijkstra’s algorithm is based on Greedy approach Dynamic programming Backtracking paradigm Divide and conquer paradigm
Dijkstra’s algorithm is based onGreedy approachDynamic programmingBacktracking paradigmDivide and conquer paradigm
User Avatar
0 votes
3 answers
75
NIELIT 2018-75
For the given recurrence equation $\begin{array} T(n) & =2T(n-1), &\text{if } n>0 \\ & =1, & \text{otherwise} \end{array}$ $O(n \log n)$ $O(n^2)$ $O(2^n)$ $O(n)$
For the given recurrence equation$\begin{array} T(n) & =2T(n-1), &\text{if } n>0 \\ & =1, & \text{otherwise} \end{array}$$O(n \log n)$$O(n^2)$$O(2^n)$$O(n)$
User Avatar
0 votes
1 answer
76
NIELIT 2018-76
Identify the correct nodes and edges in the given intermediate code $i=1$ $t1=5*i$ $t2=4*t1$ $t3=t2$ $a[t3]=0$ $i=i+1$ if $i<15$ goto(2) $33$ $44$ $43$ $34$
Identify the correct nodes and edges in the given intermediate code$i=1$$t1=5*i$$t2=4*t1$$t3=t2$$a[t3]=0$$i=i+1$if $i<15$ goto(2)$33$$44$$43$$34$
User Avatar
1 votes
2 answers
77
NIELIT 2018-77
_____ merges the bodies of two loops loop rolling loop folding loop merge loop jamming
_____ merges the bodies of two loopsloop rollingloop foldingloop mergeloop jamming
User Avatar
1 votes
3 answers
78
NIELIT 2018-78
Identify the true statement from the given statements. FIFO is non-preemptive Round robin is non-preemptive Multilevel Queue Scheduling is non-preemptive $1$ $1$ and $2$ $1$, $2$ and $3$ $2$
Identify the true statement from the given statements.FIFO is non-preemptiveRound robin is non-preemptiveMultilevel Queue Scheduling is non-preemptive$1$$1$ and $2$$1$, $...
User Avatar
2 votes
2 answers
79
NIELIT 2018-79
Given message $M=1010001101$. The CRC for this given message using the divisor polynomial $x^5+x^4+x^2+1$ is ______ $01011$ $10101$ $01110$ $10110$
Given message $M=1010001101$. The CRC for this given message using the divisor polynomial $x^5+x^4+x^2+1$ is ______$01011$$10101$$01110$$10110$
User Avatar
1 votes
3 answers
80
NIELIT 2018-80
_____ traversals are not sufficient to build a binary tree. Preorder and Inorder Postorder and Inorder Postorder and Preorder None of these
_____ traversals are not sufficient to build a binary tree.Preorder and InorderPostorder and InorderPostorder and PreorderNone of these
User Avatar
2 votes
1 answer
83
NIELIT 2018-83
In the Given language $L=\{ab, aa, baaa\}$, ____ number of strings are in $L^*$ baaaba aabaaaa baaabaaaabaa baaabaaa $1$ $2$ $3$ $4$
In the Given language $L=\{ab, aa, baaa\}$, ____ number of strings are in $L^*$baaabaaabaaaabaaabaaaabaabaaabaaa $1$$2$$3$$4$
User Avatar
2 votes
3 answers
84
NIELIT 2018-84
For the given nodes: $89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100$ minimum ______ number of interchanges are required to convert it into a max-heap. $3$ $4$ $5$ $6$
For the given nodes:$89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100$minimum ______ number of interchanges are required to convert it into a max-heap.$3$$4$$5$$6$
User Avatar
1 votes
3 answers
85
NIELIT 2018-85
Evaluation of the given postfix expression $10 \: 10 + 60 \: 6/^*8-$ is $192$ $190$ $110$ $92$
Evaluation of the given postfix expression $10 \: 10 + 60 \: 6/^*8-$ is$192$$190$$110$$92$
User Avatar
Page: