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. For hardcopy of previous year questions please see
here
Recent questions tagged divideandconquer
0
votes
1
answer
1
Divide and conquer made easy
Is the answer to this solution is O( n2 log (n) ) or O( n log (n) )
asked
Sep 3
in
Algorithms
by
manvi_agarwal
(
109
points)

52
views
divideandconquer
0
votes
0
answers
2
WBSET 2017
A student develops a technique to multiply two 2×2 matrices. The technique requires six multiplications. The complexity of the module that combines the module is O(n2). Then the recursive equation depicting the complexity of the algorithm is (A) T(n) = 6T(n/3) + O(n2) (B) T(n) = 6T(n/2) + O(n2) (C) T(n) = 6T(2n ) + O(n2) (D) T(n) = T(n/2) + 6 O(n2)
asked
Aug 16
in
Algorithms
by
rohan.1737
(
81
points)

34
views
algorithms
divideandconquer
0
votes
1
answer
3
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?
asked
Aug 7
in
Algorithms
by
Sambhrant Maurya
Junior
(
673
points)

122
views
algorithms
divideandconquer
binarysearch
+3
votes
0
answers
4
GeeksForGeeks
Maximum Subarray Sum problem is to find the subarray with maximum sum. For example, given an array {12, 13, 5, 25, 20, 30, 10}, the maximum subarray sum is 45. The naive solution for this problem is to calculate sum of all subarrays starting with every element and return ... complexity using Divide and Conquer. A O(n) B O(nLogn) C O(Logn) D O(n2) Correct answer is B. O(nLogn) How?
asked
Jul 27
in
Algorithms
by
Rishav Kumar Singh
Active
(
4.2k
points)

56
views
divideandconquer
algorithms
0
votes
1
answer
5
ACE Algorithms volume 2 Divede and Conquer Q 11
asked
Jul 5
in
Algorithms
by
JAYKISHAN
(
21
points)

123
views
algorithms
acebooklet
divideandconquer
+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
(
8.3k
points)

110
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
(
921
points)

272
views
recurrence
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
(
8.1k
points)

85
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)

80
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
(
465
points)

202
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)

286
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)

213
views
algorithms
divideandconquer
dynamicprogramming
+2
votes
3
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
(
679
points)

259
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
(
5.1k
points)

3.7k
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.9k
points)

333
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.6k
points)

246
views
algorithms
divideandconquer
+3
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.8k
points)

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

446
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
(
101k
points)

201
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
(
101k
points)

93
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.8k
points)

386
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
kvs pgt
Algorithms GO Classroom
Programming and DS GO Classroom
Discrete Mathematics GO Classroom
Digital Logic GO Classroom
Follow @csegate
Gatecse
Recent questions tagged divideandconquer
Recent Blog Comments
@Arjun sir how to remove such post? should i hide...
[email protected]
.Plz do share @Sanjay sharma
Please post it as question
This is blog area post it as question
[email protected]
39,778
questions
46,781
answers
140,752
comments
58,672
users