Interested to Buy Any Domain ? << Click Here >> for more details...
When we delete logfiles such as screenshots how does it
affect the ldf file? Ive seen huge change while adding
screenshots in the ldf file but a very minor one deleting
them.Please Explain
- 0 Answers
- 1915 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
hai i am mca 2009 fresher.please tell me which certification helps me to get an IT job faster which institute is good in hyderabad.please mail me to prasanna.1856@rediff.com
Write a shell program where you enter a number which corresponds to K.M. Find out the corresponding values in m, cm, inches, and feet. Hints:- 1 k.m= 1000 m 1 m= 100 cm 1 inches= 2.54 cm. 1 feet= 12 inches
What is the difference between procedure -oriented language and object oriented language?
22 Answers IBM, Infosys, TCS,
a characteristic of a multiprogramming is? a.simultaneous exe of pgm instr 4m 2 appli b.concurrent processing of 2 r more prgms c.multiple cpu s d.all the abov
What is meant byStatic Variable ?
what is difference between oracle and pl/sql
What do you meant by Runtime Polymorphism?
how sap is different from other software ?
Write a shell program. Enter basic pay of an employee and calculate DA, HRA, Deduction, Gross pay and Net pay as follows: DA = 75 % of BASIC HRA = 10 % of BASIC DEDUCTION = 15 % of BASIC GROSS PAY = BASIC+DA+HRA NET PAY = GROSS PAY-DEDUCTION.
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.
smal talk is pure object oriented or not?
hi..this is kartheek..complted mca in 2009..but i dont have knowledge in programing..but to learn new language.. which one is suitable for me?is SAP or IBM mainframes is suitable for me..?if it suits how much will it costs..?pls answer...
C 
