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 us about your quality engineering experience?

0 Answers   DELL,

---

Why is using C language

0 Answers   IOCL,

---

What is the aim of Value Engineering?

0 Answers   BPCL Bharat Petroleum,

---

What are the benefits of using interface accept multiple inheritance concept?

2 Answers   IBM,

---

sir , i am prparing for IOCL engineergin post please send me the old placement papers

0 Answers   IOCL,

---

hi frnds,im from andhra pradesh.i gt selected in sbi exam.my interview is on 3rd may'10.i applied under bc-e category as i belong to muslim "shaik".but nw i came to knw that it does not apply to bank exams.plz help me out.i have bc-e certificate issued by my area mro in feb'10.is this sufficient r else i had to carry other certificate..

1 Answers  

---

Tell me about a major problem you recently handled. Were you successful in resolving it? in petroleum side ?

0 Answers   Byco,

---

what is the difference between embedded system and PLC. Whether the micro controller accept future expansion of program?

0 Answers  

---

i want to do oracle certification..could any one pleas tell me what is the level 1 certification exam in oracle? how do we get dumps?

0 Answers   TCS,

---

explain in detail about life cycle of thread

0 Answers  

---

what are the artifacts in coding phase in SDLC????

0 Answers  

---