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
Made easy
[closed]
Piyush mishra
asked
in
Algorithms
Nov 27, 2018
closed
Nov 27, 2018
by
Sayan Bose
147
views
0
votes
0
votes
closed as a duplicate of:
MST
Let T be a MST of G.suppose that we decreased the weight of one of the edge present in G but not in T.Then how much time will take to construct MST for the modified graph G?
Piyush mishra
asked
in
Algorithms
Nov 27, 2018
closed
Nov 27, 2018
by
Sayan Bose
by
Piyush mishra
147
views
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
Huzaifa0111
asked
in
Algorithms
Aug 27, 2023
164
views
Made Easy Workbook
Huzaifa0111
asked
in
Algorithms
Aug 27, 2023
by
Huzaifa0111
164
views
divide-and-conquer
algorithms
made-easy-booklet
0
votes
0
votes
0
answers
2
Ray Tomlinson
asked
in
Algorithms
Aug 9, 2023
514
views
Made Easy Test Series 2024
Suppose we have a directed graph G = (V,E) with V= {1, 2, ..., n} and Eis presented as an adjacency list. For each vertex u in V, out(u) is a list such that (u, v) in {1, 2, ... k). For each u in V, we wish to compute a corresponding list in(u) =such that in E ... take to construct the lists in(u), u in V, from the lists out(u), u in V? T(n) =O(n+m) B. T(n)= O(n(m+n))
Ray Tomlinson
asked
in
Algorithms
Aug 9, 2023
by
Ray Tomlinson
514
views
made-easy-test-series
algorithms
made-easy-booklet
algorithm-design
time-complexity
linked-list
graph-theory
graph-algorithm
0
votes
0
votes
0
answers
3
Ray Tomlinson
asked
in
Algorithms
Aug 9, 2023
274
views
Made easy test series
what they want to tell and it is true or false?
Ray Tomlinson
asked
in
Algorithms
Aug 9, 2023
by
Ray Tomlinson
274
views
made-easy-test-series
made-easy-booklet
algorithms
bellman-ford
0
votes
0
votes
1
answer
4
Ray Tomlinson
asked
in
Algorithms
Aug 9, 2023
446
views
Made Easy Test Series 2024
How many times is the comparison $i >= n$ performed in the following program? int i = 200 n = 80; main() { while (i >= n) { i = i - 2 n = n + 1 } }
Ray Tomlinson
asked
in
Algorithms
Aug 9, 2023
by
Ray Tomlinson
446
views
algorithms
algorithm-design
loop-invariants
loop
time-complexity
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 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:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy