Awesome q2a theme
0 votes
7 views
Suppose someone designs a new airline routing algorithm called MagicPath and claims that its worst-case complexity is O(n^2 log n). Which of the following statements is inconsistent with this claim.

 For every n, for every input of size n, MagicPath is able to solve the problem in time proportional to n^2.

 For some n, for every input of size n, MagicPath is able to solve the problem in time proportional to n^2.

 For every sufficiently large n, there is an input of size n for which MagicPath requires time proportional to n^2.

 For every sufficiently large n, there is an input of size n for which MagicPath requires time proportional to n^3.
in Algorithms by (6 points) | 7 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Feb 2020
  1. shashin

    363 Points

  2. Shaik Masthan

    79 Points

  3. SuvasishDutta

    39 Points

  4. srestha

    33 Points

  5. Mk Utkarsh

    32 Points

  6. neeraj_bhatt

    31 Points

  7. !KARAN

    30 Points

  8. Debapaul

    23 Points

  9. Pratyush Priyam Kuan

    18 Points

  10. kalra05

    18 Points

Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
3,327 questions
1,581 answers
10,280 comments
89,915 users