Give an algorithm for the following problem and determine its time complexity. Given a list of n distinct positive integers, partition the list into two sublists, each of size n/2, such that the difference between the sums of the integers in the two sublists is maximized. You may assume that n is a multiple of 2 (i.e. n is even).

1 Answers  

---

Tell me about a time when you had too many things to do and you were required to prioritize your tasks

0 Answers  

---

why IT?

0 Answers  

---

My system suddenly get off,when i try to power on then it does not work but when i open it and clean RAM and insert it again, it power on.but after some day same problem? please give the answer (i have also changed RAM it's new.)

0 Answers  

---

why do we use first angle projection and third angle projection only and not 2nd and 4 thangle projections?

2 Answers   Crompton Greaves,

---

how do we calculate physical address if logical address is given in the question?

0 Answers   TCS,

---

AD backups and restoration

0 Answers   Wipro,

---

explain overloaded constrator &copy constractor

0 Answers  

---

what are differences b/w EIA 449 and EIA 530?

0 Answers  

---

which is your dream company and why?

2 Answers   Honeywell, IBM,

---

A company canteen needs an automated system for its food and beverage management. The canteen receives food and beverage items from different distributors. All the non perishable items are stored in the store-room and the perishable items are put in the fridge. The manager should be able to add, delete or update food and beverage items onto the system and perishable and non perishable item details are to be stored separately. Both waiters and the cooks should be able to update the perishable items, but only the cooks should be allowed to update the non perishable items. Both cooks and waiters are not allowed to add or delete any items that are entered. identify the Schema, Table , Fields

0 Answers   Accenture,

---

what is mean by tranducer

0 Answers  

---