Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged binary-search
3
votes
2
answers
31
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.8k
views
binary-search
4
votes
4
answers
32
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
by
Parshu gate
6.7k
views
binary-tree
binary-search
binary-search-tree
4
votes
1
answer
33
Ace Test Series: Algorithms - Searching
saxena0612
asked
in
Algorithms
Nov 23, 2017
by
saxena0612
1.5k
views
binary-search
algorithms
ace-test-series
recurrence-relation
7
votes
2
answers
34
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.6k
views
algorithms
sorting
time-complexity
binary-search
3
votes
0
answers
35
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
by
saxena0612
1.1k
views
binary-search
algorithms
4
votes
1
answer
36
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 5, 2017
by
Aghori
1.2k
views
binary-search
algorithms
data-structures
time-complexity
2
votes
1
answer
37
Finding Minimum
.........
junaid ahmad
asked
in
Algorithms
Oct 29, 2017
by
junaid ahmad
301
views
algorithms
binary-search
time-complexity
numerical-answers
test-series
7
votes
3
answers
38
Self-doubt
Which of the following is exact recurrence relation for binary search (in terms of number of comparisons) ? 1. T(n) = 2T(n/2) + 1 2. T(n) = 2T(n/2) + 2 Please specify relevant reasons.
just_bhavana
asked
in
Algorithms
Aug 22, 2017
by
just_bhavana
1.3k
views
algorithms
binary-search
10
votes
3
answers
39
Modified Binary Search
Suppose the first step in binary search algorithm is changed to M = (9L+R)/10, we know that the complexity of binary search is log(n). What will be the complexity of modified search? a) log(n) b) n c) n$\log 9/10(n)$ d) 2nlog(n)
Chandramani Adil
asked
in
DS
Aug 16, 2017
by
Chandramani Adil
1.5k
views
time-complexity
binary-search
6
votes
5
answers
40
Binary search
How to get space complexity of binary search .. I am getting confusion in Space complexity = ip + extra (stack) And ip = nB ( why it is nB) ????? And extra = logn B So nB+ log n B = O(n) ...
air1ankit
asked
in
Algorithms
Aug 9, 2017
by
air1ankit
2.0k
views
algorithms
binary-search
1
vote
1
answer
41
algorithm
A binary search algorithm is implemented using recurrsion then what is the space and time complexity?
A_i_$_h
asked
in
Algorithms
Jul 24, 2017
by
A_i_$_h
400
views
binary-search
recursion
space-complexity
time-complexity
2
votes
1
answer
42
Gate algorithm
Harikesh Kumar
asked
in
Algorithms
Jul 10, 2017
by
Harikesh Kumar
499
views
sorting
binary-search
time-complexity
test-series
5
votes
4
answers
43
Binary Search
I/p - Sorted array of n element O/p- find any two elements a and b such that (a+b)>1000 if lenear search is possible then go to Binary Search and Find time complexity ..?
Raushank2
asked
in
Algorithms
Jun 28, 2017
by
Raushank2
2.7k
views
algorithms
binary-search
time-complexity
11
votes
2
answers
44
Self doubt in Binary search Algo
The average successful search time taken by binary search on a sorted array of $10$ items? $2.6$ $2.7$ $2.8$ $2.9$ Answer is $2.9$ My doubt:- But when I am using $log_2n$ for $n = 10$ it is not equal to $2.9$, and $log_210 = 3.3219$ ?
Shubhanshu
asked
in
Algorithms
Jun 5, 2017
by
Shubhanshu
11.1k
views
algorithms
binary-search
time-complexity
0
votes
1
answer
45
Where to study these topics listed in this post
Hello fellow GO members. What's the proper order and from where to start and reading about - Search operations like Linear Search and Binary Search etc and Operations on Array! Please someone tell me what subjects these topics from and what books or video lectures should I follow? Thanks!
iarnav
asked
in
Algorithms
Apr 29, 2017
by
iarnav
308
views
algorithms
binary-search
reference-book
0
votes
1
answer
46
Binary Stream
We have a run of 0's followed by the run of 1's and we have to find the point where first 1 will be present. We only know the start of the sequence but we have no idea about the end. what should the best case complexity of this problem? Describe your approach.
Mandeep Singh
asked
in
Algorithms
Apr 14, 2017
by
Mandeep Singh
578
views
binary-search
6
votes
3
answers
47
binary search
I/p - array of n element in which untill some postion all are integer and afterward all are star (*) O/p- find the postion of 1st star (*) Hint - if lenear search is possible the go to BS Find time complexity ..?
air1ankit
asked
in
Algorithms
Mar 9, 2017
by
air1ankit
1.6k
views
algorithms
binary-search
binary-search-tree
1
vote
1
answer
48
Time complexity to compute the sum of k smallest element in the binary search tree??
Time complexity to compute the sum of k smallest element in the binary search tree?? can we do it like this- Start doing the inorder traversal of the binary search tree, it will give the elements in increasing order. ... which we have got. Its time complexity will be O(h+k). Am i right?? plzz plzz explain someone
sushmita
asked
in
Programming in C
Feb 2, 2017
by
sushmita
2.0k
views
binary-search
binary-search-tree
1
vote
1
answer
49
IITd Phd -sample Q
Derive the running time of the binary search algorithm. If I modify binary search to break the interval size into 1/3, 2/3 rather than 1/2, 1/2, then what is the worst case running time?
Aboveallplayer
asked
in
Algorithms
Dec 1, 2016
by
Aboveallplayer
893
views
binary-search
time-complexity
2
votes
1
answer
50
complexity of different trees
what are the complexities of different trees like BST,AVL,HEAP,B-tree etc for insertion updation deletion for all 3 cases 1)best 2)avg 3)worst
Sanjay Sharma
asked
in
Algorithms
Nov 23, 2016
by
Sanjay Sharma
1.4k
views
data-structures
tree
binary-search
time-complexity
descriptive
4
votes
2
answers
51
binary search
Consider an array ‘A’ with 2m elements. The elements in odd position are sorted in non-increasing order that is A[1] >= A[3] >= A[5]......A[2m-1] The elements in even position are sorted in non-decreasing order, that is A[2]<= A[4] <= A[6].....A[2m]. Which of the following method is recommended for finding if a given number is in array?
vaishali jhalani
asked
in
Algorithms
Nov 10, 2016
by
vaishali jhalani
1.8k
views
binary-search
algorithms
0
votes
1
answer
52
binary search
Stack space used in binary search resursive implementation.
vaishali jhalani
asked
in
Algorithms
Nov 10, 2016
by
vaishali jhalani
884
views
binary-search
algorithms
2
votes
2
answers
53
Comparisons in a Binary Search
How many comparisons are needed for a binary search in a set of 64 elements?
Rohan Mundhey
asked
in
Algorithms
Nov 9, 2016
by
Rohan Mundhey
5.5k
views
algorithms
binary-search
numerical-answers
3
votes
4
answers
54
ARRAYS
Consider an array containing ‘n’ elements. The elements present in an array are in arithmetic progression, but one element is missing in that order. What is the time complexity to find the position of the missing element using divide and conquer?
Rohan Mundhey
asked
in
Algorithms
Nov 9, 2016
by
Rohan Mundhey
2.6k
views
algorithms
binary-search
time-complexity
1
vote
1
answer
55
#Algorithm
Given a sorted array of distinct interger A[1...N] , you want to find out whether there is an index "i" for which A[i] =i . if this problem is solved using divide and conquer method,then find time complexity.
papesh
asked
in
Algorithms
Nov 4, 2016
by
papesh
1.2k
views
binary-search
algorithms
6
votes
2
answers
56
Gatebook exam
Consider the following exponential search algorithm(ES). The array of n elements have to be searched is divided in to logn parts. The ith part is from index to. to search an element search all the parts one by one from left to right using binary search algorithm. What is the worst case complexity of above searching algorithm?
Sayan Das 1
asked
in
Programming in C
Aug 27, 2016
by
Sayan Das 1
1.4k
views
binary-search
3
votes
3
answers
57
Binary Search Tree
Suppose we do not have a parent pointer in the nodes of a search tree, only left-child and right-child. Which of the following operations can be computed in time $O(\log n)$ for a balanced search tree? 1- find, insert, delete, but not min, max, pred, succ 2- ... pred, succ 3- find, insert, delete, pred, succ but not min, max 4- All of find, insert, delete, min, max, pred, succ
dd
asked
in
Algorithms
Aug 23, 2016
by
dd
2.4k
views
binary-search
algorithms
data-structures
binary-search-tree
binary-tree
1
vote
2
answers
58
Binary Search
What is the worst case complexity for searching for a key in a sorted array using Binary Search??
Jithin Jayan
asked
in
Algorithms
Jul 24, 2016
by
Jithin Jayan
1.1k
views
algorithms
binary-search
descriptive
2
votes
2
answers
59
Binary search
If the binary search algorithm determines that the scanned argument is in upper half of the array,which of the following statement will set the appropriate variable to the appropriate value. A) startsub= middlesub-1; B) startsub=middlesub+1; C)stopsub=middlesub-1; D)stopsub=middlesub+1;
vivekpinto07
asked
in
DS
Jun 24, 2016
by
vivekpinto07
3.0k
views
binary-search
2
votes
1
answer
60
Binary search algorithm employs the strategy of
Binary search algorithm employs the strategy of Divide and Conquer technique Dynamic Programming Branch & Bound technique Greedy Strategy
shivani2010
asked
in
Algorithms
Jun 12, 2016
by
shivani2010
1.1k
views
algorithms
binary-search
Page:
« prev
1
2
3
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged binary-search
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...