What is the difference b/w Object base and object oriented programming?

1 Answers  

---

Number of null pointers in any binary tree

5 Answers   Infosys,

---

What for decision coverage and modified condition decision coverage are used? Wat is the difference between them?

0 Answers  

---

What is std::auto_ptr?

1 Answers   Amazon,

---

where is available in this mantis toturials?

0 Answers  

---

what are importance in problem tracking

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  

---

Explain the types of operations? Draw the figure for shift and rotate operations?

0 Answers  

---

hai i am prasanna.I am MCA 2009 fresher.tell me about certifications.which certification helps me to improve my carrier and to get a technically oriented job ,which certification helps to get job faster.

0 Answers  

---

how many trailing zeroes are there in 100! (100 factorial)?

5 Answers  

---

SAS using companies in INDIA

29 Answers   Bank Of America, Cap Gemini, Hyundai, IBM, KO, Sristek, TCS, Wipro, WNS,

---

Ordered List tag is

1 Answers  

---