Register

NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 30

• edited by
1,490 views

3 Answers

Voting & Accepting an answer helps improve the community
Answer:
← Previous · NIELIT 2017 OCT Scie...Next → · NIELIT 2017 OCT Scie...
← Previous in category · NIELIT 2017 DEC Scie...Next in category → · NIELIT 2017 OCT Scie...
Position:
Show:

Related questions

2 2 votes
3 3 answers
1.3k
1.3k views
admin asked Apr 1, 2020
1,331 views
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 8
Consider the following C code segment:int Ls Prime(n) { int i,n; for(i=2;i<=sqrt(n);i++) if(n%i ==0) { printf(“NOT Prime.\n”); retu...
1 1 vote
1 1 answer
2.2k
2.2k views
admin asked Apr 1, 2020
2,160 views
NIELIT 2017 OCT Scientific Assistant A (CS) - Section C: 4
The running time of an algorithm $T(n),$ where $’n’$ is the input size , is given by$T(n) = 8T(n/2) + qn,$ if $n>1$$ = p,$ if $n = 1$Where $p,q$ are constants. The order ...
0 0 votes
2 2 answers
1.6k
1.6k views
admin asked Apr 1, 2020
1,621 views
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 29
Which of the following algorithm solve the all-pair shortest path problem?Dijakstra’s algorithmFloyd’s algorithmPrim’s algorithmWarshall’s algorithm
1 1 vote
1 1 answer
1.8k
1.8k views
admin asked Apr 1, 2020
1,793 views
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 1
A decimal has $25$ digits. The number of bits needed for its equivalent binary representation is approximately,$50$$74$$40$$60$