Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions tagged algorithms
0
votes
0
answers
#algorithm #kruskal's algo
What is minimum separator lemma?
asked
21 hours
ago
in
Algorithms
by
Allica
(
13
points)

5
views
algorithms
0
votes
1
answer
Made Easy Workbook Algorithms Chapter2 Q2
Solve the following with Substitution method only. $T(n) = 8T(n/2) + n^{2}logn$) n>0 T(1)=1 Note: The original question doesn’t say to solve with substitution only but i don’t like Master’s method.
asked
2 days
ago
in
Algorithms
by
donniedarko
(
21
points)

18
views
algorithms
0
votes
0
answers
Need of cycle checking algorithm in minimum spanning tree algorithms
asked
5 days
ago
in
Algorithms
by
ashutoshbsathe
(
5
points)

12
views
algorithms
0
votes
0
answers
Madeeasy Testseries Algo Q1
Which of the following statements are true ? Negating all the edge weights in a weighted undirected graph G and finding the minimum spanning tree gives us the maximum weight spanning tree of the original graph G In a graph with unique edge weights ... probability p1 and p2. In a connected weighted graph, every lowest weight edge is always in some minimum spanning tree.
asked
Jan 2
in
Algorithms
by
Shivateja MST
(
45
points)

32
views
algorithms
0
votes
0
answers
Unacademy Test
“Rerunning Dijkstra’s algorithm on a graph V times will result in the correct shortestpath tree, even if there are negative weight edges (No ve weight cycles” I am thinking the answer is False because even though you run at all the vertices we will have the wrong value computed at each vertex. The answer is True as provided by them (No explanation)
asked
Dec 31, 2020
in
Algorithms
by
badman
(
9
points)

20
views
algorithms
0
votes
2
answers
Made easy algorithms SW test
I didnt understand the solution. can any one explain more clearly with example?
asked
Dec 31, 2020
in
Algorithms
by
nikhil856
(
13
points)

31
views
algorithms
0
votes
0
answers
Algorithm:Doubt
Which of the following sorting algorithm gives the same number of swaps as that of the total inversion count in the array? Quick sort Selection sort Merge Sort Bubble Sort
asked
Dec 28, 2020
in
Algorithms
by
val_pro20
(
2
points)

18
views
algorithms
selfdoubt
+2
votes
0
answers
GateBook Full Length Test
Which of the following statements is/are true/correct ? A) Professor Ram gives a comparisonbased sorting algorithm that runs in T(n) = 2T(n1)+ 1. There is not enough information to know whether Ram's algorithm is correct. B) Professor ... base 6) so this also should not be the time complexity of a comparison based sorting algorithm. Can anyone confirm?.Thanks in advance
asked
Dec 28, 2020
in
Algorithms
by
Deterministic
(
31
points)

40
views
gatebook
algorithms
timecomplexity
0
votes
1
answer
For a uniprocessor system, there will always be ________ number of running process at any given time
asked
Dec 15, 2020
in
Operating System
by
billionairelink
(
5
points)

34
views
algorithms
0
votes
1
answer
MADE EASY TEST doubt
What is the complexity of this loop
asked
Dec 4, 2020
in
Algorithms
by
StoneHeart
(
735
points)

41
views
algorithms
0
votes
2
answers
maxheap test
what is the level order traversal for an array of elements 20,15,21,31,16,18,19,40 .These elements are inserted into an empty max heap.
asked
Dec 3, 2020
in
Algorithms
by
val_pro20
(
2
points)

54
views
selfdoubt
algorithms
testseries
0
votes
1
answer
sorting algorithms
Best and worst Time complexity for number of inversion using merge sort VS number of inversion using insertion sort
asked
Dec 2, 2020
in
Algorithms
by
val_pro20
(
2
points)

17
views
algorithms
selfdoubt
0
votes
0
answers
TIFR 2018 From System Science
Let G=(V,E)G=(V,E) be a DIRECTED graph, where each edge ee has a positive weight ω(e),ω(e), and all vertices can be reached from vertex s.s. For each vertex v,v, let ϕ(v)ϕ(v) be the length of the shortest path from ss to v.v. Let G′=(V,E)G′=(V, ... If PP is NOT a shortest path in G,G, then ω′(P)<2 ω(P).ω′(P)<2 ω(P). All of the above options are necessarily TRUE.
asked
Dec 1, 2020
in
Algorithms
by
Rishabh Mondal
(
5
points)

12
views
algorithms
0
votes
1
answer
Nielit exam scientific assistant
Anomalies are avoided by splitting the offending relation into multiple relations is also known as a) Accupressure b) Decomposition c) Precomposition d) Both decomposition and Precomposition
asked
Nov 27, 2020
in
Databases
by
Naveen124
(
5
points)

20
views
algorithms
0
votes
0
answers
Self Doubt : Bubble Sort
If a question is asked in GATE regarding bubble sort,should i take normal bubble sort or improved version of bubble sort? In some test series question, they are giving best case time complexity as O(n) instead of O(n^2) for bubble sort. So, which one should i take?
asked
Nov 26, 2020
in
Algorithms
by
phaneendrababu
(
23
points)

19
views
algorithms
programming
0
votes
1
answer
#algorithms #madeeasy
What is the time complexity to find kruskal’s algorithm [ MSQ ] 1. O(ElogE) 2. O(ElogV) 3. O(E+V) 4.O(E2 logV)2 i am getting 1 and 3 1(when edges are not sorted) by using disjoint set 3(when edges are sorted) by using disjoint set but answer given is 1,2
asked
Nov 26, 2020
in
Algorithms
by
404 found
(
31
points)

28
views
algorithms
0
votes
0
answers
External Sorting  Calculate number of passes
Let suppose that we have a file with n = 10^6 records. The block size is B = 10 records and we have available main memory m = 20 blocks. (Sorting with MergeSort) 1. How many runs will you produce in the ... /classes/Comp115Spring2017/exercises/Comp115Class13ExSolExternalSorting.pdf) and i am confused about the different terms i have to manage.
asked
Nov 25, 2020
in
Databases
by
AlgoHuman
(
5
points)

10
views
algorithms
databases
mergesort
selfdoubt
0
votes
0
answers
Mergesort  Number of compares between keys
How i can prove that the number of collisions between two keys remain the same and it is independent with the runs(count of subdivides) that algorithm do ?
asked
Nov 24, 2020
in
Algorithms
by
AlgoHuman
(
5
points)

13
views
algorithms
mergesort
databases
0
votes
0
answers
2 Dimensional array and Kth Smallest Element ?
We are given a 2D array [1..M] [1..N] where each row of this matrix is sorted and all elements are distinct. we need to find kth smallest element on this array. what is the time complexity? O( log n + log m) O(log n log m) O( m ... C is correct and equal to O( m (log m + log n)). but what is the algorithms? is here any details on this time complexity?
asked
Nov 21, 2020
in
Algorithms
by
DrMhmd
(
5
points)

29
views
algorithms
programming
datastructures
+1
vote
1
answer
NIELIT STA 2018
Given an random unsorted array ‘A’ in which every element is at most ‘d’ distance from is position in sorted array where d<Size(A). If we applied the insertion sort over this array, then the time complexity of algorithm is: O($n\log d$) O($n^2\log d$) O($nd$) O($n^2d$)
asked
Nov 18, 2020
in
Algorithms
by
Sudarshan Bandyopadh
(
11
points)

37
views
algorithms
sorting
timecomplexity
0
votes
1
answer
#MadeEasy #Algorithms #AsymptoticAnalysisOfAlgorithms
asked
Nov 17, 2020
in
Algorithms
by
sonam13
(
9
points)

19
views
algorithms
+1
vote
1
answer
Testbook Test series
What is the best case time complexity to find the smallest element in Maxheap implemented using array with n^3 * logn elements? Ω(logn) Ω(n) Ω(n^3logn) Ω(1)
asked
Nov 16, 2020
in
Algorithms
by
rsamarth
(
29
points)

36
views
algorithms
timecomplexity
+1
vote
1
answer
Made Easy Test Series
The minimum number of comparisons to find the biggest number in an unsorted list of size 15 is __________
asked
Nov 16, 2020
in
Algorithms
by
Vishal_kumar98
(
37
points)

23
views
testseries
algorithms
0
votes
0
answers
Made Easy Test Series
How much time will it take to sort n numbers by quicksort if some arbitrary algorithm takes O(n^2) to choose pivot?
asked
Nov 16, 2020
in
Algorithms
by
Vishal_kumar98
(
37
points)

21
views
testseries
algorithms
+1
vote
1
answer
MADE EASY TEST ON ALGORITHMS
$\text{A graph G with n vertices is said to be a void graph if and only if there's no edge between any pair of vertices belonging to G. }$ $\text{Let X be a void graph on $ ... $\text{ What is the value of}$ $k^{\frac{1}{2}}$ $?$
asked
Nov 12, 2020
in
Algorithms
by
StoneHeart
(
735
points)

20
views
algorithms
+1
vote
1
answer
Algorithms by Jeff Erickson
asked
Nov 10, 2020
in
Algorithms
by
kalin
(
153
points)

22
views
algorithms
selfdoubt
dijikstraalgo
+1
vote
1
answer
GATE19886 Time Complexity Algorithms
Can someone please explain what this function do with a diagram and what does it mean by payoff and INF and negate INF? https://gateoverflow.in/94363/gate19886i
asked
Nov 6, 2020
in
Algorithms
by
Akshar Ganatra
(
9
points)

16
views
algorithms
timecomplexity
selfdoubt
+2
votes
1
answer
Made Easy Workook
asked
Nov 2, 2020
in
Algorithms
by
Vishal_kumar98
(
37
points)

26
views
workbook
algorithms
0
votes
1
answer
Made Easy Algorithm
asked
Nov 2, 2020
in
Algorithms
by
Vishal_kumar98
(
37
points)

44
views
workbook
algorithms
0
votes
1
answer
Made Easy Algorithm Workook
asked
Nov 2, 2020
in
Algorithms
by
Vishal_kumar98
(
37
points)

18
views
algorithms
workbook
+1
vote
1
answer
Made easy test series
is this statement true? in a graph with unique edge weight the spanning tree of second lowest weight is unique. I am not not able to come up with the example to prove it wrong .
asked
Oct 30, 2020
in
Algorithms
by
agastya_08
(
11
points)

54
views
algorithms
spanningtree
graphtheory
mst
0
votes
0
answers
Self Doubt Algorithms
what is time complexity to insert a node based on key in a priority queue? O(nlogn) O(logn) O(n) (n2) i am unable to get the meaning of the question . is it a simple insertion in the priority queue?? . what is the meaning of “based on key”.Please explain this….
asked
Oct 20, 2020
in
Programming
by
manal jain
(
5
points)

22
views
algorithms
selfdoubt
programming
logarithms
0
votes
0
answers
Unacademy Free Test Algo Quesn
Assume that the enqueuing and dequeuing of elements in BFS takes O(V) time. then what will be the time complexity of the BFS algorithm? (Assume adjacency list representation) O(V^3) O(V^2) O(V^2 . E) O(V + E) Anyone please clarify.
asked
Oct 17, 2020
in
Algorithms
by
Shivateja MST
(
45
points)

52
views
algorithms
+1
vote
2
answers
Self Doubt Algorithms
I was having a doubt that should we consider = or I am finding different answers on the internet.
asked
Oct 17, 2020
in
Algorithms
by
satvik
(
11
points)

48
views
selfdoubt
algorithms
programming
logarithms
0
votes
1
answer
Deletion in heap
How to delete the last node in a maxheap or minheap? Do we delete it directly or like in normal case replace it with itself then call max heapify on it and then finally decrease heap size?
asked
Oct 11, 2020
in
Algorithms
by
RasMalai
(
27
points)

40
views
sorting
algorithms
selfdoubt
0
votes
0
answers
Self Doubt in Sorting Algorithm
If there is a question on bubble sort and nothing about the type (with a boolean flag which terminates if there is no swap in a pass or without flag) of bubble sort is mentioned. which one should we use?
asked
Oct 9, 2020
in
Algorithms
by
badman
(
9
points)

13
views
algorithms
selfdoubt
0
votes
1
answer
Unacademy Free Test Question
Consider the following and choose the correct answer by order of growth 1. n! 2. a^n , a is constant 3. e^n 4. n^n 5. n^k , where k is constant Anyone please clarify. 5<2<3<1<4 b.2<5<3<1<4 c.5<3<2<1<4 d.5<2<3<4<1
asked
Oct 7, 2020
in
Algorithms
by
Shivateja MST
(
45
points)

30
views
algorithms
0
votes
1
answer
How to solve this recurrence relation using back substitution?
asked
Oct 2, 2020
in
Algorithms
by
neel19
(
7
points)

62
views
algorithms
selfdoubt
0
votes
0
answers
Cormen Page 44 , Para 2
Statement : It is not contradictory, however, to say that the worstcase running time of insertion sort is Ω(n^2 ), since there exists an input that causes the algorithm to take Ω(n^2 ) time . What does this statement mean as they are talking about worst case but are using Big Omega notation?
asked
Sep 25, 2020
in
Algorithms
by
Ankit Raina 7
(
5
points)

27
views
algorithms
cormen
0
votes
1
answer
Self Doubt (PYQ)
https://gateoverflow.in/549/gate199201ix In this question the time complexity is given as O((n+m)$\alpha$(n)). In Horowitz it is said that on average it is O(1) for find, then shouldn’t it be O(n+m).
asked
Sep 22, 2020
in
Algorithms
by
Mellophi
(
363
points)

20
views
selfdoubt
algorithms
Page:
1
2
3
4
...
15
next »
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.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
8,957
questions
3,118
answers
14,337
comments
95,787
users