Answer / kms

16

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 is the ans of prefix formula - + / 16 ^ 2 3 * 10 4 * 16 3

0 Answers  

---

what is the difference between oracle 8i and 9i. if someone could help me out.

0 Answers  

---

a tap can fill the empty tank in 12 hours , but due to a leak in the bottom it is filled in 15 hours. If the tank is full then tap A is closed then in how many hours the leak can empty it?

3 Answers   Mind Tree,

---

A binary tree with 20 nodes has_________null branches?

3 Answers  

---

what is the diffeence between SQL and ORACLE?

0 Answers  

---

#include<stdio.h> void main() { int x,y,z; x=1; y=1; z=1; z=++x||++y&&++z; printf("%d%d%d",x, y ,z); }

1 Answers  

---

HTML tag for bulleted list is--------------

0 Answers  

---

2. Tell me about a time when you had to use your presentation skills to influence someone's opinion.

0 Answers   Strad Energy,

---

plz explain abt refrigeration r22 bitzer comprassors trouble shooting and maintenance

0 Answers  

---

What is the allowable load carrying capacity of a circular column section of 400 mm diameter reinforced with 6x25 mm diameter bars adequately tied with spirals? Consider concrete of grade M25 and steel of grade Fe 415.

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,

---