The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent questions tagged divideandconquer
0
votes
0
answers
1
divide and conquer
in questions like how many multiplications of n are needed are being solved by dividing n into n/2 * n/2 and then end up with recurrence t(n) = t(n/2) + O(1) How to reach this type of analysis where we get to know that we have to divide n into halves?
asked
Jan 12
in
Algorithms
by
iarnav
Veteran
(
20k
points)

34
views
divideandconquer
algorithms
asymptoticnotations
+1
vote
0
answers
2
Test series
Consider a set of 156 elements to find minimum and maximum elements in the given set, the minimum number of comparisons required is___? You have given an array of 512 elements,minimum number of comparisons required to find out second largest element among all will be___? 230 & 517 229 & 516 231 & 518 232 & 519
asked
Jan 5
in
Algorithms
by
vinay9427
(
113
points)

44
views
algorithms
divideandconquer
+1
vote
1
answer
3
ACE test series
please help me to understand
asked
Dec 21, 2017
in
Algorithms
by
VIKRAM KASANA
Junior
(
535
points)

161
views
algorithms
timecomplexity
divideandconquer
+2
votes
1
answer
4
Time complexity of divide and conquer
asked
Nov 18, 2017
in
Algorithms
by
Parshu gate
Boss
(
6.4k
points)

125
views
algorithms
divideandconquer
asymptoticnotations
+2
votes
1
answer
5
CLRS DivideandConquer Strassens's algorithm
asked
Oct 9, 2017
in
Algorithms
by
Manasi Srivastava
(
99
points)

136
views
algorithms
divideandconquer
dynamicprogramming
+2
votes
2
answers
6
Ace practice book
how to apply master's method for this recurrence relation $T\left ( n \right )= {}\sqrt{n}T\left ( {\sqrt{n}} \right )+n$
asked
May 19, 2017
in
Algorithms
by
Devasish Ghosh
Junior
(
737
points)

214
views
mastertheorem
mastermethod
algorithms
divideandconquer
+1
vote
3
answers
7
difference between dynamic programming and divide and conquer technique is
asked
Apr 17, 2017
in
Algorithms
by
LavTheRawkstar
Boss
(
6.8k
points)

2.8k
views
divideandconquer
algorithms
dynamicprogramming
programming
+3
votes
1
answer
8
min max using divide and conquer
asked
Mar 23, 2017
in
Algorithms
by
sushmita
Veteran
(
14.6k
points)

247
views
divideandconquer
algorithms
+2
votes
1
answer
9
Divide and conquer
Reply with solution @Arjun sir,@habibkhan,@vijaycs
asked
Feb 7, 2017
in
Algorithms
by
Shubham Sharma 2
Boss
(
5.7k
points)

214
views
algorithms
divideandconquer
+2
votes
2
answers
10
divide and conquer
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?
asked
Nov 25, 2016
in
Algorithms
by
Shubham Pandey 2
Boss
(
7.2k
points)

370
views
divideandconquer
+3
votes
1
answer
11
Divide and conquer+Dynamic
asked
Oct 8, 2016
in
Algorithms
by
Rahul Jain25
Veteran
(
12.6k
points)

386
views
divideandconquer
dynamicprogramming
algorithms
+4
votes
0
answers
12
CMI2013B04
You are given two sorted lists of integers of size $m$ and $n$. Describe a divide and conquer algorithm for computing the $k$th smallest element in the union of the two lists in time $O(\log m + \log n)$.
asked
May 23, 2016
in
Algorithms
by
jothee
Veteran
(
108k
points)

183
views
cmi2013
algorithms
sorting
divideandconquer
descriptive
+1
vote
0
answers
13
CMI2012B04
You have an array $A$ with $n$ objects, some of which are identical. You can check if two objects are equal but you cannot compare them in any other way—i.e. you can check A[i] == A[j] and A[i] != A[j], but comparisons ... to each other. Use divide and conquer to come up with an $O(n \log n)$ algorithm to determine if $A$ has a majority element.
asked
May 23, 2016
in
Algorithms
by
jothee
Veteran
(
108k
points)

77
views
cmi2012
algorithms
divideandconquer
+3
votes
3
answers
14
Algorithm
How many term will be computed to determine the value of $10C8$ Using a divide and conquer algorithms ? 45 46 90 89
asked
May 20, 2016
in
Algorithms
by
ManojK
Veteran
(
40k
points)

356
views
algorithms
divideandconquer
To see more, click for the
full list of questions
or
popular tags
.
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
NIELIT(17 Dec 2017) Result Out
Contest/challenge GATE201825
IISC admission
Admission in IITS through COAPS
IITKanpur
Follow @csegate
Gatecse
Recent questions tagged divideandconquer
Recent Blog Comments
iam getting 65 in sta ,my serial number is ...
Yes..this is the list of candidates who secured ...
But this is not Final list.
Yes, Generally Data Science should be preferred. ...
Those who answered 35 must challenge  and even 1 ...
33,620
questions
40,170
answers
114,128
comments
38,552
users