Start learning →

GATE CSE Asymptotic — practice questions

Explore 2 free Asymptotic questions in GATE CSE Algorithms. Open each question or exercise to read its content, reference answers and available explanation.

Practise Asymptotic with Quill →

Asymptotic questions and exercises with answers

Showing questions 1–2 of 2.

Match the algorithm to its average-case time complexityRead the answer and worked solution →Which complexity is asymptotically larger?Read the answer and worked solution →

Worked practice questions

Match the algorithm to its average-case time complexity

Read exercise and reference answers
Matching pairs
  1. Left
    Binary Search
    Right
    O(log n)
  2. Left
    Merge Sort
    Right
    O(n log n)
  3. Left
    Quick Sort
    Right
    O(n log n)
  4. Left
    Bubble Sort
    Right
    O(n²)
  5. Left
    Linear Search
    Right
    O(n)

Open this exercise →

Which complexity is asymptotically larger?

Read exercise and reference answers
Questions
  1. A
    O(n²)
    B
    O(n log n)
    Higher value
    O(n²)
  2. A
    O(2ⁿ)
    B
    O(n³)
    Higher value
    O(2ⁿ)
  3. A
    O(log n)
    B
    O(1)
    Higher value
    O(log n)
  4. A
    O(n!)
    B
    O(2ⁿ)
    Higher value
    O(n!)

Open this exercise →

How to practise

  1. Choose a Asymptotic question and try to work out your answer.
  2. Open the question to check the correct answer and read its worked solution.
  3. Continue in the app for bite-sized lessons, explanations and review with Quill. You can start without creating an account.

More Algorithms topics

DatastructuresGraphsSorting