The recurrence equation T(n) = T(n/2) + 1 represents the time complexity of which algorithmic paradigm?
- Correct Answer: Algorithms
- Divide and Conquer
- Greedy Algorithms
- Dynamic Programming
Explanation: Brute Force
More Random Questions
Q: Which medal did India's Ekta Bhayan win in the World Para Athletics Championship?
Ans: Gold
Ans: Gold
Q: What was the private investment growth rate in Q1 2025?
Ans: 10.5%
Ans: 10.5%
Q: Which text is known as the Tamil Veda?
Ans: Tirukkural
Ans: Tirukkural
Q: What term in science describes not just a guess, but a well-formed set of explanations for a phenomenon?
Ans: theory
Ans: theory
Q: Who was the first Governor of Bihar and Orissa in 1912?
Ans: Sir Charles Stuart Bayley
Ans: Sir Charles Stuart Bayley
Q: Which of these is a type of soil?
Ans: Clay
Ans: Clay
Q: How many medals has India won in the 17th International Earth Science Olympiad?
Ans: 8
Ans: 8
Q: Which World War II event was a naval battle in the Pacific?
Ans: Battle of Midway
Ans: Battle of Midway
Q: In which process do paired chromosomes normally separate from each other?
Ans: meiosis
Ans: meiosis
Q: Cardiac muscle normally has what kind of oxygen-using metabolism?
Ans: aerobic
Ans: aerobic
Q: What is the amount of product that may be produced by a reaction under specified conditions called?
Ans: theoretical yield
Ans: theoretical yield
Q: What converts light energy into chemical energy in photosynthesis?
Ans: Glucose production
Ans: Glucose production
Q: What is the minimum age for a learner’s license for a car?
Ans: 18
Ans: 18
Q: Where did Prime Minister Modi announce the opening of the Indian Consulate?
Ans: Boston and Los Angeles
Ans: Boston and Los Angeles
Q: What is the fine for driving with an expired learner’s license?
Ans: ₹5,000
Ans: ₹5,000
