Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Aspire Study - Best NIMCET Coaching

🎯 Crack NIMCET with Aspire Study

🔹 India's Most Trusted MCA Coaching
💻 Live + Recorded Classes | 👨‍🏫 Expert Faculty
📝 All India Test Series | 🎯 Personal Mentorship

🥈 NIMCET AIR 2: Ayush Garg

🚀 Join Aspire Now

📂 Aspire Study Library

Question Id : 17386 | Context : UGC NET Computer Science June 2024 (Paper II)

Match List-I with List-II.

$f(n) = a f(n/b) + g(n)$ is a divide-and-conquer recurrence relation for the Listed-I algorithms, match their recurrence in Listed-II.

 List-I (Algorithms)

List-II (Recurrence Relation)

 
 A. Binary Search
 I. $f(n) = 7f(n/2) + 15n^2/4$
 B. Find maximum and minimum of a sequence
 II. $f(n) = 2f(n/2) + n$
 C. Merge Sort
 III. $f(n) = 2f(n/2) + 2$
 D. Fast Matrix Multiplication

 IV. $f(n) = f(n/2) + 2$

Aspire Study Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More
📲
Ask Your Question or Put Your Review.

loading...