Piggy backing is a technique for
a) Flow control b) sequence c) Acknowledgement
d) retransmition
- 17 Answers
- 34399 Views
- Fast Booking, HCL, Lucent, NIC, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
How to call dll API sub routine in VB Form.
THE CHANNEL IN DATA COMMUNICATION CAN BE?
what is throws keyword
1.What is difference between symget and & in sas? 2.what is difference between callsymput and %let?
what is dynamic polymorphism?
could you please tell me how to draw the calibration curve for HPLC {the software which we are using}?
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 ≤ i0 <i1….< ik-1 ≤ 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.
hi this is uday i want prepare for nic exam if any one have previous question papers please send me or atlest guide me how to prepare my ID is udaykiran4u@in.com
HOW TO BREAK THE FIREWALL?
WHAT IS MAIN IMPORTANT THING IN SOFTWARE?
in network security,how we identified threat?some one say we found threat according to it's signature,but how we get signature or pattern of the virus?
Expand the following a) ISDN b) CASE c) CSMA/CD d) OOPS e) MIMD
C 
