Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

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

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

Views: 587

Replies to This Discussion

  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.

 which correct tell me

Breadth first search is shortest path algorithm that works on un-weighted graphs (Right Answer)

see attached file

Attachments:

cs502 quiz # 4 solved by nouman

Attachments:

Cs502 Quiz   No.4  Dated July 06, 2012

All 100% questions in this file

Attachments:

thanksssssssss

RSS

Looking For Something? Search Below

Latest Activity

VIP Member Badge & Others

How to Get This Badge at Your Profile DP

------------------------------------

Management: Admins ::: Moderators

Other Awards Badges List Moderators Group

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

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