We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

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


+ Click Here To Join also Our facebook study Group.

..How to Join Subject Study Groups & Get Helping Material?..

See Your Saved Posts Timeline

Views: 5074


+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

Replies to This Discussion

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 




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:


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


Latest Activity

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

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