We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More


Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

dear fellows! plz share your today's quiz here.

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 563

.

+ 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)

Replies to This Discussion

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 

Attachments:

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

 

thanxxxxxxxxxxx alot..........

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%

  1. Back edge is  (u,v) where v is an ancestor of u in the tree        page # 128
  2. What algorithm technique is used in the implementation of kruskal solution for the MST? Greedy Technique     page #142
  3. in designe G=(V,E) ;G has cycle if and only if The DFS forest has back edge          page # 131
  4. Cross edge is : (u,v) where u and v are not ancestor or descendent of one another    page #129
  5. Forword edge is :(u,v) where v is a proper decendent of u in the tree.          Page # 129
  6. A digraph is strongly connected  if for every pair of vertex u, v Є V, u can reach v and vice versa.  Page #135
  7. You have an adjacent  list for G, what is the time complexity to compute 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.

  1. 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.

  1. 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

  1. 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.

 

Overall time for Kruskal is

Θ(E log E) = Θ(E log V) if the graph is sparse.   P-149

True

 

 

  1. Dijkstra’s algorithm:

 

Has greedy approach to compute single source shortest paths to all other vertices           page 154

 

 

  1. What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?

 

O (log V)

 

  1. 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.

 

 

 

thanks a lot

shukar hay zeeshan ap k face pr bhi smile aayi hay 

thanks umair

thanks wish u good luck!

thanks

RSS

Latest Activity

+M.Tariq Malik replied to +M.Tariq Malik's discussion CS507 Assignment No 01 Spring 2020 Solution & Discussion Due Date: 22-05-2020 in the group CS507 Information Systems
5 minutes ago
+M.Tariq Malik replied to +M.Tariq Malik's discussion CS507 Assignment No 01 Spring 2020 Solution & Discussion Due Date: 22-05-2020 in the group CS507 Information Systems
7 minutes ago
+M.Tariq Malik replied to ہاشم's discussion CS615 Assignment 1 Solution Spring 2020 in the group CS615 Software Project Management
15 minutes ago
+M.Tariq Malik replied to +M.Tariq Malik's discussion CS314 Introduction to Cellular Networks Assignment No 01 Spring 2020 Solution & Discussion Due Date: 29-05-2020 in the group CS314 Introduction to Cellular Networks
30 minutes ago
+M.Tariq Malik liked +M.Tariq Malik's discussion CS314 Introduction to Cellular Networks Assignment No 01 Spring 2020 Solution & Discussion Due Date: 29-05-2020
30 minutes ago
+M.Tariq Malik added a discussion to the group CS314 Introduction to Cellular Networks
31 minutes ago
+M.Tariq Malik replied to +M.Tariq Malik's discussion MTH601 Operations Research Assignment No 01 Spring 2020 Solution & Discussion in the group MTH601 Operations Research
34 minutes ago
+M.Tariq Malik liked +M.Tariq Malik's discussion MTH601 Operations Research Assignment No 01 Spring 2020 Solution & Discussion
34 minutes ago
+M.Tariq Malik added a discussion to the group MTH601 Operations Research
34 minutes ago
Profile IconShah Rukh, Sunny, Sania Murad and 4 more joined Virtual University of Pakistan
38 minutes ago
+ ! ! ! ! ! ! !ςu††ïε ! ! replied to + ! ! ❥ρsүcнσ༄ ! ! +'s discussion !!!Sochiye ga zarur mery tamam bhai!!!
1 hour ago
Aqsa Athar replied to Maria's discussion CS601 Assignment Solution
1 hour ago

© 2020   Created by +M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.