Answer Posted / rose

c)Acknowledgement

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)

1199

---

give idea for creating screen in abap

2155

---

How to call dll API sub routine in VB Form.

2366

---

how to study PHP my own? i reffered many sites.. but as being a fresher i couldnt follow those... which site will be the best one?

2280

---

How to use string functions in QTP?give some examples

7916

---

How to set fixed width in particular in html? if i type more character in this it will not push near . this is my question. can u tell me the answer...

2558

---

is it possible to desable particular parameter of the normal orcle report based on some condition ?????? if yes,wht is the function for desabling a parameter...

2070

---

Define distributed queries. can you explain me as soon as possible

2107

---

write a sql qwery which include joining of two tables 4 marks mainframe

1942

---

What is diffrent between Method and and function in c#

2019

---

What do you understand by modular programming?

1163

---

How does the TCP handle the issue of multiplexing?

2892

---

For a binary tree with n nodes, How many nodes are there which has got both a parent and a child?

3668

---

Given a Binary Search Tree, write a program to print the kth smallest element without using any static/global variable. You can?t pass the value k to any function also.

974

---

hi This is radhika.Can anyone help me to know the question papers of NATIONAL INFORMATICS CENTRE for the post of scientific officer/engineer? if anyone know plz tell me question paper pattern

2093

---