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  

---

what does static variable mean in c language?

0 Answers  

---

what are the simlerities between macro and subroutine

0 Answers   TCS,

---

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

0 Answers  

---

Are bridges more stable on concrete or on soil - why?

0 Answers  

---

Client server applications

0 Answers   TCS,

---

Prepare the UGC CSIR net question papers those are enough. The question paper will be of 50 questions in size each 3 marks and with a negative of -1 for each wrong answer

0 Answers   Ecil,

---

T is a tree and V is a vertex of T of maximum degree in T, say the degree of V in n. Prove that T has atleast n vertices of degree 1.

0 Answers   TCS,

---

In an entity relationship, y is dominant entity and x is a subordinate entity. Then which of the following is/are correct 1. operationally, if y is deleted, so is x 2. x is existence dependent on y 3. operationally, x is deleted on y 4. operationally, x is deleted, y remains the same

4 Answers   HCL,

---

how to create user name stape by stape in cisco router {with command}

0 Answers  

---

difference between tcp ip and open system interconnection

0 Answers  

---

What is difference between ext2 and ext3 in linux

1 Answers   NetMagic,

---