Q57 Let A be an array of 31 numbers consisting of a sequence of 0s followed by a sequence of 1s The problem is to find the smallest index i such that Ai is 1 by probing the minimum number of locations in A The worst case number of probes performed by an optimal algorithm is gate computer science 2017

The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
In eduladder you can Ask,Answer,Listen,Earn and Download Questions and Question papers.
Watch related videos of your favorite subject.
Connect with students from different parts of the world.
Apply or Post Jobs, Courses ,Internships and Volunteering opportunity. For FREE
See Our team
Wondering how we keep quality?
Got unsolved questions? Ask Questions

You might like this video:modulus and amplitude of a complex number
Watch more here

Watch more videos from this user Here

Eduladder videos are community generated video contents which we deliver to you according to the content you are browsing.We are constantly working on video delivering algorithms in order to give you the best experiance as possible

Learn how to upload a video and start earning here

Answers
D) 5

Explanation: 
The best way to solve such a problem is by using Binary Search. Search the sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half. Find mid element
Is mid = 1 ?
Is mid >1?(not possible here)
Is mid < 1 ?
Proceed accordingly, Worst case of this problem will be 1 at the end of the array i.e 00000.....1 OR 1.......0000. It will take log n time worst case. n=31, Hence log 231 = 5. Therefore, option D is correct.

This explanation is contributed by Deepak Raj


Answerd on:2018-05-29 Answerd By:deepuckraj

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer
Talk about this  Delete  Like  Dislike

You might like this video:Binary Search Algorithm
Watch more here

Watch more videos from this user Here

Eduladder videos are community generated video contents which we deliver to you according to the content you are browsing.We are constantly working on video delivering algorithms in order to give you the best experiance as possible

Learn how to upload a video and start earning here



Lets together make the web is a better place

We made eduladder by keeping the ideology of building a supermarket of all the educational material available under one roof. We are doing it with the help of individual contributors like you, interns and employees. So the resources you are looking for can be easily available and accessible also with the freedom of remix reuse and reshare our content under the terms of creative commons license with attribution required close.

You can also contribute to our vision of "Helping student to pass any exams" with these.
Answer a question: You can answer the questions not yet answered in eduladder.How to answer a question
Career: Work or do your internship with us.Work with us
Create a video: You can teach anything and everything each video should be less than five minutes should cover the idea less than five min.How to upload a video on eduladder