Scribd
Upload
6 views2 pages

Assign - 1 Tut - 1

The document outlines a tutorial sheet for a Data Analysis and Algorithm course, focusing on various concepts such as amortized analysis, divide and conquer algorithms, and recurrence relations. It includes questions divided into three sections, assessing understanding of algorithm complexities and practical applications. The tutorial aims to evaluate students' ability to analyze and solve algorithmic problems using different methods.

Uploaded by

Hitesh Choudhary
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
6 views2 pages

Assign - 1 Tut - 1

The document outlines a tutorial sheet for a Data Analysis and Algorithm course, focusing on various concepts such as amortized analysis, divide and conquer algorithms, and recurrence relations. It includes questions divided into three sections, assessing understanding of algorithm complexities and practical applications. The tutorial aims to evaluate students' ability to analyze and solve algorithmic problems using different methods.

Uploaded by

Hitesh Choudhary
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/ 2

B.Tech.

(Computer Science and Engineering)


Semester-V
Subject: Data Analysis and Algorithm
Subject code BCO023A
Marks: 64

CO2: Finding out the best method for different algorithms

Unit # 1
Tutorial sheet 1
Sec-A
(3x2=06marks)

1) [CO1] -Explain the concept of amortized analysis and how it is used to analyze the time and
space complexity of algorithms with varying costs for individual operations.

2) [CO1] - The minimum number of comparisons required to find the minimum and the
maximum of 100 numbers is :
3) [CO1] - Provide examples of real-world problems or applications where divide and conquer
algorithms are commonly used.
4) [CO1] Define the Divide and Conquer algorithm paradigm in computer science.
5) [CO1] Explain the three main steps involved in a Divide and Conquer algorithm.

Sec-B
/* Note: Each question may have one or two parts */ (3x7=21 marks)

6) [CO1]- Iteration method


T (n) = T (n-1) +1/n
T (n) = T (n/3) +n4/3

7) [CO 1] Solve following recurrence relation using Master’s theorem:


T (n) = 3T (n/4) + n*logn
T (n) = 9T (n/3) +n

8) [CO 1] Solve using recursion tree:


T (n) = 4T (n/2) +n
T (n) = 16T (n/4) + n2
Sec-C
/* Note: Each question may have one, two, or three parts */
[3*11=33 marks]

9) [CO1]Find the maximum and minimum no from given list using D&C approach-
15,89,53,78,45,6,9,36,72,19,66,49

10) [CO1] You are given two algorithms, Algorithm A and Algorithm B. Algorithm A has a time
complexity of O(n2 ), while Algorithm B has a time complexity of O(n log n). If you have to process an input
of size 1000, which algorithm would you choose, and why?

11) [CO1] You are tasked with sorting a list of n integers using the Selection Sort and Insertion Sort
algorithm. As part of the task, you need to perform a step-by-step analysis of the algorithm on a given list of
numbers.
Given the list of integers: [38, 27, 43, 3, 9, 82, 10].

You might also like