We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
+ Link For Assignments, GDBs & Online Quizzes Solution |
+ 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.
CS502 Current MID Term Papers Fall 2012 Date: 08-December-2012 to 19-December-2012
Tags:
+ 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?.
+ 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)Please Share your Current Papers Questions/Pattern here to help each other. Thanks
My Today's Paper CS502 Fall 2012 Mid-term
What is the effect of MaxHeapify (A,i) when i>heapsize [A]/2?
Draw binary tree of Matrix ((A1(A2,A3))(A4,A5))?
What is heap and heap order?
Define heap sort algorithm?
How edit distance is used for correct spelling?
What are the Total numbers of edit distance in Matrix?
Sam Hackerz thanks for sharing your paper to help your fellows
Note @ All: You don’t need to go any other site for current Mid Term papers fall 2012, Because All discussed data of our members in this discussion are going from here to other sites. You can judge this at other sites yourself. So don’t waste your precious time with different links.
emiahmed thanks for sharing
Note to All: You don’t need to go any other site for current Mid Term papers fall 2012, Because All discussed data of our members in this discussion are going from here to other sites. You can judge this at other sites yourself. So don’t waste your precious time with different links.
What are the two steps generally involved while developing dynamic programming algorithm. (2)
How we build heap? (2)
What are the applications of edit distance technique? Name any three (3)
Solve: T(n) = (T(q − 1) + T(2 − q) + 2) (3)
What is the worst case running time for the bucket sort? What simple change is required in the algorithm to preserve its linear expected running time and makes it worst case time Θ(n log n) (5)
Given an unordered list of n x0, x1, x2, …, xn and elements is common, if there are atleast n/5 copies of it.We want to identify all the common numbers in our list. Give O(n log n) to solve the problem. (5)
Read more: CS502 Todays paper - Virtual University of Pakistan http://vustudents.ning.com/group/cs502fundamentalsofalgorithms/foru...
cs502 ke mcq's and question sare new thae pata nae kahan se ae thae except two question ke
how we heapify?
what are the two steps generally involved while developing dynamic programming algorithm?
r kuch question radix sort se thae, matrix se bi 3 question ae thae jo mai nae book mai kahen nae dikhae
past paper se 20 % hi shayad hoga
(1)what is the average case and worst case running time of quick sort? [2 marks]
(6)write pseudo code for 0/1 Knapsack algorithm using dynamic programming[5 marks]
Q – Write Down the steps of Dynamic programming
write any 3 types of edit distance 3 marks
what is speech recognization ? 3 marks
What is the effect of MaxHeapify (A,i) when i>heapsize [A]/2? 5 marks
Mehar Nighar thanks for sharing ur paper
++[[[ Annaya Ch ]]] thanks
Note for All Members: You don’t need to go any other site for current Mid Term papers fall 2012, Because All discussed data/sharing of our members in this discussion are going from here to other sites. You can judge this at other sites yourself. So don’t waste your precious time with different links.
© 2020 Created by + M.Tariq Malik. Powered by
Promote Us | Report an Issue | Privacy Policy | Terms of Service
VU Students reserves the right to delete profile, which does not show any Activity at site nor has not activity more than 01 month.
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