Scribd
Upload
27 views1 page

Tutorial Week3 Friday

This document outlines a tutorial assignment for the BTech course 'Design and Analysis of Algorithms' for the semester 2024-2025. It includes four questions focused on solving recurrence relations and applying methods such as change of variable, master theorem, and recursion tree. The assignment is mapped to course outcomes CO1, CO2, and CO3.

Uploaded by

saiganesh.k
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
27 views1 page

Tutorial Week3 Friday

This document outlines a tutorial assignment for the BTech course 'Design and Analysis of Algorithms' for the semester 2024-2025. It includes four questions focused on solving recurrence relations and applying methods such as change of variable, master theorem, and recursion tree. The assignment is mapped to course outcomes CO1, CO2, and CO3.

Uploaded by

saiganesh.k
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Course/ Batch: BTech/ SCSET Course Type: Core

Course Code: CSET244 Course Name: Design and Analysis of Algorithms


Semester: Even
Session: 2024-2025

Tutorial Assignment: Week 3

Tutorial title: Solving Recurrence Relation

CO Mapping

Question no CO1 CO2 CO3


Q1 ✓ ✓
Q2 ✓ ✓
Q3 ✓ ✓
Q4 ✓ ✓

Q1. Let the recurrence relation T(n) = T(n-1) + T(n-2) - T(n-3) for n>3, and for n≤3 T(n)=n. Give (.)
bounds for T(n).

Q2. Solve the following recurrence relation using change of variable method and give a  bound for it.
T(n) = 2T(√n) + 1

Q3. Give (.) bounds for T(n) in each of the following recurrence relations using master theorem.
𝑛
(i) T(n) = 4T( ) + √n
16
𝑛
(ii) T(n) = 2T( 2) + nlogn

Q4. Find the (.) bounds for T(n) of the following recurrence relations using the recursion tree method.
T(n) = T(n/10) + T(9n/10) + n

You might also like