Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


What is a programming language?



What is a programming language?..

Answer / nashiinformaticssolutions

o A programming language is a formal language comprised of instructions used to produce various kinds of output, primarily used to control the behavior of a computer.

Is This Answer Correct ?    0 Yes 0 No

Post New Answer

More Programming Languages AllOther Interview Questions

Diff between IF and where ?

0 Answers   Accenture,


how can i split string in a textbox in windows appication using C#.net

0 Answers   IBM,


what are the activities you enjoy most and How do you see these Developing in the Future with Reference to in your work life and in your personal life

0 Answers  


Where do we need Operator overloading?

0 Answers   BirlaSoft,


where is available in this mantis toturials?

0 Answers  


What is meant by spooling

2 Answers   Qiscet,


Write code to read the records from a file and load any array of size 99?make sure that you take care of all the error conditions?

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  


suppose we have ten members of a physical file but we want the output of last 5 members only.how to achieve that?

0 Answers   Bank Of America,


Write 5 differences between Memory Reference Instruction and Register Reference Instruction.

1 Answers   TCS, TJM,


what is the difference between rename and label

0 Answers   Satyam,


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  


Categories