Recent questions tagged algorithms
Register

Recent questions tagged algorithms

Recent questions tagged algorithms
0 votes
0 answers 13 views
#algorithms #timecomplexity
There a confusion about what should be the time complexity of the code... Involving modulo operator
Palash yadav asked in Algorithms Nov 12
by Palash yadav
135 points
13 views
0 votes
0 answers 39 views
Design the algorithm that is known as the Shortest Job First
mihir12345 asked in Algorithms Aug 24
by mihir12345
5 points
39 views
0 votes
0 answers 25 views
test series
@bikram @arjun sir please help with this question. I tried to sort the jobs according to their start time but was unable to find any time unit which was free . Please assist
rish1602 asked in Algorithms Aug 19
by rish1602
9 points
25 views
0 votes
0 answers 35 views
#bfs #test-series
Find the number of possible BFS ordering for the graph given below. [Starting from node 1]
Abhishek tarpara asked in DS Aug 18
by Abhishek tarpara
13 points
35 views
0 votes
0 answers 18 views
#Kruskal's Algorithm
Time Complexity of Kruskal’s Algorithm is O(ElogE) E <= V² log(E) <= 2 log(V), so T(n) = O(ElogV) Why don’t we put E = V² for the worst case in outer E also ?, in that case complexity will be O(V²logV).
Captain Cold asked in Algorithms Aug 15
by Captain Cold
5 points
18 views
0 votes
0 answers 24 views
Travelling salesman problem by dynamic approch
Can anyone explain me what are the several methods for solving the TSP problem by dynamic programs.?
Annapareddy asked in Algorithms Aug 12
by Annapareddy
5 points
24 views
0 votes
0 answers 27 views
self doubt
Let's say we have an array of 39 distinct elements. We want to arrange them in ascending order. We want to use quick sort for it. We take the pivot element uniformly at random. Calculate the probability of placing the pivot element at worst possible ... seem similar question but that has phrase like in the first round of partitioning. I doubt both questions are same. Please respond soon.
sameer11 asked in DS Aug 12
by sameer11
5 points
27 views
0 votes
0 answers 15 views
#self doubt #algorithm #asymptotic notation
Big O is fn=c.gn for some values of constant 'c>0' and for little o it is fn=c.gn for all values of constant 'c>0', now my question is what is the difference between this some c>0 and all values of c>0 mentioned here
arnab2022 asked in Algorithms Aug 2
by arnab2022
5 points
15 views
0 votes
0 answers 30 views
I came across these three questions on internet on Master Theorem
Naman9495 asked in Algorithms Jul 12
by Naman9495
5 points
30 views
0 votes
0 answers 28 views
#Made Easy Test Series 2022 #Algorithms-I
Assume a scenario in which min-max heap has the following property: An almost complete binary tree where each node at an even level in the tree is less than all of its descendants and each of the node at an odd level in the tree is greater than all of its ... (d) Ο(n) for max and Ο(log n) for min or Ο(n) for min and Ο(log n) for max respectively
Sibu08 asked in DS Jun 29
by Sibu08
5 points
28 views
0 votes
0 answers 38 views
Time and space complexity
There is an algorithm that took array of strings, sorted each string and then sorted the entire array.What would be the runtime?
SaileeDas asked in Algorithms Jun 28
by SaileeDas
5 points
38 views
0 votes
0 answers 20 views
Made easy test series #algorithm #graph #DFS
Did not understand answer of this question plz help me to resolve problem.
taatya bichhu asked in Algorithms Jun 26
by taatya bichhu
5 points
20 views
0 votes
0 answers 27 views
find meh
// C++ implementation to find the character in first // string that is present at minimum index in second // string #include <bits/stdc++.h> using namespace std; // function to find the minimum index character void printMinIndexChar(string str, string ... in unordered map or not because it only returns true or false but how can we assign the character inside the if condition.
Lekhraj asked in Programming Jun 23
by Lekhraj
9 points
27 views
0 votes
0 answers 75 views
[SELF DOUBT] DSA BUBBLE SORT
is bubble sort an online algorithm? cause whenever new element is fed, it can be take to its place by swapping the adjacent numbers. is my thinking right?
rythmrana asked in Algorithms Jun 18
by rythmrana
5 points
75 views
0 votes
0 answers 19 views
[SELF DOUBT] DSA INSERTION SORT
for an almost sorted array, which algorithm is better, shell sort or insertion sort? and also for a fully sorted array?
rythmrana asked in Algorithms Jun 17
by rythmrana
5 points
19 views
0 votes
0 answers 33 views
[SELF DOUBT] DSA , IN PLACE SORTING
if we require a large(more than size of array or 1000000mb) but constant( irrespective of size of input array) extra space for an algorithm, will the algorithm be in place or not? the extra space is not required to manipulate the elements of array but may be required for some other purpose.
rythmrana asked in Algorithms Jun 17
by rythmrana
5 points
33 views
0 votes
0 answers 17 views
Topic name : heapify and heapsort
We can reduce the space complexity of heapsort to o(1) by using heapify using loops, then why we dont reduce the space complexity of heapify from o(logn) to o(1) by using loops here also.?
Ayush1718 asked in Algorithms Jun 9
by Ayush1718
5 points
17 views
0 votes
0 answers 29 views
I have been practicing question using Master Theorem, I find one is hard so posted here for expert review
Irfan123 asked in Algorithms Jun 1
by Irfan123
5 points
29 views
0 votes
0 answers 28 views
Go Book 2020 volume 2 page number 160 question no. 3.14.6
prateek_hazard asked in DS May 23
by prateek_hazard
5 points
28 views
0 votes
0 answers 15 views
Asymptotic notation
T(n)=T(n-1)-1 what is complexity of this
Rahul06 asked in Algorithms May 6
by Rahul06
5 points
15 views
0 votes
0 answers 27 views
Reference from GATE IT-2005 (2 marks)
"In Binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most 2." How is this statement valid in case of Left or Right Skewed Binary tree?
Anupreet13 asked in Programming May 2
by Anupreet13
5 points
27 views
0 votes
1 answer 28 views
CRLS question 6.5-7
How to Implement a stack with a priority queue ?
Raj_81 asked in Algorithms Mar 17
by Raj_81
27 points
28 views
0 votes
0 answers 60 views
Made Easy Postal study material objective practice sets- algorithm-asymptotic analysis
Harshit2021 asked in Algorithms Mar 12
by Harshit2021
5 points
60 views
0 votes
0 answers 49 views
Need to change the book content details
Here, Chapter 9 is missing. This makes me loose 2 marks. Because I blindly believed that the content described in this material is accurate. So plz update the latest content in this material.
Raj_81 asked in Algorithms Mar 11
by Raj_81
27 points
49 views
1 vote
0 answers 56 views
PLEASE HELP WITCH COMPUTER SCIENCE
Zipko asked in Others Mar 2
by Zipko
9 points
56 views
2 votes
2 answers 873 views
GATE CSE 2021 Set 2 | Question: 26 | Video Solution
Arjun asked in Algorithms Feb 18
by Arjun
1.5k points
873 views
4 votes
3 answers 909 views
GATE CSE 2021 Set 2 | Question: 39 | Video Solution
Arjun asked in Algorithms Feb 18
by Arjun
1.5k points
909 views
2 votes
3 answers 861 views
GATE CSE 2021 Set 1 | Question: 9 | Video Solution
Arjun asked in Algorithms Feb 18
by Arjun
1.5k points
861 views
Page:
Ask
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Developed by Chun