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.
Amoney decree carmot be executed against a woman judgment debtor by adopting one of the following modes:
A contract is ______________ because it was caused by a mistake as to any law in force in India
Indescent and scandalous questions are discussed under which section of the Indian Evidence Act, 1872?
As per s. 18 a partner is:
The holder must allow the drawee of a bill of exchange ……….. to consider whether he will accept it or not.
Which case is known as Post-Master Case?
As per Section 21 of the Factories Act, 1948, every factory should fence which of the following machineries?
Where a person who is in a position to dominate the will of another, enters into a contract with him, and the transaction appears, on the face of it or ...
What is required of every recognized stock exchange in terms of reporting to the Central Government as laid down under the SCRA?
Any person aggrieved by an order of the Board made before the commencement of the Securities Laws (Second Amendment) Act, 1999 may prefer an appeal to ...
Relevant for Exams:
