Question
Running time T(n) where 'n' is the input size of the
recursive algorithm given as : T(n) = c + T(n-1), if n > 1 ; T(n) = d if n < 1. The order of the algorithm isSolution
The running time T(n) where ‘n' is the input size.
In a queue of commanders, Andry is 17th from the extreme front-end and Brooke is 32nd from the extreme back-end. If the two exchange their positions, An...
NGPZ is related to JCLV in a certain way based on the English alphabetical order. In the same way, XDLM is related to TZHI. To which of the following is...
Complete the series:Â
P3C, R5F, T81, V12L,?
Which of the following Venn diagrams best represents the relationship between stars, planets and universe ?
Which answer figure will complete the pattern in the question figure? (rotation is not allowed)
In this question, the relationship between different elements has been shown in the statement.
After the statement, two conclusions have been giv...
Each vowel in the word ‘SIMILAR’ is changed to the following letter in the English alphabetical order and each consonant is changed to the preceding...
In the following question, select the related number from the given alternatives.
49: 245: 37: 148:: 47: ?
What should come in place of the question mark (?) in the given series based on the English alphabetical order?
EHO HJP KLQ ? QPS
What should come in place of? in the given series based on the English alphabetical order?
FNV  LUE ?  XIW  DPF
Relevant for Exams:
