Answer Posted / kanchan

charAT

Given an array all of whose elements are positive numbers, find the maximum sum of a subsequence with the constraint that no 2 numbers in the sequence should be adjacent in the array. So 3 2 7 10 should return 13 (sum of 3 and 10) or 3 2 5 10 7 should return 15 (sum of 3, 5 and 7)

1152

---

what is programmable BIST in today ic design

2116

---

How to get the index of the clicked field in reports in ABAP?

1663

---

What is ur porject Architecture? If anyone ask what i have to specify here..

1914

---

Have you used callsymputx? what points need to be kept in mind when using it?

1952

---

what are all the ant command options

2036

---

You are given some denominations of coins in an array (int denom[])and infinite supply of all of them. Given an amount (int amount), find the minimum number of coins required to get the exact amount. What is the method called?

1051

---

What binary value will be internally stored for NULL for the type S9(1) COMP 3 in mainframe

1951

---

Write a program to show polymorphism.

1089

---

what is delimiter in sas ?

1995

---

Difference between delegates and Events?

2147

---

Hi Guys, This is Rama, right now I am working as a Software Test Engineer in Gurgoan and I have over all 3 years of testing expoeriance. Right now I am looking for a change. Can any body help me out to find a job in south india. Thanks in Advance

1855

---

WS-NUM PIC S9(05)V(02) SIGN TRAILING SEPARATE MOVE '0050000+' TO WS-NUM The value stored is 00500,00+ MOVE '0050000-' TO WS-NUM Then what is the value will be stored in WS-NUM? Am getting '-00500,00'.....>>> What should I declare to WS-NUM so that I can get correct values for both + & - signs.

2318

---

how can we implement locks in plsql?

2278

---

How to change the color of a cell or a row in a datagrid on mouse hover using javascript/.net

1970

---