Register

NIELIT 2016 MAR Scientist B - Section B: 7

• retagged by
2,003 views

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

411
views
0 answers
1 votes
admin asked Apr 2, 2020
411 views
NIELIT 2016 MAR Scientist C - Section B: 1
Choose the most appropriate option.The Newton-Raphson iteration $x_{n+1}=\dfrac{x_{n}}{2}+\dfrac{3}{2x_{n}}$ can be used to solve the equation$x^{2}=3$x^{3}=3$x^{2}=2$x^{3}=2$
User Avatar
1.2k
views
1 answers
1 votes
admin asked Mar 31, 2020
1,191 views
NIELIT 2016 MAR Scientist B - Section C: 30
Bounded minimalization is a technique forproving whether a promotive recursive function is turning computable or notproving whether a ... function or notgenerating primitive recursive functionsgenerating partial recursive functions
User Avatar
362
views
0 answers
1 votes
admin asked Mar 31, 2020
362 views
NIELIT 2016 MAR Scientist B - Section C: 33
In what module multiple instances of execution will yield the same result even if one instance has not terminated before the next one has begun?Non reusable moduleSerially usableRe-enterable moduleRecursive module
User Avatar
1.2k
views
1 answers
1 votes
admin asked Mar 31, 2020
1,209 views
NIELIT 2016 MAR Scientist B - Section C: 46
According to Brooks, if $n$ is the number of programmers in a project team, then the number of communication path is$n(n-1)/2$n\log n$n$n(n+1)/2$
User Avatar
Link Copied!