Tell me the jobs for the MCA Fresher in delhi, Noida..

0 Answers  

---

I've an application where i need to give access to all the features only to admin and only few features to normal users. Say Menu...i dont want all my menu items to be accessible to all the users only the admin people can see few all the features where as normal users can have access to limited menu items...how can i achieve this. Please note that my menu is not a database driven menu.

1 Answers   Tesco,

---

WHat is execution in manual testing and when will we start execution and what language we use in execution

0 Answers  

---

Piggy backing is a technique for a) Flow control b) sequence c) Acknowledgement d) retransmition

17 Answers   Fast Booking, HCL, Lucent, NIC,

---

why we use static with only main()class not with other class

2 Answers   TCS,

---

in a company 30% are supervisors and 40% employees are male if 60% of supervisors are male. what is the probability that a randomly choosen employee is a male or female?need steps to solve this?

1 Answers   TCS,

---

Is there any standard procedure to test the application as a whole? Or How can I test complete application right from the requirement gathering?

0 Answers  

---

Is CTS company do serious backgroung check?

0 Answers   CTS,

---

what is the difference between rename and label

0 Answers   Satyam,

---

how do we provide security for web services

0 Answers  

---

3. What is the difference between testing and Quality Assurance?

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  

---