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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
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
QUICK SORT SELF DOUBT
In quick sort for sorting of n Numbers, the 75th greatest Element is selected as pivot using $O(n^2)$ time complexity algorithm than what is the worst case time complexity of quick sort. O($n^2$) O($n^3$) O(nlogn) O(n)
asked
Sep 2
in
Algorithms
by
ajaysoni1924
Boss
(
10.3k
points)

94
views
algorithms
divideandconquer
quicksort
0
votes
0
answers
2
Cormen Edition 3 Exercise 4.1 Question 5 (Page No. 74)
Use the following ideas to develop a nonrecursive, lineartime algorithm for the maximumsubarray problem. Start at the left end of the array, and progress toward the right, keeping track of the maximum subarray seen so far. Knowing a maximum ... the form $A[i...j+1]$ inconstant time based on knowing a maximum subarray ending at index $j .$
asked
Apr 5
in
Algorithms
by
akash.dinkar12
Boss
(
41.4k
points)

41
views
cormen
algorithms
divideandconquer
descriptive
0
votes
0
answers
3
Cormen Edition 3 Exercise 4.1 Question 4 (Page No. 74)
Suppose we change the definition of the $maximumsubarray problem$ to allow the result to be an empty subarray, where the sum of the values of an empty subarray is $0$. How would you change any of the algorithms that do not allow empty subarrays to permit an empty subarray to be the result?
asked
Apr 5
in
Algorithms
by
akash.dinkar12
Boss
(
41.4k
points)

22
views
cormen
algorithms
divideandconquer
descriptive
0
votes
0
answers
4
Cormen Edition 3 Exercise 4.1 Question 3 (Page No. 74)
Implement both the bruteforce and recursive algorithms for the $maximumsubarray$ problem on your own computer. What problem size $n_0$ gives the crossover point at which the recursive algorithm beats the bruteforce algorithm? Then, ... bruteforce algorithm whenever the problem size is less than $n_0$. Does that change the crossover point?
asked
Apr 5
in
Algorithms
by
akash.dinkar12
Boss
(
41.4k
points)

13
views
cormen
algorithms
divideandconquer
descriptive
0
votes
0
answers
5
Cormen Edition 3 Exercise 4.1 Question 2 (Page No. 74)
Write pseudo code for the bruteforce method of solving the $maximumsubarray$ problem. Your procedure should run in $\Theta(n^2)$ time.
asked
Apr 5
in
Algorithms
by
akash.dinkar12
Boss
(
41.4k
points)

16
views
cormen
algorithms
divideandconquer
descriptive
0
votes
0
answers
6
UPPCL
how many terms will be computed to determine the value of C(10,8) using divide and conquer algo ? 88 89 90 91
asked
Dec 24, 2018
in
Algorithms
by
Satbir
Boss
(
18k
points)

80
views
divideandconquer
0
votes
1
answer
7
Merge Sort Doubt
what is the recurrence relation for merge sort?
asked
Oct 6, 2018
in
Algorithms
by
aditi19
Active
(
4.3k
points)

117
views
mergesort
algorithms
timecomplexity
#recurrencerelations
sorting
divideandconquer
0
votes
1
answer
8
Divide and conquer made easy
Is the answer to this solution is O( n2 log (n) ) or O( n log (n) )
asked
Sep 3, 2018
in
Algorithms
by
manvi_agarwal
(
99
points)

165
views
divideandconquer
+1
vote
2
answers
9
Made easy , divide and conquer
https://gateoverflow.in/?qa=blob&qa_blobid=11583750777176064728 Approach please
asked
Sep 3, 2018
in
Algorithms
by
manvi_agarwal
(
99
points)

78
views
algorithms
divideandconquer
+1
vote
0
answers
10
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, 2018
in
Algorithms
by
rohan.1737
(
127
points)

71
views
algorithms
divideandconquer
+1
vote
1
answer
11
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, 2018
in
Algorithms
by
Sambhrant Maurya
Active
(
2.7k
points)

262
views
algorithms
divideandconquer
binarysearch
+3
votes
0
answers
12
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, 2018
in
Algorithms
by
Rishav Kumar Singh
Loyal
(
5.4k
points)

169
views
divideandconquer
algorithms
0
votes
1
answer
13
ACE Algorithms volume 2 Divede and Conquer Q 11
Given two sorted double linked list L1 and L2 of n elements each, which of the following are true? (A) L1 and L2 can be merged into single sorted list in Θ(n) time. (B) L1 and L2 can be merged into single sorted list in Θ(1) time. ( ... merged into single sorted list in Θ(nlogn) time. (D) L1 and L2 can be merged into single sorted list in Θ(n2) time.
asked
Jul 5, 2018
in
Algorithms
by
JAYKISHAN
(
89
points)

161
views
algorithms
acebooklet
divideandconquer
+2
votes
0
answers
14
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, 2018
in
Algorithms
by
Kushagra Chatterjee
Loyal
(
9.6k
points)

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

334
views
recurrence
divideandconquer
0
votes
0
answers
16
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, 2018
in
Algorithms
by
iarnav
Loyal
(
8k
points)

132
views
divideandconquer
algorithms
asymptoticnotations
+1
vote
0
answers
17
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, 2018
in
Algorithms
by
vinay9427
(
93
points)

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

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

446
views
algorithms
divideandconquer
asymptoticnotations
+2
votes
2
answers
20
CLRS DivideandConquer Strassens's algorithm
Do we need to study the Strassens's algorithm in detail like proof or working of that algorithm or we just need to know the time complexity of the algorithm because I can't find it's explanation anywhere?
asked
Oct 9, 2017
in
Algorithms
by
Manasi Srivastava
(
61
points)

283
views
algorithms
divideandconquer
dynamicprogramming
+1
vote
0
answers
21
Introduction to Algorithm 3rd ed
I implemented maximum subarray problem with Divide and Conquer approach in c++ and python. I got little bit of confusion in the implementation.Below are the implementations. I got different results when I change the for loop of both c++ and python code.in ... In first case I am getting right output i.e 43 but in 2nd I am getting 56 as the output! Please help!
asked
Jul 21, 2017
in
Algorithms
by
Alabhya Pandey
(
11
points)

116
views
divideandconquer
maximumsubarrayproblem
algorithms
cormen
+2
votes
3
answers
22
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
(
789
points)

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

4.5k
views
divideandconquer
algorithms
dynamicprogramming
programming
+3
votes
1
answer
24
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
(
16.6k
points)

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

317
views
algorithms
divideandconquer
+3
votes
2
answers
26
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)

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

513
views
divideandconquer
dynamicprogramming
algorithms
+5
votes
0
answers
28
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
(
99.6k
points)

240
views
cmi2013
algorithms
sorting
divideandconquer
descriptive
+1
vote
1
answer
29
CMI2012B04
You have an array $A$ with $n$ ... 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
(
99.6k
points)

137
views
cmi2012
algorithms
divideandconquer
+4
votes
3
answers
30
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.3k
points)

584
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
GATE 2020 Application Form Opened!
My GATE Preparation Journey
ISI MTECH CS 2019 INTERVIEW EXPERIENCE
IIT HYDERABAD MTECH TA INTERVIEW EXPERIENCE
How to prepare for GATE with a fulltime job??
Follow @csegate
Recent questions tagged divideandconquer
Recent Blog Comments
will pdfs be uploaded ?
6th...
Sir
4th...
49,984
questions
55,138
answers
190,496
comments
85,160
users