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
1
answer
1
Someone Please Answer Kway Merge SortProblem #Stanford #ProblemSet1 #Question4
asked
5 days
ago
in
Algorithms
by
ਮਾਧਵ ਨੰਦਨ
(
425
points)

31
views
algorithms
timecomplexity
divideandconquer
mergesort
0
votes
1
answer
2
Someone Please Answer #Stanford #ProblemSet1 #Question5
asked
6 days
ago
in
Algorithms
by
ਮਾਧਵ ਨੰਦਨ
(
425
points)

74
views
algorithms
timecomplexity
divideandconquer
0
votes
0
answers
3
Cormen #Chapter 4 #FindMaximumSubarray #Exercises
asked
May 12
in
Algorithms
by
ਮਾਧਵ ਨੰਦਨ
(
425
points)

27
views
algorithms
divideandconquer
maximumsubarray
timecomplexity
0
votes
0
answers
4
Cormen #Procedure #FindMaxCrossingSubarray
asked
May 12
in
Algorithms
by
ਮਾਧਵ ਨੰਦਨ
(
425
points)

18
views
algorithms
divideandconquer
maxcrossingsubarray
0
votes
1
answer
5
Cormen #DivideandConquer #Chapter 2 #Exercises
asked
May 10
in
Algorithms
by
ਮਾਧਵ ਨੰਦਨ
(
425
points)

71
views
algorithms
divideandconquer
mergesort
+2
votes
0
answers
6
Algorithm
You have an array A with n JPEG images some of which are identical. You can check if two objects are equal but you cannot compare them in any other wayi.e. you can check A[i] == A[j] and A[i] != A[j], but comparisons such as A[i] < A[j] ... of its elements are equal to each other. Use divide and conquer to come up with an O(n logn ) algorithm to determine if A has a majority element.
asked
May 2
in
Algorithms
by
Kushagra Chatterjee
Loyal
(
5.2k
points)

61
views
algorithms
timecomplexity
divideandconquer
0
votes
1
answer
7
IIT MS Question
find T(n) = T(n1)*T(n2), given T(1) = a and T(2) = b
asked
Apr 25
in
Algorithms
by
bittu
Junior
(
805
points)

164
views
recurrencerelation
divideandconquer
0
votes
0
answers
8
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
Loyal
(
6.9k
points)

53
views
divideandconquer
algorithms
asymptoticnotations
+1
vote
0
answers
9
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
(
105
points)

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

179
views
algorithms
timecomplexity
divideandconquer
+2
votes
1
answer
11
Time complexity of divide and conquer
asked
Nov 18, 2017
in
Algorithms
by
Parshu gate
Active
(
4.9k
points)

205
views
algorithms
divideandconquer
asymptoticnotations
+2
votes
2
answers
12
CLRS DivideandConquer Strassens's algorithm
asked
Oct 9, 2017
in
Algorithms
by
Manasi Srivastava
(
79
points)

176
views
algorithms
divideandconquer
dynamicprogramming
+2
votes
2
answers
13
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
(
667
points)

223
views
mastertheorem
mastermethod
algorithms
divideandconquer
+1
vote
4
answers
14
difference between dynamic programming and divide and conquer technique is
asked
Apr 17, 2017
in
Algorithms
by
LavTheRawkstar
Active
(
5k
points)

3.6k
views
divideandconquer
algorithms
dynamicprogramming
programming
+3
votes
1
answer
15
min max using divide and conquer
CAN SOMEONE SOLVE THE NUMBER OF COMPARISIONS FOR COMPUTING MIN AND MAX IN AN ARRAY USING DIVIDE N CONQUER?? RECURRENCE RELATION IS $ T(n) = 2 T(\frac{n}{2}) + 2 $ IT SHOULD COME TO $ \frac{3*n}{2}  2 $ ??
asked
Mar 23, 2017
in
Algorithms
by
sushmita
Boss
(
13.3k
points)

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

223
views
algorithms
divideandconquer
+2
votes
2
answers
17
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
Loyal
(
6.7k
points)

432
views
divideandconquer
+3
votes
1
answer
18
Divide and conquer+Dynamic
asked
Oct 8, 2016
in
Algorithms
by
Rahul Jain25
Boss
(
11.5k
points)

415
views
divideandconquer
dynamicprogramming
algorithms
+4
votes
0
answers
19
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
(
98.4k
points)

190
views
cmi2013
algorithms
sorting
divideandconquer
descriptive
+1
vote
0
answers
20
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 such as $A[i] < ... are equal 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
(
98.4k
points)

81
views
cmi2012
algorithms
divideandconquer
+3
votes
3
answers
21
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
Boss
(
38.7k
points)

363
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
Selected for M.Tech Computer Science in University of Hyderabad
Gate 2019 suggestion
IIIT Hyderabad interview Experience  2017
Experts please enlighten me!
IIT Gandhinagar MTECH CSE Interview Experience  May 8, 2018
Follow @csegate
Gatecse
Recent questions tagged divideandconquer
Recent Blog Comments
That is google form link. You may try ...
As far as I know, the institute is new and ...
Link
1. One offer per round according to your ...
ok . then also answer would remain same , if your ...
35,458
questions
42,705
answers
121,331
comments
42,105
users