GATE Overflow for GATE CSE - Recent questions tagged divide-and-conquer
https://gateoverflow.in/tag/divide-and-conquer
Powered by Question2AnswerDivide and conquer
https://gateoverflow.in/381614/divide-and-conquer
<p>How To Solve This Using Divide And Conquer</p>
<p>Suppose we are given the two n bit integers, assuming <strong>for</strong> common sense n as power of 2. It is required to multiply them using Divide & conquer method. What is the divide & conquer recurrence, that would arise <strong>for</strong> the problem.</p>
<p>1. T(n) = 4T(n/2) + O(1)</p>
<p>2. T(n) = 2T(n/2) + O(n)</p>
<p>3. T(n) = 4T(n/2) + O(n^2)</p>
<p>4. T(n) = 4T(n/2) + O(n)</p>Algorithmshttps://gateoverflow.in/381614/divide-and-conquerSun, 28 Aug 2022 03:19:03 +0000Best Open Video Playlist for Algorithm design techniques: Divide‐and‐Conquer Topic | Algorithm
https://gateoverflow.in/380755/playlist-algorithm-design-techniques-divide-conquer-algorithm
<p>Please list out the best free available video playlist for Algorithm design techniques: Divide‐and‐Conquer from Algorithm as an answer here (only one playlist per answer). We'll then select the best playlist and add to <a href="http://classroom.gateoverflow.in" rel="nofollow">GO classroom</a> video lists. You can add any video playlist link including your own (as long as they are free to access) but standard ones are more likely to be selected as best.<br>
<br>
For the full list of selected videos please see <a href="https://docs.google.com/spreadsheets/d/e/2PACX-1vQTEfCg28q1B_buKRxaVvUjN_CTu9UntAiqi9qBiZZesmJE6LnqfkuwxNQOsNcU1g/pubhtml" rel="nofollow">here</a></p>Study Resourceshttps://gateoverflow.in/380755/playlist-algorithm-design-techniques-divide-conquer-algorithmWed, 17 Aug 2022 19:09:35 +0000Self doubts
https://gateoverflow.in/368894/self-doubts
<p>T(n)=T(n/5)+T(7n/10)+an</p>
<p>a: constant</p>
<p>what will be the time complexity of the above <span dir="ltr">recurrence relation??</span></p>
<p><span dir="ltr">Please share the approach for this kind of recurrence relation</span></p>
<p> </p>Algorithmshttps://gateoverflow.in/368894/self-doubtsTue, 04 Jan 2022 04:05:58 +0000#selfDoubt
https://gateoverflow.in/367684/%23selfdoubt
Consider all the elements of an array is same and choosing pivot such a way that divides array into two equal parts. Then will it behave like QuickSort best case or worst case?Algorithmshttps://gateoverflow.in/367684/%23selfdoubtFri, 17 Dec 2021 04:38:02 +0000NIELIT Scientific Assistant A 2020 November: 63
https://gateoverflow.in/351397/nielit-scientific-assistant-a-2020-november-63
<p>What is the product of following matrix using Strassen’s matrix multiplication algorithm?</p>
<p>$$ A=\begin {bmatrix} 1&3\\ 5 &7 \end{bmatrix} \;\;\;\;\;\; B=\begin {bmatrix} 8&4\\ 6 &2 \end{bmatrix} $$</p>
<ol start="1" style="list-style-type:upper-alpha">
<li>$C_{11}=80; C_{12}=07;C_{21}=15;C_{22}=34$</li>
<li>$C_{11}=82; C_{12}=26;C_{21}=10;C_{22}=34$</li>
<li>$C_{11}=15; C_{12}=07;C_{21}=80;C_{22}=34$</li>
<li>$C_{11}=26; C_{12}=10;C_{21}=82;C_{22}=34$</li>
</ol>Algorithmshttps://gateoverflow.in/351397/nielit-scientific-assistant-a-2020-november-63Wed, 09 Dec 2020 07:19:14 +0000NIELIT 2017 DEC Scientific Assistant A - Section B: 39
https://gateoverflow.in/336807/nielit-2017-dec-scientific-assistant-a-section-b-39
<p>Merge sort uses :</p>
<ol style="list-style-type:upper-alpha" type="A">
<li>Divide-and-conquer</li>
<li>Backtracking</li>
<li>Heuristic approach</li>
<li>Greedy approach</li>
</ol>Algorithmshttps://gateoverflow.in/336807/nielit-2017-dec-scientific-assistant-a-section-b-39Tue, 31 Mar 2020 16:40:22 +0000NIELIT 2016 DEC Scientist B (IT) - Section B: 52
https://gateoverflow.in/336617/nielit-2016-dec-scientist-b-it-section-b-52
<p>Find the odd one out</p>
<ol start="1" style="list-style-type:upper-alpha">
<li>Merge Sort</li>
<li>TVSP Problem</li>
<li>Knapsack Problem</li>
<li>OBST Problem</li>
</ol>Algorithmshttps://gateoverflow.in/336617/nielit-2016-dec-scientist-b-it-section-b-52Tue, 31 Mar 2020 08:00:50 +0000QUICK SORT- SELF DOUBT
https://gateoverflow.in/319659/quick-sort-self-doubt
<p>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.</p>
<ol>
<li>O($n^2$)</li>
<li>O($n^3$)</li>
<li>O(nlogn)</li>
<li>O(n)</li>
</ol>Algorithmshttps://gateoverflow.in/319659/quick-sort-self-doubtMon, 02 Sep 2019 17:04:32 +0000Cormen Edition 3 Exercise 4.1 Question 5 (Page No. 74)
https://gateoverflow.in/308816/cormen-edition-3-exercise-4-1-question-5-page-no-74
Use the following ideas to develop a nonrecursive, linear-time algorithm for the maximum-subarray 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 subarray of $A[1…j]$, extend the answer to find a maximum subarray ending at index $j+1$ by using the following observation: a maximum subarray of $A[1...j+1]$ is either a maximum subarray of $A[1...j]$ or a subarray $A[1...j+1]$, for some $1\leq i\leq j+1$. Determine a maximum subarray of the form $A[i...j+1]$ inconstant time based on knowing a maximum subarray ending at index $j .$Algorithmshttps://gateoverflow.in/308816/cormen-edition-3-exercise-4-1-question-5-page-no-74Fri, 05 Apr 2019 03:12:25 +0000Cormen Edition 3 Exercise 4.1 Question 4 (Page No. 74)
https://gateoverflow.in/308815/cormen-edition-3-exercise-4-1-question-4-page-no-74
Suppose we change the definition of the $maximum-subarray 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?Algorithmshttps://gateoverflow.in/308815/cormen-edition-3-exercise-4-1-question-4-page-no-74Fri, 05 Apr 2019 03:06:38 +0000Cormen Edition 3 Exercise 4.1 Question 3 (Page No. 74)
https://gateoverflow.in/308814/cormen-edition-3-exercise-4-1-question-3-page-no-74
Implement both the brute-force 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 brute-force algorithm? Then, change the base case of the recursive algorithm to use the brute-force algorithm whenever the problem size is less than $n_0$. Does that change the crossover point?Algorithmshttps://gateoverflow.in/308814/cormen-edition-3-exercise-4-1-question-3-page-no-74Fri, 05 Apr 2019 03:04:47 +0000Cormen Edition 3 Exercise 4.1 Question 2 (Page No. 74)
https://gateoverflow.in/308813/cormen-edition-3-exercise-4-1-question-2-page-no-74
Write pseudo code for the brute-force method of solving the $maximum-subarray$ problem. Your procedure should run in $\Theta(n^2)$ time.Algorithmshttps://gateoverflow.in/308813/cormen-edition-3-exercise-4-1-question-2-page-no-74Fri, 05 Apr 2019 03:02:40 +0000UPPCL AE 2018:12
https://gateoverflow.in/289521/uppcl-ae-2018-12
<p>Given below are some famous algorithms and some algorithm design paradigms</p>
<p>$$\begin{array} {|l|l|} \hline \qquad \qquad \qquad \textbf{Algorithms} & \textbf{Design Paradigms} \\\hline \text{1. Dijkstra’s shortest path algorithm} & \text{(a) Greedy design} \\\hline \text{2. Floyd Warshall’s all-pair-shortest path algorithm} & \text{(b) Divide and conquer} \\\hline \text{3. Kruskal’s minimum spanning tree algorithm} & \text{(c) Dynamic programming} \\\hline \text{4. Merge Sort algorithm} & \\\hline \end{array}$$</p>
<p>Which of the following correspondence is correct?</p>
<ol start="1" style="list-style-type:upper-alpha">
<li>$\text{1-(a), 2-(c), 3-(a), 4-(b)}$</li>
<li>$\text{1-(a), 2-(b), 3-(a), 4-(c)}$</li>
<li>$\text{1-(a), 2-(b), 3-(c), 4-(c)}$</li>
<li>$\text{1-(c), 2-(b), 3-(a), 4-(b)}$</li>
</ol>Algorithmshttps://gateoverflow.in/289521/uppcl-ae-2018-12Sat, 05 Jan 2019 04:37:40 +0000UPPCL
https://gateoverflow.in/283941/uppcl
<p>how many terms will be computed to determine the value of C(10,8) using divide and conquer algo ?</p>
<ol style="list-style-type:lower-alpha" type="a">
<li>88</li>
<li>89</li>
<li>90</li>
<li>91</li>
</ol>
<p> </p>Algorithmshttps://gateoverflow.in/283941/uppclMon, 24 Dec 2018 17:16:52 +0000general
https://gateoverflow.in/268894/general
how many terms will be computed to determine the value of 10C8 using divide and conquer strategy and dynamic programming?<br />
<br />
for divide and conquer ans is 89 <br />
<br />
how to compute please explainAlgorithmshttps://gateoverflow.in/268894/generalThu, 22 Nov 2018 12:37:03 +0000Merge Sort Doubt
https://gateoverflow.in/250430/merge-sort-doubt
what is the recurrence relation for merge sort?Algorithmshttps://gateoverflow.in/250430/merge-sort-doubtSat, 06 Oct 2018 12:03:31 +0000#Divide and Conquer
https://gateoverflow.in/240267/%23divide-and-conquer
What is the time complexity of calculating power of an element using DAC?Algorithmshttps://gateoverflow.in/240267/%23divide-and-conquerWed, 05 Sep 2018 05:31:07 +0000Divide and conquer made easy
https://gateoverflow.in/239844/divide-and-conquer-made-easy
<p> </p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=3133545289356545478"></p>
<p>Is the answer to this solution is O( n2 log (n) ) or O( n log (n) )</p>Algorithmshttps://gateoverflow.in/239844/divide-and-conquer-made-easyMon, 03 Sep 2018 12:28:51 +0000Made easy , divide and conquer
https://gateoverflow.in/239843/made-easy-divide-and-conquer
<p><a href="https://gateoverflow.in/?qa=blob&qa_blobid=11583750777176064728" rel="nofollow">https://gateoverflow.in/?qa=blob&qa_blobid=</a><a href="https://gateoverflow.in/?qa=blob&qa_blobid=11583750777176064728" rel="nofollow">11583750777176064728</a></p>
<p>Approach please</p>Algorithmshttps://gateoverflow.in/239843/made-easy-divide-and-conquerMon, 03 Sep 2018 12:23:52 +0000WBSET 2017
https://gateoverflow.in/233943/wbset-2017
<p><span style="font-size: larger;">A student develops a technique to multiply<br>
two 2×2 matrices. The technique requires six<br>
multiplications. The complexity of the module that<br>
combines the module is O(n2). Then the recursive<br>
equation depicting the complexity of the algorithm is</span></p>
<h3><span style="font-size: larger;">(A) T(n) = 6T(n/3) + O(n2)</span></h3>
<h3><span style="font-size: larger;">(B) T(n) = 6T(n/2) + O(n2)</span></h3>
<h3><span style="font-size: larger;">(C) T(n) = 6T(2n ) + O(n2)</span></h3>
<h3><span style="font-size: larger;">(D) T(n) = T(n/2) + 6 O(n2)</span></h3>Algorithmshttps://gateoverflow.in/233943/wbset-2017Thu, 16 Aug 2018 16:03:00 +0000Ace Algorithms
https://gateoverflow.in/231452/ace-algorithms
If k is a positive constant, then the following divide and conquer recurrence evaluates to?<br />
<br />
T(n) = k ; n=1<br />
<br />
T(n) = 3 T (n/2) + kn ;n>1<br />
<br />
a)T(n)= 3kn2-kn<br />
<br />
b)T(n)=3kn log23 - 2kn<br />
<br />
c)T(n)=3knlog23 - kn<br />
<br />
d)T(n)=3kn2-2knlog23Algorithmshttps://gateoverflow.in/231452/ace-algorithmsTue, 07 Aug 2018 07:04:08 +0000Ace Algorithms
https://gateoverflow.in/231365/ace-algorithms
Leading element in an array of n elements is the element which occurs more than n/2 times in the array.<br />
<br />
a) What is the time complexity to find whether a leading element exists or not in a sorted array of n elements?<br />
<br />
b)What is the time complexity to find whether a leading element exists or not in an array whose range of values are between 0 to n?<br />
<br />
c)What is the time complexity to find whether leading element exists or not in an unsorted array of n elements?Algorithmshttps://gateoverflow.in/231365/ace-algorithmsMon, 06 Aug 2018 18:46:14 +0000ACE volume 2 divide and conquer
https://gateoverflow.in/229400/ace-volume-2-divide-and-conquer
given an array that contain only two value (0 or 1) and an insertion sort is used to sort that array,<br />
<br />
which of the following input require maximum number of comparisons ?<br />
<br />
a)111111000000 b)101010101010<br />
<br />
c)000000111111 c)010101010101<br />
<br />
here, ans is option (a) but i have a doubt that to compare all the above option it required same number of copamrison<br />
<br />
bcz in insertion sort it compare to each element and the move that element to specified position.<br />
<br />
then how option (a) is correct plz explain me.Algorithmshttps://gateoverflow.in/229400/ace-volume-2-divide-and-conquerMon, 30 Jul 2018 05:27:46 +0000Ace volume-2 divide and conquer method
https://gateoverflow.in/229398/ace-volume-2-divide-and-conquer-method
suppose merge sort takes 2 sec to sort a set of 64 keys then how much time will take to sort a set of 512 keys?<br />
<br />
here, ans is 24 sec how it is plz explain me.Algorithmshttps://gateoverflow.in/229398/ace-volume-2-divide-and-conquer-methodMon, 30 Jul 2018 05:16:45 +0000GeeksForGeeks
https://gateoverflow.in/228863/geeksforgeeks
<p>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 the maximum of all. We can solve this using Divide and Conquer, what will be the worst case time complexity using Divide and Conquer.</p>
<table>
<tbody>
<tr>
</tr>
<tr>
<td>
<p>A</p>
</td>
<td>
<p>O(n)</p>
</td>
</tr>
<tr>
<td>B</td>
<td>
<p>O(nLogn)</p>
</td>
</tr>
<tr>
<td>
<p>C</p>
</td>
<td>
<p>O(Logn)</p>
</td>
</tr>
<tr>
<td>D</td>
<td>O(n<sup>2</sup>)</td>
</tr>
</tbody>
</table>
<p>Correct answer is B. O(nLogn) How? </p>Algorithmshttps://gateoverflow.in/228863/geeksforgeeksFri, 27 Jul 2018 15:29:41 +0000ACE Algorithms volume 2 Divede and Conquer Q 11
https://gateoverflow.in/223849/ace-algorithms-volume-2-divede-and-conquer-q-11
<p>Given two sorted double linked list L1 and L2 of <em>n</em> elements each, which of the following are true?</p>
<p>(A) L1 and L2 can be merged into single sorted list in<em> Θ(n)</em> time.</p>
<p>(B) L1 and L2 can be merged into single sorted list in <em>Θ(1)</em> time.</p>
<p>(C) L1 and L2 can be merged into single sorted list in <em>Θ(nlogn)</em> time.</p>
<p>(D) L1 and L2 can be merged into single sorted list in <em>Θ(n<sup>2</sup>)</em> time.</p>Algorithmshttps://gateoverflow.in/223849/ace-algorithms-volume-2-divede-and-conquer-q-11Thu, 05 Jul 2018 07:40:59 +0000Algorithm
https://gateoverflow.in/215288/algorithm
You have an array A with n JPEG images some of which are identical.<br />
<br />
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] < A[j] are not meaningful.<br />
<br />
The array A is said to have a majority element if strictly more than half of its elements are equal to each other.<br />
<br />
Use divide and conquer to come up with an O(n logn ) algorithm to determine if A has a majority element.Algorithmshttps://gateoverflow.in/215288/algorithmWed, 02 May 2018 07:51:39 +0000IIT MS Question
https://gateoverflow.in/214226/iit-ms-question
find T(n) = T(n-1)*T(n-2), given T(1) = a and T(2) = bAlgorithmshttps://gateoverflow.in/214226/iit-ms-questionWed, 25 Apr 2018 15:38:57 +0000divide and conquer
https://gateoverflow.in/193808/divide-and-conquer
<h3><code>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)</code></h3>
<h3> </h3>
<h3><code>How to reach this type of analysis where we get to know that we have to divide n into halves?</code></h3>Algorithmshttps://gateoverflow.in/193808/divide-and-conquerFri, 12 Jan 2018 12:40:10 +0000Test series
https://gateoverflow.in/189953/test-series
<p>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___?</p>
<ol>
<li> 230 & 517</li>
<li> 229 & 516</li>
<li> 231 & 518</li>
<li> 232 & 519</li>
</ol>Algorithmshttps://gateoverflow.in/189953/test-seriesFri, 05 Jan 2018 01:21:37 +0000Multiplication of two long intergers
https://gateoverflow.in/188628/multiplication-of-two-long-intergers
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=14194274207283151046"></p>Algorithmshttps://gateoverflow.in/188628/multiplication-of-two-long-intergersTue, 02 Jan 2018 01:07:14 +0000ACE test series
https://gateoverflow.in/183893/ace-test-series
<p>please help me to understand <img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=13212390957505737853"></p>Algorithmshttps://gateoverflow.in/183893/ace-test-seriesThu, 21 Dec 2017 12:27:36 +0000Time complexity of divide and conquer
https://gateoverflow.in/171548/time-complexity-of-divide-and-conquer
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=15582368689675775794"></p>Algorithmshttps://gateoverflow.in/171548/time-complexity-of-divide-and-conquerSat, 18 Nov 2017 04:07:03 +0000Long integer multiplication
https://gateoverflow.in/158896/long-integer-multiplication
Given 2 long integers having n digits , it is required to multiply them.Assuming the numbers are represented in an array of size n . The time complexity to multiply them using traditional divide and conquer isAlgorithmshttps://gateoverflow.in/158896/long-integer-multiplicationTue, 10 Oct 2017 00:04:17 +0000CLRS Divide-and-Conquer Strassens's algorithm
https://gateoverflow.in/158752/clrs-divide-and-conquer-strassenss-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?Algorithmshttps://gateoverflow.in/158752/clrs-divide-and-conquer-strassenss-algorithmMon, 09 Oct 2017 11:26:10 +0000Divide and Conquer
https://gateoverflow.in/149608/divide-and-conquer
Given an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array where k is a positive integer smaller than size of array. Which sorting algo can be easily modified for sorting this array and what is the obtainable time complexity ?Algorithmshttps://gateoverflow.in/149608/divide-and-conquerSun, 03 Sep 2017 09:55:03 +0000algorithm
https://gateoverflow.in/139603/algorithm
time complexity of multiplying two long integers of n - digits each using divide and conquer method is<br />
<br />
a)O(n^2)<br />
<br />
b)O(n)<br />
<br />
c)O(n^3)<br />
<br />
d)O(n logn)Algorithmshttps://gateoverflow.in/139603/algorithmMon, 24 Jul 2017 06:23:06 +0000Introduction to Algorithm 3rd ed
https://gateoverflow.in/139021/introduction-to-algorithm-3rd-ed
<p>I implemented <strong>maximum sub-array problem</strong> with <strong>Divide and Conquer</strong> approach in <em>c++ and python</em>. 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 first I implemented something like that.</p>
<p>I used vector <strong>A={13,-3,-25,20,-3,-16,-23,18,20,-7,12,-5,-22}</strong></p>
<p>and in python I used list <strong>A=[13,-3,-25,20,-3,-16,-23,18,20,-7,12,-5,-22]</strong></p>
<p><strong>(1)</strong> for i = mid <strong>downto</strong> low</p>
<p> and </p>
<p><strong>(2)</strong> for i =low <strong>upto </strong>mid</p>
<p><strong>(1)</strong> C++ Source Code: <a href="https://ideone.com/SxbJOe" rel="nofollow">https://ideone.com/SxbJOe</a> (check line 13 (for loop))</p>
<p><strong>(2)</strong> C++ Source Code: <a href="https://ideone.com/hThJgI" rel="nofollow">https://ideone.com/hThJgI</a> (check line 13 (for loop))</p>
<p><strong>(1)</strong> Python Source Code: <a href="https://ideone.com/Ovg6bl" rel="nofollow">https://ideone.com/Ovg6bl</a> (check line 4(for loop))</p>
<p><strong>(2)</strong> Python Source Code: <a href="https://ideone.com/7YS8OT" rel="nofollow">https://ideone.com/7YS8OT</a> (check line 4(for loop))</p>
<p>In first case I am getting right output i.e 43 but in 2nd I am getting 56 as the output! Please help!</p>Algorithmshttps://gateoverflow.in/139021/introduction-to-algorithm-3rd-edFri, 21 Jul 2017 05:00:56 +0000Ace practice book
https://gateoverflow.in/130113/ace-practice-book
how to apply master's method for this recurrence relation <br />
<br />
$T\left ( n \right )= {}\sqrt{n}T\left ( {\sqrt{n}} \right )+n$Algorithmshttps://gateoverflow.in/130113/ace-practice-bookThu, 18 May 2017 19:40:23 +0000difference between dynamic programming and divide and conquer technique is
https://gateoverflow.in/125936/difference-between-dynamic-programming-conquer-technique
What is the difference between dynamic programming and divide and conquer technique,Algorithmshttps://gateoverflow.in/125936/difference-between-dynamic-programming-conquer-techniqueMon, 17 Apr 2017 07:46:14 +0000coremen
https://gateoverflow.in/124153/coremen
what is difference between divide and conquer and dynamic programming?Algorithmshttps://gateoverflow.in/124153/coremenWed, 05 Apr 2017 05:14:32 +0000min max using divide and conquer
https://gateoverflow.in/122408/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??<br />
<br />
RECURRENCE RELATION IS<br />
<br />
$ T(n) = 2 T(\frac{n}{2}) + 2 $<br />
<br />
IT SHOULD COME TO $ \frac{3*n}{2} - 2 $<br />
<br />
??Algorithmshttps://gateoverflow.in/122408/min-max-using-divide-and-conquerThu, 23 Mar 2017 17:52:38 +0000Test by Bikram | Mock GATE | Test 3 | Question: 23
https://gateoverflow.in/117673/test-by-bikram-mock-gate-test-3-question-23
<p>Partitioning and Merging are the two main parts of $Quick Sort$.<br>
<br>
Which of the following is TRUE?</p>
<ol style="list-style-type:upper-alpha">
<li> Partitioning is the key step while Merging is trivial.</li>
<li> Partitioning is trivial while Merging is the key step.</li>
<li> Both Partitioning and Merging are trivial.</li>
<li> Both Partitioning and Merging are key steps.</li>
</ol>GATEhttps://gateoverflow.in/117673/test-by-bikram-mock-gate-test-3-question-23Thu, 09 Feb 2017 15:51:05 +0000Divide and conquer
https://gateoverflow.in/116863/divide-and-conquer
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=7943001960008370790"></p>
<p><strong>Reply with solution @Arjun sir,@habibkhan,@vijaycs</strong></p>Algorithmshttps://gateoverflow.in/116863/divide-and-conquerTue, 07 Feb 2017 07:45:15 +0000min-max algo
https://gateoverflow.in/110268/min-max-algo
The minimum number of comparisons required to find the minimum and maximum of 60 numbers is____Algorithmshttps://gateoverflow.in/110268/min-max-algoTue, 24 Jan 2017 06:15:52 +0000No of multiplications
https://gateoverflow.in/92875/no-of-multiplications
<p style="text-align:center"><img alt="" height="114" src="https://gateoverflow.in/?qa=blob&qa_blobid=5536231538321446438" width="580"></p>Algorithmshttps://gateoverflow.in/92875/no-of-multiplicationsThu, 15 Dec 2016 05:33:36 +0000COMPLEXITY
https://gateoverflow.in/80478/complexity
Suppose that the votes of n people for different candidates (where there can be more than two candidates) for a particular office are the elements of a sequence. A person wins the election if this person receives a majority of the votes. What is the time complexity to find a candidate who receives majority of the votes using divide and conquer approach?Algorithmshttps://gateoverflow.in/80478/complexityWed, 09 Nov 2016 07:35:04 +0000Divide and Conquer
https://gateoverflow.in/78110/divide-and-conquer
<p>Merging K sorted list each of size n/k into one sorted list of n-elements using <strong>Heap Sort </strong>will take how much time?</p>Algorithmshttps://gateoverflow.in/78110/divide-and-conquerTue, 01 Nov 2016 16:13:09 +0000