by Uzma
Kanwal (MCS 3rd) on
My CS502
ppr 23-12-13 tuesday
Mcqs ez thay 4,5 new thay baki moaz file say thay
1.how we build heap sort?2
2.quick sort ka tha statement page 49 line 6 wali
statement the kuch is ko xplain karna tha
3.What is the worst case running time for the Quick 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).3
4. brute force and dynamic approach ko mix kar k kuch tha
pg 92 ki line 7 wali statement the kuch 3
5. knapsap ki statement the k decreasing order ma move hota hay T/F hay
reason b dyne the 5 marks ka
6-
steps in dynamic problem 5
best ov luck guyz
Mcqs ez thay 4,5 new thay baki moaz file say thay
1.how we build heap sort?2
2.quick sort ka tha statement page 49 line 6 wali
statement the kuch is ko xplain karna tha
3.What is the worst case running time for the Quick 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).3
4. brute force and dynamic approach ko mix kar k kuch tha
pg 92 ki line 7 wali statement the kuch 3
5. knapsap ki statement the k decreasing order ma move hota hay T/F hay
reason b dyne the 5 marks ka
6-
steps in dynamic problem 5
best ov luck guyz
No comments:
Post a Comment