MCQs ziyada tar new thy......huffman encoding aur ASCII coding se aye thy
Q1) answer the follwing according to Floyd Marshall 1) runing time 2) space use
2) write suedo code of dijkstra algorithm? 5marks
3)Give a detailed example for 2-d maxima problem 2marks
4)Make Adjacency list from the given table 5marks
5) how generic algorithms work with minimum spaning tree 3marks
6) Floyd-Warshall matrix diya tha os py 3 itration apply karny thy 5marks
7) Which points should be supposed to prove the correctness of the Dijkstra's Algorithm 3marks --
Group Basic Rules:
Immoral & Rudish talk, Earning program links, Cell number for friendship purpose, Websites/Groups Links, Adult contents, Spamming are strictly prohibited and banned in group.
Follow these detailed Group Rules, otherwise you will be banned at any time.
https://docs.google.com/document/d/1YJxA8x3_U7C1lRc0EXfLrJpco4A1XkB1vDxOTqOd3Jg/edit?hl=en&authkey=CNDy9tkJ
Group Email Address:
Attock-VU-Group@Googlegroups.Com
Join group by sending a blank email from University ID at:
Attock-VU-Group+Subscribe@Googlegroups.Com
Click here to Join this group at Facebook:
https://www.facebook.com/home.php?sk=group_111877855568034
Do not send Non-study-related Emails till the ending of Final Exam.
No comments:
Post a Comment