Why did you ever become involved in QA/testing?

0 Answers  

---

Crystal report proffessional 9 to filter the issue date!!

1 Answers  

---

1Q) your current CTC (current taking currency)? 2Q) Your take home salary?(Monthly Drawing amount, According to your payslips/bank statement) 3Q) Your Expected CTC? 4Q) Your home take salary?

1 Answers  

---

19. Given a system that is described with the following equation, X=A+(B.(A̅+C)+C)+A.B.(D̅+E̅) a) Simplify the equation using Boolean Algebra. b) Implement the original and then the simplified equation with a digital circuit. c) Implement the original and then the simplified equation in ladder logic.

0 Answers   Bajak Paint,

---

difference between list and display command ?

3 Answers  

---

---

What is a singleton linked list?

1 Answers   Wipro,

---

shall we execute our java programmes in jre

0 Answers  

---

As per interoperatbility programs written in one language can be used by other language. How can we restrict the features of one language (say C#) in the programmer written in another language (say VB)..for example we have some features like operator overloading which is possible C#.NET (not in VB.NET), how can we restrict that when we are using this code in VB.NET.

0 Answers   Tesco,

---

I have try to write a record in a TDQ from a fle.... what are the steps to do... can anybody plz come with a solution

0 Answers  

---

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  

---

which one is the best practice using synchronization method or synchronization block

1 Answers   TCS,

---

what will be the model paper for the post of assistant programmer in delhi high court

2 Answers  

---