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
- Which of the following power plants is known for being a renewable energy source that utilizes the Earth's internal heat?
- Which activation function is typically used in the output layer of a regression task?
- Which one of the following statements is FALSE?
- State true or false FDMA is a communication technique that divides the available frequency spectrum into multiple non-overlapping frequency bands. Each us...
- The java.sql and javax.sql are the primary packages for JDBC 4.0.
- Which network layer protocol is responsible for multicasting, where a packet is sent to multiple destinations simultaneously?
- Which statement is true about Python indentation?
- Which layer of the OSI model do stateful firewalls primarily operate at?
- What is the purpose of encryption in cybersecurity?
- Which error correction technique is capable of correcting single-bit errors and detecting two-bit errors?
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)