Register

NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 14

• reopened by
934 views
0 votes
0 votes

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 of this algorithm is

  1. $n^{2}$
  2. $n^{n}$
  3. $n^{3}$
  4. $n$
• reopened by
User Avatar

Please log in or register to answer this question.

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

Related questions

1.4k
views
1 answers
1 votes
admin asked Apr 1, 2020
1,408 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 of this algorithm is$n^{2}$n^{n}$n^{3}$n$
User Avatar
762
views
1 answers
0 votes
admin asked Apr 1, 2020
762 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 34
The solution of the recurrence relation$a_{r} = a_{r-1} + 2a_{r-2}$ with $a_{0} = 2,a_{1} = 7$ is$a_{r} = (3)^{r} + (1)^{r}$2a_{r} = (2)^{r}/3 – (1)^{r}$a_{r} = 3^{r+1} – (-1)^{r}$a_{r} = 3(2)^{r} – (-1)^{r}$
User Avatar
998
views
1 answers
0 votes
admin asked Apr 1, 2020
998 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 2
An algorithm is made up pf two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then the order of algorithm is$max(f(n),g(n))$min(f(n),g(n))$f(n) + g(n)$f(n) \times g(n)$
User Avatar
917
views
2 answers
2 votes
admin asked Apr 1, 2020
917 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 36
The average search time for hashing with linear probing will be less if the load factorIs far less than oneEquals oneIs far greater than oneNone of the above
User Avatar
Link Copied!