Dark Mode

Recent questions tagged binary-search

11 votes

3 answers

1

GATE CSE 2021 Set 2 | Question: 8
What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size $n$? $\Theta ( \sqrt{n})$ $\Theta (\log _2(n))$ $\Theta(n^2)$ $\Theta(n)$

Arjun asked in Algorithms Feb 18, 2021

by Arjun

7.7k views

2 votes

1 answer

2

NIELIT 2016 MAR Scientist C - Section C: 52
Consider the process of inserting an element into a $Max\ Heap$, where the $Max\ Heap$ is represented by an $array$. Suppose we perform a binary search on the path from the new leaf to the root to find the position for the newly inserted element, the number of $comparisons$ ... $\Theta(n\log _{2} \log_2 n)$ $\Theta (n)$ $\Theta(n\log _{2}n)$

Lakshman Patel RJIT asked in DS Apr 2, 2020

by Lakshman Patel RJIT

1.4k views

1 vote

1 answer

3

Made Easy Test Series
Given a sorted array of distinct integers A[1,2,3,..,n], the tightest upper bound to check the existence of any index i for which A[i]= i is equal to O($n^{a}log^{b}n)$. Then a+10b is equal to ___?

Somoshree Datta 5 asked in Algorithms Dec 31, 2018

by Somoshree Datta 5

1.9k views

10 votes

6 answers

4

TIFR CSE 2019 | Part A | Question: 5
Asha and Lata play a game in which Lata first thinks of a natural number between $1$ and $1000$. Asha must find out that number by asking Lata questions, but Lata can only reply by saying Yes or no . Assume that Lata always tells the truth. What is ... she can always find out the number Lata has thought of? $10$ $32$ $100$ $999$ $\text{None of the above}$

Arjun asked in Algorithms Dec 18, 2018

by Arjun

3.2k views

1 vote

4 answers

5

Binary Search
There are two sorted list each of length n. An element to be searched in the both the lists. The lists are mutually exclusive. The maximum number of comparisons required using binary search and find its time complexity?

Abhishek Kumar 38 asked in Algorithms Dec 15, 2018

by Abhishek Kumar 38

1.5k views

2 votes

1 answer

6

GATEBOOK_DSA4_2
In which of the cases shown below, Binary search can not always be applied for searching (A) Hierarchical data record (B) Internet Domain name conversion (C) Searching a telephone number in directory (D) An array of integers Answer is given to be (D). I thought it must be (B). Please help. I understand (D) is okay when the array is not sorted.But what about other options?

Ayush Upadhyaya asked in Programming Nov 15, 2018

by Ayush Upadhyaya

699 views

3 votes

0 answers

7

GATEBOOK-DSA4_8
Consider a sorted array A of n integer elements, A[0]...A[n − 1]. A search operation is to be performed on this array using .Binary search algorithm. If the element being searched is in fact the last element of the array, what is the difference between the index of element ... This is my answer.But it matches none of the options. Where I went wrong?

Ayush Upadhyaya asked in Programming Nov 15, 2018

by Ayush Upadhyaya

633 views

0 votes

1 answer

8

Algorithim
The average number of comparisons made by binary search for an unsuccessful search in array A

Sonali1996 asked in Algorithms Sep 22, 2018

750 views

0 votes

2 answers

9

ben10 asked in Algorithms Sep 9, 2018

by ben10

337 views

0 votes

1 answer

10

SELF DOUBT
https://gateoverflow.in/18752/tifr2010-b-29 IN THIS QUESTION WHY WE CANT NOT APPLY SINGLE BINARY SEARCH ON ENTIRE ARRAY ??? BECAUSE LET WE HAVE ARRAY 1 14 3 12 5 10 7 8 9 6 11 4 13 2 SUPPOSE WE NEED TO FIND 4 MID =7 AT MID THERE IS ODD NUMBER SO ... EVEN NUMBER ARE ARRANGED IN DESCENDING ORDER SO 4 WILL BE ON RIGHT OF 7 SO SIMILARLY WE CAN DO LIKE THAT.....IOS THIS APPROACH CORRECT??

eyeamgj asked in Algorithms Sep 1, 2018

189 views

2 votes

4 answers

11

Binary Search
for binary search in an array of n elements the average number of searches is $\left \lfloor \log_{2}n \right \rfloor$ or $\left \lceil \log_{2}n \right \rceil$ ?

aditi19 asked in Algorithms Aug 20, 2018

1.9k views

0 votes

1 answer

12

Binary search
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is (A) (n) (B) (logn) (C) (log*n) (D) (1)

Sabir Khan asked in Algorithms Aug 8, 2018

737 views

3 votes

1 answer

13

Ace Algorithms
Leading element in an array of n elements is the element which occurs more than n/2 times in the array. a) What is the time complexity to find whether a leading element exists or not in a sorted array of n elements? b)What is the time complexity to find ... between 0 to n? c)What is the time complexity to find whether leading element exists or not in an unsorted array of n elements?

Sambhrant Maurya asked in Algorithms Aug 7, 2018

by Sambhrant Maurya

1.4k views

0 votes

1 answer

14

Made Easy Algorithms
How to calculate the time complexity for finding repeated elements in an array of n elements using linear search and binary search?

Sambhrant Maurya asked in Algorithms Aug 6, 2018

by Sambhrant Maurya

576 views

4 votes

7 answers

15

Searching
Q) Consider a sorted array of n numbers. What would be the time complexity of the best known algorithm to find a pair a and b such that |a-b| = k , k being a positive integer. a) O(logn) b) O(n) c)O(nlogn) d)O(n^2) Which of the option is Correct And Why?

pradeepchaudhary asked in Algorithms Jul 9, 2018

by pradeepchaudhary

9.5k views

0 votes

1 answer

16

Binary search
Find the average number of comparisons in a binary search on a sorted array of 10 consecutive integers starting from 1. 1) 2.6 2)2.7 3)2.8 4)2.9

shweta sah asked in Algorithms Jun 22, 2018

502 views

1 vote

1 answer

17

Drdo 2008
Binary search can be carried out on a set of ordered data items stored in a (A) Array (B) Stack (C) Queue (D) List

Shankar Jha asked in Algorithms Jun 15, 2018

992 views

3 votes

1 answer

18

Binary Search Question!
The average successful search time taken by binary search on a sorted array of 5 CONSECUTIVE integers starting with 1? My Answer is - 2.2 Kindly tell me is it correct or not? NOTE: I have edited the question and changes are shown in highlighted text.

iarnav asked in Algorithms Mar 13, 2018

by iarnav

1.4k views

3 votes

2 answers

19

Algorithms :- Binary search vs ternary search
Why to prefer binary search over ternary search?Can someone give recreance relation for ternary search,so that i can compare both

rahul sharma 5 asked in Algorithms Mar 8, 2018

by rahul sharma 5

1.9k views

3 votes

0 answers

20

Interesting question on SQL
Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the records are stored in ascending order of these primary keys as given in the tables. No indexing is available in ... If Binary Search is used to locate a tuple in a relation using primary key, then what is the range of n?

Balaji Jegan asked in Databases Jan 31, 2018

by Balaji Jegan

674 views

1 vote

1 answer

21

binary search space complexity

Aditya Bahuguna asked in Algorithms Jan 7, 2018

by Aditya Bahuguna

1.7k views

3 votes

2 answers

22

Binary Search
Suppose we have the following sorted list: [3, 5, 6, 8, 11, 12, 14, 15, 17, 18] and array data structure is used. We are using recursive binary search algorithm to search an element 8. Which of the following group of number correctly shown the sequence of comparison used to find element 8? (Assume array index starting with 0). a) 11,5,6,8 b) 12,6,11,8

VS asked in Algorithms Dec 8, 2017

by VS

3.1k views

4 votes

4 answers

23

Number of binary search trees
How many different binary search trees can be constructed using six distinct keys? 256 128 132 264

Parshu gate asked in DS Nov 27, 2017

4.8k views

4 votes

1 answer

24

Ace Test Series: Algorithms - Searching

saxena0612 asked in Algorithms Nov 23, 2017

1.2k views

7 votes

2 answers

25

Question on sorted array and time complexity
Which of the following operations can be performed in O(log n) time or faster on a sorted array A? (n denotes the size of array) 1) Search(A, x) 2) Find-Minimum(A) 3) Delete(A, x) Choose the correct option: A.) 1 & 3 B.) 1 & 2 C.) 2 & 3 D.) All of them I chose option B but the book says option D is right. Please provide an explanation.

Akash Mishra asked in Algorithms Nov 22, 2017

by Akash Mishra

4.2k views

3 votes

0 answers

26

Binary Search
In this given question I find all answers false because while implementing binary seach or tracing it for an example we need to follow same approach Right? if we are taking ceil for evaluation then it should be considered throughout and if we are ... should be traced.Therefore applying both operating individually I find none of the options matching. Correct Me If I am wrong here.

saxena0612 asked in Algorithms Nov 16, 2017

756 views

4 votes

1 answer

27

Binary search on two mutually exclusive arrays.
There are two sorted list each of length $n$ ... the search the moment we find the element. So tell me whose solution is correct? Why my solution should be incorrect?

Aghori asked in Algorithms Nov 6, 2017

by Aghori

873 views

2 votes

1 answer

28

Finding Minimum
.........

junaid ahmad asked in Algorithms Oct 29, 2017

by junaid ahmad

187 views

Page:

1
2
3
next »

Recent questions tagged binary-search