Question
An algorithm has a time complexity of O(N² ). If the
input size N doubles, how does the execution time approximately change?Solution
If the complexity is O(N² ), and N becomes 2N, the new time will be proportional to (2N)²  = 4N² . So, the execution time approximately quadruples.
Government lowered the export obligation under a key incentive scheme Export Promotion Capital Goods (EPCG) for 192 products whose exports had declined ...
HAL’s Helicopter Factory is going to be set up in?
BIMSTEC Energy Center will be set up in which country?
According to a study, every rupee invested in agricultural research in India yields a return of nearly ₹____.
Petteri Orpo has been elected as the new Prime Minister of which country?
Which of the following is NOT a town/city on the west coast of India?
Under the Tamil Nadu Assured Pension Scheme (TAPS), the assured pension is fixed at what level?
Who will launch the Computerization project for Agriculture and Rural Development Banks (ARDBs) and the Registrar of Cooperative Societies (RCSs) on Jan...
Barbados is the newest republic recently formed, identify the capital of Barbados?
As per the latest FIFA rankings, what position does India hold in the men’s rankings, and which country is at the top?
