Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

GATE | GATE-CS-2015 (Mock Test) | Question 10

  • Last Updated : 28 Jun, 2021

Given an array that represents elements of arithmetic progression in order. It is also given that one element is missing in the progression, the worst case time complexity to find the missing element efficiently is:
(A) Θ(n)
(B) Θ(nLogn)
(C) Θ(Logn)
(D) Θ(1)

Answer: (C)

Explanation: We can use Binary Search to find the missing element. See following link for details.

Quiz of this Question

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!