See Our team

Wondering how we keep quality?

Got unsolved questions?

Ask Questions

Engineering
GATE
CBSE
NCERT
Psychology
English
Computer
Constitution
Astrology
Yoga
Economics
Physics
Biology
Electronics
Microprocessor
Career
Interview
Anatomy
Botany

## Q.57) Let A be an array of 31 numbers consisting of a sequence of 0’s followed by a sequence of 1’s. The problem is to find the smallest index i such that A[i] 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

A) 2B) 3C) 4D) 5By:satyashiromani

Taged users:

|satyashiromani|Msshikhil|Samira|aksingh1818|vivek25|vaishnavi-Deshpande|soumya|amrita98|sonam||tarun101|Umang|Divyanshu-Changkakoti|tanya|thegdx|ThreeRed|arunsivag|preethi|shilpasri|varsshita|sahajajnana|saru|lakshmi|navyasn|kavana|Siddharth|rythil|Athul3480|SathyaKrishna|Ankur-kumar

Likes:

|satyashiromani

Dislikes:

Be first to dislike this question

Talk about thisDelete|Like|Dislike|

## Answers

D) 5Deepak Rajdeepuckraj

Likes:

Be first to like this answer

Dislikes:

Be first to dislike this answer

Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|

------------------------------------

## Can you help us to add better answer here? Please see this