## Discussion Forum

Que. | The time complexity of an algorithm T(n), where n is the input size, is given by T( n) = T( n - 1) + 1/n if n > 1 The order of this algorithm is |

a. | n |

b. | log n |

c. | n+1 |

d. | n-1 |

Answer:log n |

Que. | The time complexity of an algorithm T(n), where n is the input size, is given by T( n) = T( n - 1) + 1/n if n > 1 The order of this algorithm is |

a. | n |

b. | log n |

c. | n+1 |

d. | n-1 |

Answer:log n |

Questions from Previous year GATE question papers

UGC NET Previous year questions and practice sets

UGC NET Previous year questions and practice sets

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.