Register

NIELIT 2016 MAR Scientist B - Section B: 7

• retagged by
1,907 views

1 Answer

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

Related questions

1 votes
1 votes
0 answers
1
admin asked Apr 2, 2020
395 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$
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$$...
User Avatar
1 votes
1 votes
1 answer
2
admin asked Mar 31, 2020
1,121 views
NIELIT 2016 MAR Scientist B - Section C: 30
Bounded minimalization is a technique for proving whether a promotive recursive function is turning computable or not proving whether a primitive recursive function is a total function or not generating primitive recursive functions generating partial recursive functions
Bounded minimalization is a technique forproving whether a promotive recursive function is turning computable or notproving whether a primitive recursive function is a to...
User Avatar
1 votes
1 votes
0 answers
3
admin asked Mar 31, 2020
347 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 module Serially usable Re-enterable module Recursive module
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 moduleSeriall...
User Avatar
1 votes
1 votes
1 answer
4
admin asked Mar 31, 2020
1,151 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$
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!