CS502 - Fundamentals of Algorithms
Fall Spring 2012
MID TERM Paper
Dated May 11,2012
Time 1 hour
Total Marks 40
Attempt by Umair Saulat saulat.umair@gmail.com May 11, 2012 at 7.30AM,
Campus North Nazimabad Karachi
Total Question 26
MCQs 20 80% MCQs are New.
Short Question 2 x 2
Short Question 2 x 2
Short Question 2 x 3
Short Question 2 x 5
80% MCQS are New.
QNo.1 What is heap and what is heap order? (Mark2)
QNo.2 Quick sort such that sort the array in to non-increasing order? (Mark2)
QNo.3 Draw the cost table for chain multiplication problem with initial states(Mark3)
QNo.4 we can avoid unnecessary repetitions for recursive calls? (Mark3)
QNo.5 Matrix multiplication is an associative with commutative operation, explain? (Mark5)
QNo.6 Statement (Mark5)
Zindagi mein 2 Logo ka buhat khayal rahkoooo
2nd woh jiss ko tum ney har dukh me pukaara hoo (Mother)
--
Please visit http://vusr.net for Old and Latest Papers, Assignments, Quiz and GDBs.
http://VUSR.net The ultimate VU Study Resource
You received this message because you are subscribed to the Google
Groups "VUSR" group.
To unsubscribe
vusr+unsubscribe@googlegroups.com
To Visit Group Home Page
http://groups.google.com/group/vusr?hl=en?hl=en
No comments:
Post a Comment