We have been working very hard since 2009 to facilitate in your learning Read More. We can't keep up without your support. Donate Now.
+ Link For Assignments, GDBs & Online Quizzes Solution |
+ Link For Past Papers, Solved MCQs, Short Notes & More |
dear fellows! plz share your today's quiz here.
Tags:
+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)
+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)
+ Click Here to Search (Looking For something at vustudents.ning.com?) + Click Here To Join (Our facebook study Group)ya sure.. i will share the best one .. solution here.. soon .... of cs502 quiz 4
thanks ..
plz do remember me in ur prayers i will give u 100% solution
umair sid
thanks i pray and waiting
hera all here is the most easy quiz of the cs502 but remember THERE ARE 3 Question which are asked again in that quiz,..
thanks... remember me in ur prayers...
uamir sid
Quiz no# 4 06-07-2012 solved by umair sid 100%
Back edge is
(u,v) where v is an ancestor of u in the tree page # 128
What algorithm technique is used in the implementation of kruskal solution for the MST?
Greedy Technique page #142
in drsigne G=(V,E) ;G has cycle if and only if
The DFS forest has back edge page # 131
Cross edge is :
(u,v) where u and v are not ancestor or descendent of one another page #129
Forword edge is :
(u,v) where v ia a proper decendent of u in the tree. Page # 129
A digraph is strongly connected under what condition ?
A diagraph is strongly connected if for every pair of vertex u,v e v,u can reach v and vice versa. Page #135
You have an adjective list for G, what is the time complexity to computer graph transpose G^T.?
(V + E ) PAGE # 138
Given an adjacency list for G, it is possible to compute G ^{T} in Θ(V + E) time.
What is the time complexity to extract a vertex from the priority queue in prim’s algorithm ?
O Log (v) page #152
It takes O(log V) to extract a vertex from the priority queue.
There is relationship between number of back edges and number of cycles in DFS
There is no relationship between back edges and number of cycles
Which is true statement in the following
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best Tree edge) when the graph has relatively few edges.
Dijkstra’s algorithm :
Has greedy approach to compute single source shortest paths to all other vertices page 154
What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?
O (log V)
Which is true statement
Breadth first search is shortest path algorithm that works on un-weighted graphs
Depth first search is shortest path algorithm that works on un-weighted graphs.
Both of above are true.
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree edge) when the graph has relatively few edges.
True
pleasure rose... do remember me inur prayers plz thx
dears here is the modified quiz of Umair, plz check it for correctness and comment.
CS502 Quiz no# 4 06-07-2012 Solved by Umair sid 100%
Given an adjacency list for G, it is possible to compute G ^{T} in Θ(V + E) time.
It takes O(log V) to extract a vertex from the priority queue.
There is no relationship between back edges and number of cycles
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best Tree edge) when the graph has relatively few edges.
Overall time for Kruskal is
Θ(E log E) = Θ(E log V) if the graph is sparse. P-149
True
Has greedy approach to compute single source shortest paths to all other vertices page 154
O (log V)
Breadth first search is shortest path algorithm that works on un-weighted graphs
Depth first search is shortest path algorithm that works on un-weighted graphs.
Both of above are true.
thanks a lot
shukar hay zeeshan ap k face pr bhi smile aayi hay
© 2020 Created by +M.Tariq Malik. Powered by
Promote Us | Report an Issue | Privacy Policy | Terms of Service
We are user-generated contents site. All product, videos, pictures & others contents on vustudents.ning.com don't seem to be beneath our Copyrights & belong to their respected owners & freely available on public domains. We believe in Our Policy & do according to them. If Any content is offensive in your Copyrights then please email at m.tariqmalik@gmail.com or Contact us at contact Page with copyright detail & We will happy to remove it immediately.
Management: Admins ::: Moderators
Awards Badges List | Moderators Group
All Members | Featured Members | Top Reputation Members | Angels Members | Intellectual Members | Criteria for Selection
Become a Team Member | Safety Guidelines for New | Site FAQ & Rules | Safety Matters | Online Safety | Rules For Blog Post
Looking For Something at Site? Search Below
How to Add New Discussion in Study Group ? Step By Step Guide Click Here.
------------------------------------------------------------------------------------------------------------