www.vustudents.ning.com

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

# plz share quiz 4 here 6-7-12

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

Views: 590

### 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

1

2

3

4

## Latest Activity

### ENG 503 Midterm Fall 2022 5:30pm

19 minutes ago
2 hours ago
Aqib rehman liked Fahad Nabeel's discussion ISL201 1st Quiz
2 hours ago
Aqib rehman liked Fahad Nabeel's discussion ISL201 1st Quiz
2 hours ago
Aqib rehman and Masoom Shahzada joined Virtual University of Pakistan
2 hours ago

12 hours ago

12 hours ago

12 hours ago