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.
All current Mid term papers 2015 Plzzzz share u alsoo,
plzzz sb log apne papers share kre.
Hm ye chahte hain k dosre log share kre pr khud paper k bad share krna pasand ni krte.
but agr hm kisi ki help kre ge to koe hamari help kre ga na.
So khud b help lo or dosro ki b help kro
Thanksssss
GOD HELPS THOSE WHO HELP OTHERS.
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)my today cs502 paper
60% MSQS from moaz and Muhammad faisal dar files others from handout but essay thay.
Long questions
1.What is heap and what is heap order. 2 marks.
2.how edit distance is used in speech recognition 3 marks
3.Draw the cost table for chain multiplication problem with initial states. 3 marks
4.worst case my sy tha ik question
kuch MCQS jo mujy yaad rahy wo ye hen
1.What is the total time to heapify.
2.word Algorithm comes from the name of the muslim author....................
3.Al-Khwarizmi’s work was written in a book titled .....................
4.................. is a graphical representation of an algorithm.
5.If there are Θ (n2) entries in edit distance matrix then the total running time is
6.Divide-and-conquer involves breaking the problem into a small number of .
7.Any comparison-based sorting algorithm has worst-case running time:
8.What is the solution to the recurrence T(n) = T(n/2)+n
9.A (an) _________ is a left-complete binary tree that conforms to the heap order
10..A heap is a left-complete binary tree that conforms to the_________.
11.In plane sweep approach, a vertical line is swept across the 2d-plane and _______structure is used for holding the maximal points lying to the left of the sweep line.
ISHTIAQ HUSSAIN thanks for sharing
Can you please upload Muhammad faisal dar file here?
parisha bs thanks for sharing
thx
thx
1) Draw a binary tree for this order of matrix multiplication.(A1(A2A3))(A4A5)
2) How we maintain Heap property?
3) How to construct an optimal solution for o/1 knapsack problem?
4) How can we avoid exponential running time of o/1 knapsack problem using dynamic programming?
5) Illustrate how radix works on the following words:
COW,DOG,SEA,RUG,ROW,MOB,BOX,TAB
Today Midterm Paper Fall 2015
Question : 26
Marks : 40
Time : 60 Mints
Total 1 Marks Mcqs : 20
Total 2 Marks Short : 2
Total 3 Marks Short : 2
Total 5 Marks Short : 2
Q1-Q20 90% MCQS from moaz and Muhammad Faisal dar 20 Marks
Q21 .Worst case for Edit distance Algorithm? 2 Marks
Q22. What is the necessary assumption for average case analysis quick sort? 2 Marks
Q23. How spelling correction in edit distance? 3 Marks
Q24. Don't Remember.... 3 Marks
Q25. Draw a binary tree for this order of matrix multiplication.(A1(A2A3))(A4A5) 5 Marks
Q26. Solve Recurrence Relation.. 5 Marks (Quick Sort-Handout Page#51)
Best of Luck!
Can you please upload Muhammad faisal dar file here?
Assalm o Alikum
My today paper CS502
MCQs mostly from handouts
Sbjective are there:
1 Necessary assumption for average case analysis in quick sort? (2)
2 What running time in brute- force analysis? (2)
3 How edit distance is used in the Spelling Correction?(3)
4 Common and difference in Divide and conquer ? (3)
5 Effect of calling Max-Heapify(A,i) when i > heap size(A)/2? (5)
6 Aik Algorithm likhna tha (5)
Best wishes for all
© 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