Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged divide-and-conquer
3
votes
1
answer
1
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 28
You are given a bit-array $A[1 \ldots n]$ (i.e., $A[i] \in\{0,1\}$ for each $i$ ) and told that this is a "$0$ -to-$1$ ... of the best divide-and-conquer algorithm? $\Theta(\log n)$ $\Theta(n \log n)$ $\Theta(n)$ $\Theta\left(n^{2}\right)$
GO Classes
asked
in
Algorithms
Jan 21
by
GO Classes
509
views
goclasses2024-mockgate-12
goclasses
algorithms
divide-and-conquer
2-marks
0
votes
0
answers
2
Made Easy Workbook
Huzaifa0111
asked
in
Algorithms
Aug 27, 2023
by
Huzaifa0111
161
views
divide-and-conquer
algorithms
made-easy-booklet
1
vote
1
answer
3
Made Easy Test Series 2024
Which of the following statement(s) is/are true? (a) Quicksort and merge sort are both examples of divide and conquer algorithms. (b) If we randomly choose a pivot element each time, quicksort will always terminate in time $O(n log n).$ (c) For every fixed ... in time $O(1)$, quicksort would have worst case complexity $O(n log n)$. plese give answer and explain it why ?
Ray Tomlinson
asked
in
Algorithms
Aug 9, 2023
by
Ray Tomlinson
860
views
made-easy-test-series
made-easy-booklet
algorithms
divide-and-conquer
quick-sort
merge-sort
time-complexity
0
votes
1
answer
4
Consider a divide and conquer algorithm that divides an input of size n into a subproblems, each of size n/b, and the cost of dividing and merging the problems is given by f(n) = Θ(n^c). The Master Theorem classifies this into different cases based on the value of c in relation to log_b(a). Could you explain the intuition and reasoning behind these classifications?
dhruba
asked
in
Algorithms
May 29, 2023
by
dhruba
411
views
algorithms
time-complexity
divide-and-conquer
1
vote
1
answer
5
Divide and conquer
How To Solve This Using Divide And Conquer Suppose we are given the two n bit integers, assuming for 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 for the problem. 1. T(n) = 4T(n/2) + O(1) 2. T(n) = 2T(n/2) + O(n) 3. T(n) = 4T(n/2) + O(n^2) 4. T(n) = 4T(n/2) + O(n)
[ Jiren ]
asked
in
Algorithms
Aug 28, 2022
by
[ Jiren ]
467
views
algorithms
divide-and-conquer
recurrence-relation
0
votes
0
answers
6
Best Open Video Playlist for Algorithm design techniques: Divide‐and‐Conquer Topic | Algorithm
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 ... more likely to be selected as best. For the full list of selected videos please see here
makhdoom ghaya
asked
in
Study Resources
Aug 17, 2022
by
makhdoom ghaya
217
views
go-classroom
video-links
missing-videos
free-videos
divide-and-conquer
4
votes
1
answer
7
GO Classes Test Series 2023 | Algorithms | Test 1 | Question: 19
You are given a bit-array $A[1 \ldots n]$ (i.e., $A[i] \in\{0,1\}$ for each $i$ ) and told that this is a "$0$ -to-$1$ ... complexity of best divide and conquer algorithm? $\Theta(\log n)$ $\Theta(n \log n)$ $\Theta(n)$ $\Theta\left(n^{2}\right)$
GO Classes
asked
in
Algorithms
Jun 13, 2022
by
GO Classes
236
views
goclasses2024-algo-1-weekly-quiz
goclasses
algorithms
divide-and-conquer
2-marks
1
vote
1
answer
8
Self doubts
T(n)=T(n/5)+T(7n/10)+an a: constant what will be the time complexity of the above recurrence relation?? Please share the approach for this kind of recurrence relation
lalitver10
asked
in
Algorithms
Jan 4, 2022
by
lalitver10
592
views
algorithms
recurrence-relation
time-complexity
divide-and-conquer
0
votes
0
answers
9
#selfDoubt
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?
BHOJARAM
asked
in
Algorithms
Dec 17, 2021
by
BHOJARAM
502
views
divide-and-conquer
1
vote
1
answer
10
NIELIT Scientific Assistant A 2020 November: 63
What is the product of following matrix using Strassen's matrix multiplication algorithm? $ A=\begin {bmatrix} 1&3\\ 5 &7 \end{bmatrix} \;\;\;\;\;\; B=\begin {bmatrix} 8&4\\ 6 &2 \end{bmatrix} $ $C_{11}=80; C_{12}=07;C_{21}=15;C_{22}=34$ ... $C_{11}=15; C_{12}=07;C_{21}=80;C_{22}=34$ $C_{11}=26; C_{12}=10;C_{21}=82;C_{22}=34$
gatecse
asked
in
Algorithms
Dec 9, 2020
by
gatecse
541
views
nielit-sta-2020
algorithms
divide-and-conquer
6
votes
5
answers
11
NIELIT 2017 DEC Scientific Assistant A - Section B: 39
Merge sort uses : Divide-and-conquer Backtracking Heuristic approach Greedy approach
admin
asked
in
Algorithms
Mar 31, 2020
by
admin
1.6k
views
nielit2017dec-assistanta
algorithms
sorting
merge-sort
divide-and-conquer
1
vote
4
answers
12
NIELIT 2016 DEC Scientist B (IT) - Section B: 52
Find the odd one out Merge Sort TVSP Problem Knapsack Problem OBST Problem
admin
asked
in
Algorithms
Mar 31, 2020
by
admin
3.2k
views
nielit2016dec-scientistb-it
algorithms
easy
dynamic-programming
divide-and-conquer
0
votes
3
answers
13
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)
ajaysoni1924
asked
in
Algorithms
Sep 2, 2019
by
ajaysoni1924
3.5k
views
algorithms
divide-and-conquer
quick-sort
0
votes
0
answers
14
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 ... the form $A[i...j+1]$ inconstant time based on knowing a maximum subarray ending at index $j .$
akash.dinkar12
asked
in
Algorithms
Apr 5, 2019
by
akash.dinkar12
382
views
cormen
algorithms
divide-and-conquer
descriptive
0
votes
0
answers
15
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?
akash.dinkar12
asked
in
Algorithms
Apr 5, 2019
by
akash.dinkar12
246
views
cormen
algorithms
divide-and-conquer
descriptive
0
votes
0
answers
16
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, ... brute-force algorithm whenever the problem size is less than $n_0$. Does that change the crossover point?
akash.dinkar12
asked
in
Algorithms
Apr 5, 2019
by
akash.dinkar12
328
views
cormen
algorithms
divide-and-conquer
descriptive
0
votes
0
answers
17
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.
akash.dinkar12
asked
in
Algorithms
Apr 5, 2019
by
akash.dinkar12
286
views
cormen
algorithms
divide-and-conquer
descriptive
0
votes
0
answers
18
UPPCL
how many terms will be computed to determine the value of C(10,8) using divide and conquer algo ? 88 89 90 91
Satbir
asked
in
Algorithms
Dec 24, 2018
by
Satbir
526
views
divide-and-conquer
0
votes
0
answers
19
general
how many terms will be computed to determine the value of 10C8 using divide and conquer strategy and dynamic programming? for divide and conquer ans is 89 how to compute please explain
Amit puri
asked
in
Algorithms
Nov 22, 2018
by
Amit puri
268
views
dynamic-programming
divide-and-conquer
0
votes
3
answers
20
Merge Sort Doubt
what is the recurrence relation for merge sort?
aditi19
asked
in
Algorithms
Oct 6, 2018
by
aditi19
1.1k
views
merge-sort
algorithms
time-complexity
recurrence-relation
sorting
divide-and-conquer
0
votes
2
answers
21
#Divide and Conquer
What is the time complexity of calculating power of an element using DAC?
Rustam Ali
asked
in
Algorithms
Sep 5, 2018
by
Rustam Ali
1.7k
views
divide-and-conquer
time-complexity
0
votes
1
answer
22
Divide and conquer made easy
Is the answer to this solution is O( n2 log (n) ) or O( n log (n) )
manvi_agarwal
asked
in
Algorithms
Sep 3, 2018
by
manvi_agarwal
1.0k
views
divide-and-conquer
made-easy-test-series
1
vote
2
answers
23
Made easy , divide and conquer
https://gateoverflow.in/?qa=blob&qa_blobid=11583750777176064728 Approach please
manvi_agarwal
asked
in
Algorithms
Sep 3, 2018
by
manvi_agarwal
673
views
algorithms
divide-and-conquer
made-easy-test-series
1
vote
0
answers
24
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)
rohan.1737
asked
in
Algorithms
Aug 16, 2018
by
rohan.1737
460
views
algorithms
divide-and-conquer
0
votes
1
answer
25
Ace Algorithms
If k is a positive constant, then the following divide and conquer recurrence evaluates to? T(n) = k ; n=1 T(n) = 3 T (n/2) + kn ;n>1 a)T(n)= 3kn2-kn b)T(n)=3kn log23 - 2kn c)T(n)=3knlog23 - kn d)T(n)=3kn2-2knlog23
Sambhrant Maurya
asked
in
Algorithms
Aug 7, 2018
by
Sambhrant Maurya
397
views
recurrence-relation
divide-and-conquer
time-complexity
3
votes
1
answer
26
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?
Sambhrant Maurya
asked
in
Algorithms
Aug 6, 2018
by
Sambhrant Maurya
1.9k
views
algorithms
divide-and-conquer
binary-search
1
vote
2
answers
27
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, which of the following input require maximum number of comparisons ? a)111111000000 b)101010101010 c)000000111111 c)010101010101 here, ans is ... compare to each element and the move that element to specified position. then how option (a) is correct plz explain me.
meethunjadhav
asked
in
Algorithms
Jul 30, 2018
by
meethunjadhav
953
views
sorting
divide-and-conquer
1
vote
1
answer
28
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? here, ans is 24 sec how it is plz explain me.
meethunjadhav
asked
in
Algorithms
Jul 30, 2018
by
meethunjadhav
417
views
time-complexity
merge-sort
sorting
divide-and-conquer
Page:
1
2
3
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged divide-and-conquer
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...