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 is
More IT Networking Questions
- In which network topology does data travel in only one direction around the loop?
- What is a blockchain?
- What is CBS?
- The SI unit for measuring pressure is:
- A 'ransomware' attack typically involves:
- A client sends a request to a protected resource without any credentials. The server requires authentication. Which status code should the server return, a...
- What is the purpose of the try-catch-finally construct?
- What does a diamond shape represent in an ER diagram?
- What does PHP stand for?
- Which of the following correctly describes 'public key infrastructure' (PKI)?
Relevant for Exams:
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)