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
GATE Overflow | Algorithms | Test 1 | Question: 30
Bikram
asked
in
Algorithms
Oct 4, 2016
192
views
2
votes
2
votes
Match the following:
i.
BFS
a.
$O(\mid E \mid + \mid V \mid \log \mid V \mid)$
ii.
DFS
b.
$O(E)$
iii.
Kruskal's algorithm
c.
Stack
iv.
Dijikstra's Algorithm
d.
$O(E \log V)$
i - b, ii - c, iii - a, iv - d
i - c, ii - b, iii - d, iv - a
i - b, ii - c, iii - d, iv - a
i - c, ii - d, iii - a, iv - b
go-alogrithms-1
algorithms
graph-algorithms
Bikram
asked
in
Algorithms
Oct 4, 2016
by
Bikram
192
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
2
Answers
2
votes
2
votes
c is correct answer
Harshit Pradhan
answered
Oct 10, 2016
reshown
Oct 10, 2016
by
Harshit Pradhan
by
Harshit Pradhan
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
1
vote
1
vote
When use fibanocci heap dijkstra take O(E+VlogV). Kruskal always takes O(ElogE+VlogV) .. Ei s O(V^2) so T=O(2ElogV+VlogV) or
O( ElogV)(assuming graph is not a sparse graph)
DFS is implemented using stack
BFS O(E+V) =O(E) (again assuming graph is a dense graph)
Shreya Roy
answered
Nov 1, 2016
by
Shreya Roy
comment
Follow
share this
3 Comments
by
Vijay Thakur
commented
Nov 5, 2016
reply
Follow
share this
Kruskal's and Dijikstra have same TC. if you can implement Dijikstr'as algo with FIbnocci heap then kruskal's can also be done.
this paper is really strange!!
0
0
by
Harsh181996
commented
Jan 4, 2017
reply
Follow
share this
Kruskal can take O(∣E∣+∣V∣log∣V∣) , if sorting of edges is done in preprocessing step.
And Dijkstra can take O(ElogV) , by min heap.
so A) is also possible.
0
0
by
Harsh181996
commented
Jan 4, 2017
reply
Follow
share this
Kruskal can be done in O(∣E∣+∣V∣log∣V∣) , edges are sorted in pre processing step.
Dijkstra can be implemented in O(ElogV) by min heap .
So A) is also possible.
0
0
Please
log in
or
register
to add a comment.
Answer:
C
← Previous
Next →
← Previous in category
Next in category →
Related questions
2
votes
2
votes
1
answer
1
Bikram
asked
in
Algorithms
Oct 4, 2016
211
views
GATE Overflow | Algorithms | Test 1 | Question: 28
Match the following i. Dijkstra's Algorithm a. All pairs shortest path ii. Bellman Ford Algorithm b. Greedy iii. Floyd-Warshall Algorithm c. Reweighting iv. Johnson Algorithm d. Single source shortest path i - c, ii - d, iii - a, iv - b i - d, ii - a, iii - c, iv - b i - b, ii - d, iii - a, iv - c i - d, ii - b, iii - a, iv - c
Bikram
asked
in
Algorithms
Oct 4, 2016
by
Bikram
211
views
go-alogrithms-1
algorithms
graph-algorithms
2
votes
2
votes
2
answers
2
Bikram
asked
in
Algorithms
Oct 4, 2016
180
views
GATE Overflow | Algorithms | Test 1 | Question: 29
$T(n) = \begin{cases} 4 & \quad if \: \: n =1 \\ T(n-1) + 4 & \quad otherwise \end{cases}$ Value of $T(1000)$ is ___
Bikram
asked
in
Algorithms
Oct 4, 2016
by
Bikram
180
views
go-alogrithms-1
recurrence-relation
algorithms
numerical-answers
1
vote
1
vote
2
answers
3
Bikram
asked
in
Algorithms
Oct 4, 2016
439
views
GATE Overflow | Algorithms | Test 1 | Question: 27
Consider a hash table of size $m = 10$ and a corresponding hash function $h(k) = k A \mod m$ for $A = 5$ where collisions are resolved by quadratic probing. The location (starting from 1) to which the key 65 is mapped if the current contents of hashtable is $4 \;8 \;\_ \;\_ \;7 \;8 \;6 \;\_\; 0\; \_$ is _______
Bikram
asked
in
Algorithms
Oct 4, 2016
by
Bikram
439
views
go-alogrithms-1
numerical-answers
algorithms
hashing
3
votes
3
votes
1
answer
4
Bikram
asked
in
Algorithms
Oct 4, 2016
220
views
GATE Overflow | Algorithms | Test 1 | Question: 26
Maximum element in a min-heap represented by an array, can be computed in _____ time $O(n)$ $O(\log n)$ $O(n \log n)$ but not $O(n)$ $O(1)$
Bikram
asked
in
Algorithms
Oct 4, 2016
by
Bikram
220
views
go-alogrithms-1
heap
algorithms
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent Blog Comments
please add GO Classes 2023 Computer Networks...
Please upload 4th Mock Test, due date was 4th Dec.
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
Maximum age limit changed from 35 yrs. to 28...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy