Register
Filter

Hot questions in Others

0 votes
1 answer
1201
NIELIT 2021 Dec Scientist A - Section B: 45
More than one word is put in one cache block to: exploit the temporal locality of reference in a program exploit the spatial locality of reference in a program reduce the miss penalty none of the option
More than one word is put in one cache block to:exploit the temporal locality of reference in a programexploit the spatial locality of reference in a programreduce the mi...
User Avatar
0 votes
1 answer
1202
NIELIT 2021 Dec Scientist A - Section A: 23
The length, breadth and height of a room are in the ratio of $3 : 2 : 1.$ If its volume be $1296 \; \text{m}^{3},$ find its breadth. $12 \; \text{m}$ $18 \; \text{m}$ $16 \; \text{m}$ $24 \; \text{m}$
The length, breadth and height of a room are in the ratio of $3 : 2 : 1.$ If its volume be $1296 \; \text{m}^{3},$ find its breadth.$12 \; \text{m}$$18 \; \text{m}$$16 \;...
User Avatar
1 votes
1 answer
1203
UGC NET CSE | January 2017 | Part 3 | Question: 73
Which of the following neural networks uses supervised learning? Multilayer perception Self organizing feature map Hopfield network (A) only (B) only (A) and (B) only (A) and (C) only
Which of the following neural networks uses supervised learning?Multilayer perceptionSelf organizing feature mapHopfield network(A) only (B) only ...
User Avatar
0 votes
1 answer
1204
NIELIT 2021 Dec Scientist A - Section B: 88
The recurrence relation for binary search algorithm is : $\text{T(n) = 2T (n/2) + O (1)}$ $\text{T(n) = 2T (n/2) + O (n)}$ $\text{T(n) = T (n/2) + O (1)}$ $\text{T(n) = T (n/2) + O (n)}$
The recurrence relation for binary search algorithm is :$\text{T(n) = 2T (n/2) + O (1)}$$\text{T(n) = 2T (n/2) + O (n)}$$\text{T(n) = T (n/2) + O (1)}$$\text{T(n) = T (n/...
User Avatar
0 votes
1 answer
1205
NIELIT 2021 Dec Scientist A - Section B: 59
Let $\text{C} (n, \; r) = \binom{n}{r}.$ The value of $ \displaystyle \sum_{k=0}^{20}(2k+1) \text{C} (41, 2k+1),$ is : $40 (2)^{40}$ $40 (2)^{39}$ $41 (2)^{40}$ $41 (2)^{39}$
Let $\text{C} (n, \; r) = \binom{n}{r}.$ The value of $ \displaystyle \sum_{k=0}^{20}(2k+1) \text{C} (41, 2k+1),$ is :$40 (2)^{40}$$40 (2)^{39}$$41 (2)^{40}$$41 (2)^{39}$...
User Avatar
0 votes
1 answer
1207
NIELIT 2021 Dec Scientist A - Section A: 31
“The judge’s standing in the legal community, though shaken by false allegations of wrongdoing, remained ________________ .” The word that best fills the blank in the above sentence is : undiminished damaged illegal uncertain
“The judge’s standing in the legal community, though shaken by false allegations of wrongdoing, remained ________________ .” The word that best fills the blank in t...
User Avatar
0 votes
1 answer
1208
Can't enroll to the courses on go classroom, please help
Why am I not able to access the course content that is to enroll in the courses on go classroom? It says that it has been ended on 21st July is there any other way to access the course content please help
Why am I not able to access the course content that is to enroll in the courses on go classroom?It says that it has been ended on 21st July is there any other way to acce...
User Avatar
0 votes
1 answer
1211
NIELIT 2021 Dec Scientist A - Section B: 92
Consider the grammar with nonterminals $\text{N = \{ S, C, S}_{1} \}$ terminals $\text{T = \{ a, b, i, t, e \}}$ With $\text{S}$ ... $\text{LL}(1)$ because : It is left recursive It is right recursive It is ambiguous It is not context free
Consider the grammar with nonterminals $\text{N = \{ S, C, S}_{1} \}$ terminals $\text{T = \{ a, b, i, t, e \}}$ With $\text{S}$ as the start symbol, and the following se...
User Avatar
0 votes
1 answer
1214
NIELIT 2021 Dec Scientist A - Section B: 91
If $\text{T1}$ and $\text{T2}$ are two Turing machines. The composite can be represented using the expression : $\text{T1T2}$ $\text{T1} \cup \text{T2}$ $\text{T1} \times \text{T2}$ None of the options
If $\text{T1}$ and $\text{T2}$ are two Turing machines. The composite can be represented using the expression :$\text{T1T2}$$\text{T1} \cup \text{T2}$$\text{T1} \times \t...
User Avatar
0 votes
1 answer
1215
NIELIT 2021 Dec Scientist A - Section B: 53
The largest number of faces in a simple connected maximal planar graph with $100$ vertices is : $200$ $198$ $196$ $96$
The largest number of faces in a simple connected maximal planar graph with $100$ vertices is :$200$$198$$196$$96$
User Avatar
0 votes
1 answer
1216
NIELIT 2021 Dec Scientist A - Section B: 120
Which one of the following cannot be scheduled by the kernel ? Kernel level thread User level thread Process None of the option
Which one of the following cannot be scheduled by the kernel ?Kernel level threadUser level threadProcessNone of the option
User Avatar
0 votes
1 answer
1217
NIELIT 2021 Dec Scientist A - Section B: 85
In what manner is a state-space tree for a backtracking algorithm constructed ? Breadth-first search Twice around the tree Depth-first search Nearest neighbour first
In what manner is a state-space tree for a backtracking algorithm constructed ?Breadth-first searchTwice around the treeDepth-first searchNearest neighbour first
User Avatar
0 votes
1 answer
1218
NIELIT 2021 Dec Scientist A - Section B: 50
A microprogrammed control unit : is faster than hardwired control unit allows easy implementation of new instructions is useful when small programs are to be run none of the options
A microprogrammed control unit :is faster than hardwired control unitallows easy implementation of new instructionsis useful when small programs are to be runnone of the ...
User Avatar
0 votes
1 answer
1219
NIELIT 2021 Dec Scientist A - Section B: 57
Consider a relation $\text{R}$ with attributes $\{ \text{A, B, C} \}$ and functional dependency set $\text {S= \{ A} \rightarrow \text{B, } \text{A} \rightarrow \text{C} \; \}.$ Then relation $\text{R}$ ... None of the above
Consider a relation $\text{R}$ with attributes $\{ \text{A, B, C} \}$ and functional dependency set $\text {S= \{ A} \rightarrow \text{B, } \text{A} \rightarrow \text{C} ...
User Avatar
0 votes
1 answer
1220
NIELIT 2021 Dec Scientist A - Section B: 79
Let $\text{X}$ be uniform random variable on $[0, 4]$ and $\text{Y}$ be uniform random variable on $[0, 1].$ If $\text{X}$ and $\text{Y}$ are independent, then $\text{P (max \{ X, Y \}} >3)$ is equal to : $1/4$ $1/2$ $1/8$ $1$
Let $\text{X}$ be uniform random variable on $[0, 4]$ and $\text{Y}$ be uniform random variable on $[0, 1].$ If $\text{X}$ and $\text{Y}$ are independent, then $\text{P (...
User Avatar
Page: