Scribd
Upload
45 views3 pages

Dsa-1 Unit-1 Assignment

This document outlines an assignment for the Data Structures and Algorithm-1 course for the academic session 2024-25, detailing submission dates and faculty contact information. It includes a series of questions covering topics such as running time analysis, upper and lower bounds of functions, solving recurrences using various methods, and differences between linear and non-linear data structures. Students are instructed to submit their assignments in PDF format and avoid plagiarism.

Uploaded by

i.shubhamkumarjha
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
45 views3 pages

Dsa-1 Unit-1 Assignment

This document outlines an assignment for the Data Structures and Algorithm-1 course for the academic session 2024-25, detailing submission dates and faculty contact information. It includes a series of questions covering topics such as running time analysis, upper and lower bounds of functions, solving recurrences using various methods, and differences between linear and non-linear data structures. Students are instructed to submit their assignments in PDF format and avoid plagiarism.

Uploaded by

i.shubhamkumarjha
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
You are on page 1/ 3

Data Structures And Algorithm-1 SESSION: 2024-25

(BCSE-0301)
COURSE/SEM: B.TECH/IIIrd
UNIT-I
Assignment Given Date: 03/09/2024
Assignment Submission Date: 23/09/2024
Faculty Name: - MOHIT KUMAR Faculty Mail Id: [email protected]
INSTRUCTIONS:

1. Submit the assignment before the due date.


2. Avoid copying the assignment, if found student will be penalized accordingly.
3. Mention all the necessary details in your pdf file. All assignments should be in a pdf file format. No
other format will be entertained.

BLOOM’S
Q. No. Question Statement CO KNOWLEDGE
LEVEL

1. Calculate the running time of the following


functions?
1.

CO1 K3
2.

3.
4.

5.

2. Elaborate the following terms:

1. Running Time Analysis


2. Rate of Growth CO1 K1
3. Types of Analysis
4. Asymptotic Analysis
5. Properties of Asymptotic Analysis
3. Calculate the Upper Bound of the following functions:

1. 𝒇(𝒏) = 𝟑𝒏 + 𝟖
2. 𝒇(𝒏) = 𝒏𝟐 + 𝟏
3. 𝒇(𝒏) = 𝒏𝟒 + 𝟏𝟎𝟎𝒏𝟐 + 𝟓𝟎
4. 𝒇(𝒏) = 𝟐𝒏𝟑 − 𝒏𝟐 CO1 K3
5. 𝒇(𝒏) = 𝒏
4. Calculate the lower bound of the following functions:

1. 𝒇(𝒏) = 𝟓𝒏𝟐
2. 𝒇(𝒏) = 𝟏𝟎𝟎𝒏 + 𝟓 ≠ 𝝎(𝒏𝟐 )

𝒏𝟐 𝒏 K3
 Find the ϴ bound for 𝒇(𝒏) = −𝟐
𝟐
 Prove n≠ϴ(𝒏𝟐 )
 Prove 𝟔𝒏𝟑 ≠ 𝜽(𝒏𝟐 )
5. Solve the following recurrences using Master Theorem: Dive
and Conquer Problems.

𝒏
1. 𝑻(𝒏) = 𝟐𝑻 (𝟐) + 𝒏𝒍𝒐𝒈𝒏
𝒏
2. 𝑻(𝒏) = 𝟔𝑻 (𝟑) + 𝒏𝟐 𝒍𝒐𝒈𝒏
𝒏
CO1 K3
3. 𝑻(𝒏) = 𝟔𝟒𝑻 (𝟖) − 𝒏𝟐 𝒍𝒐𝒈𝒏
𝒏
4. 𝑻(𝒏) = √𝟐𝑻 (𝟐) + 𝒍𝒐𝒈𝒏
𝒏
5. 𝑻(𝒏) = 𝟑𝑻 (𝟑) + √𝒏
6. 𝑻(𝒏) = 𝑻(√𝒏) + 𝟏
6. Solve the following recurrences using Iteration Method

𝟑𝑻(𝒏 − 𝟏), 𝒊𝒇 𝒏 > 𝟎


1. 𝑻(𝒏) = {
𝟏, 𝒐𝒕𝒉𝒆𝒓𝒘𝒊𝒔𝒆
𝟏 , 𝒊𝒇 𝒏 = 𝟏
2. 𝑻(𝒏) = {
𝑻(𝒏 − 𝟏) + 𝒏(𝒏 − 𝟏), 𝒊𝒇 𝒏 ≥ 𝟐
3. 𝑻(𝒏) = 𝑻(𝒏 − 𝟏) 𝒂𝒏𝒅 𝑻(𝟏) = 𝜽(𝟏)
𝟏 CO1 K3
4. 𝑻(𝒏) = 𝑻(𝒏 − 𝟏) + 𝒏
𝒏
𝟐𝑻 (𝟐) + 𝟐 , 𝒊𝒇 𝒏 > 𝟐
5. 𝑻(𝒏) = {
𝒃 , 𝒊𝒇 𝒏 = 𝟐

7. Solve the following recurrences using Recursion Tree Method.

𝒏 𝟐𝒏
1. 𝑻(𝒏) = 𝑻 (𝟐) + 𝑻 ( 𝟑 ) + 𝒏𝟐
𝒏
2. 𝑻(𝒏) = 𝟑𝑻(⌊𝟒⌋ + 𝜽(𝒏𝟐 )
𝒏 𝒏
3. 𝑻(𝒏) = 𝑻 (𝟒) + 𝑻 (𝟐) + 𝒏𝟐 CO1 K3
𝒏 𝒏 𝒏
4. 𝑻(𝒏) = 𝑻 (𝟐) + 𝑻 (𝟒) + 𝑻 (𝟖) + 𝒏
5. 𝑻(𝒏) = 𝑻(𝟏 − 𝜶)𝒏 + 𝑻(𝜶𝒏) + 𝒏 𝒘𝒉𝒆𝒓𝒆 𝜶 >
𝟎 𝒂𝒏𝒅 𝒂 < 𝟏
8. Elaborate the difference between Linear and Non-Linear Data CO1 K2
Structure with their applications.

You might also like