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

www.vustudents.ning.com

 www.bit.ly/vucodes + Link For Assignments, GDBs & Online Quizzes Solution www.bit.ly/papersvu + 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

# CS502 Current MID Term Papers Fall 2012 Date: 08-December-2012 to 19-December-2012

CS502  Current MID Term Papers Fall 2012 Date: 08-December-2012 to 19-December-2012

+ 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?

Views: 2162

.

+ 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

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?

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.

Thanxx

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.

Thanxxx

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)

Thanxx

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.

## Latest Activity

9 minutes ago
11 minutes ago
+ ! !《"•Ｓｙｅｄａ•"》 liked + IUUOƆƎUT +'s discussion ابھی تو ع پر ہو تم
16 minutes ago
34 minutes ago
Waqas joined + M.Tariq Malik's group

35 minutes ago
43 minutes ago
43 minutes ago
43 minutes ago
1 hour ago
1 hour ago
1 hour ago
1 hour ago

1

2

3