given an unorder list of n numbers x1,x2,x3,........xn and all elemnts are common if there are at least n/5 copies.give a o(nlogn) algorithm
: 5 marks ka qstn tha
: 2. Draw max heap 50,31,45,30,2,7,40,12,28,1 ..marks(5)
3.construct an optimal solution for 0/1 knapsack
4. define with algorithm bubble sort,insertion sort and selection sort
5.how can we make it possible for an array of n elements that every elemnt has equal probability of 1/n to select uing pivot elemnets
6.Plagrism detection with algorithm
mcqs buht mushkil that theory based nhi thay best n worst case algorithm ki timing ko prove krnay walay mcqs thay.koi b past papers mein say nhi tha
--
Contact Owner Id: zainalizaini@gmail.com
www.virtualinspire.com
If you want domain and web hosting. Also contact with me.
5000 per year with cpanel and domain name free with it.
No comments:
Post a Comment