mcq,s majority comes from past ppr................View more random threads:
- MGT 603 mid term current paper spring 21 May 2011
- ECO401 Current Spring 2011 Final Term VU Paper [July 2011]...
- MGT401 Current Final Term Papers Spring 2011
- CS604 Operating Systems mid term current paper 22 May 2011
- current papers of CS402- Theory of Automata final term...
- CS605 Current Final Subjective Paper shared by vuhelp.net...
- FINALTERM EXAMINATION solve paper current Spring 2011...
- MGT503 Principles of Management Current Midterm Paper Held...
- Mgmt623 Current Spring 2011 Final Term VU Paper July 2011...
- Today paper of MGT603 mid term paper 13 May 2011
subjective:
1- Consider sorting three no,s a1,a2 and a3 with comparision based sorting algorithm and tell how many combinations are possible? (2)
2- If v solve knapsnap algorithm with brute force and it takes O(2^n)time to can we do it better?
3- T/F: A sequence of values in a column of dynamic programming tble for an instance of the knapsnap problem is alwayz non-decreasing.Give brief ans.
4_what change is requried to quicksort such that it sort assume to be non -decreasing order?
5- write an pusodo code of knapsnap dynamic programing algorithem.....wo jo last waly lecture main hai.
6- aik aur v tha question wo yaad nae...ajeeb sa tha...
Sponsored Links
There are currently 1 users browsing this thread. (0 members and 1 guests)