what is inprocess and outprocess in vb

1 Answers   Msoft,

---

When you?re running a component within ASP.NET, what process is it running within on Windows XP? Windows 2000? Windows 2003?

2 Answers   BirlaSoft,

---

I am looking for selenium RC online Training in chennai. can any one tell me the best institute

0 Answers  

---

In mainframe SDSF, Can we copy the list of jobs currently executing in SDSF in to a seperate DATASET...?

0 Answers   DST Global Solutions,

---

what is meaning of MDM in sap?let me know that meaning

0 Answers  

---

how do i create my own exception class which will restrict IO exception?

0 Answers  

---

hii I inntrested abt scjp certification but i dont knw abt scjp plz send details abt scjp exam and syllabus.

0 Answers  

---

we can use parameters in cl and rpg pgms...etc.in particular i think when we use data area or datastructure or data queue .i think this means which one====in my question...parameters cannot be passed in which one????hope understand my qstn???

0 Answers   CTS,

---

___ method used to move a recordset pointer in nth position in DAG.

1 Answers  

---

There are 2 tables: EMP : EmpId, Ename, Sal, DeptId DEPT : DeptId, Dname Write a query to find out emp names and their department names. if any emp has null in Deptid the it shows ?No Department?. Write a query to find out those department names which has no employee. Write a query to find out those employees whose salary is greater than their department?s average salary.

1 Answers   Oracle,

---

In Bioinformatics, a DNA sequence is made up of a combination of 4 characters, namely “A,C,G,T”. A subsequence of a given sequence of characters a0, a1, …an- 1, is any subset of the characters taken in order, of the form ai0 , ai1 ,…..aik-1 where 0 &#8804; i0 <i1….< ik-1 &#8804; n-1. For example in the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, we can have subsequences “A,G,T”, “A,C,A,A” and many more. A subsequence is palindromic if it is the same whether read left to right or right to left. For instance, the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, has many palindromic subsequences, including “A,C,G,C,A” and “A,A,A,A” (on the other hand, the subsequence “A,C,T” is not palindromic). Devise an algorithm (using dynamic programming) that takes a sequence of characters X[0 … n-1] from the alphabet set (A,C,G,T) and returns the (length of the) longest palindromic subsequence. Implement the algorithm in an appropriate language.

1 Answers  

---

if we want to move all the items that are already added in a combobox into an empty list box or vice-versa then how can it possible in vb or C# ?

1 Answers  

---