L1_Welcome Lecture.pptx for introduction

Lecture 1
Design and Analysis of
Algorithms (CSET244)

Course
Structure
3 Hours Lectures
1 Hour Tutorial
4 Hours Practical

Evaluation Policy
Components of Course Evaluation Marks
Mid Semester Examination 20
End Semester Examination 40
Lab (Continuous Evaluation) * 20
Hackathon 5
Competitive programming (Leatcode)** 10
Certification*** 5
Total 100

Data Structures Programming
Foundation of the course (Prerequisite)

References
S.no Book Title Authors Press
1. Introduction to
Algorithms
Thomas H. Cormen,
Charles E. Leiserson,
Ronald L. Rivest, Clifford
Stein
MIT Press
2. Algorithm Design Jon Kleinberg & Eva
Tardos
Pearson
3. Computer Algorithms Ellis Horowitz, Sartaj
Sahni, Sanguthevar
Rajasekaran
Computer
Science Press
Books:

References
Google
Geekforgeeks for
practising questions
and assignments.
Class Lectures
Other Resources:

Lab Assignments
Programming language to follow: C++

Broad list of topics to be covered in the course
Basic of algorithms. Sorting algorithms.
Divide and
Conquer paradigm.
Greedy algorithms.
Dynamic
programming.
Graph algorithms.
Computational
classes.

Introduction to algorithm
Definition :
 It is a combination of sequence of finite steps to
solve a problem.
Properties :
 It should take zero or more input.
 It should produce at least one output.
 It should terminate after finite time.
 Every state in the algorithm should be
deterministic.
 It should be programming language
independent.

Steps Required to Construct Algorithm
Problem Definition
Design the Algorithm
Flow Chart
Verification (Testing)
Implementation (Coding)
Analysis

Analysis
Using time complexity and space Complexity we can analyze the
algorithm.
Time Complexity:
T(A) = C(A) + R(A)

Types of Analysis
Posteriori Analysis (Relative Analysis) Priori Analysis (Absolute Analysis)
1. It is programming language of compiler
and type of processor dependent analysis
1. It is programming language of compiler
and type of processor independent analysis
2. Answer will change system to system 2. Answer will not change system to system
3. Exact answer 3. Approximate Analysis

Priori Analysis (Absolute Analysis)
“It is determination of order of magnitude of a statement.”
Example 1:
main()
{
x=y+z;
}

Example 2:
main()
{
x=y+z;
for (i=1; i<=n; i++)
{
x=y+z;
}
}

Example 3:
main()
{
x=y+z;
for (i=1; i<=n; i++)
x=y+z;
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
{
x=y+z;
}
}
}

Example 4:
main()
{
for (i=1; i<=n; i++)
{
for (j=1; j<=n/2; j++)
{
x=y+z;
}
}
}

Example 5:
main()
{
for (i =1; i<=n; i++)
{
for (j=1; j<=i; j++)
{
for (k=1; k<=133; k++)
{
x=y+z;
}
}
}
}

Example 6:
main()
{
while(n>=1)
{
n=n/2;
}

Example 7:
main()
{
i=1;
while(i<=n)
{
i=2*i;
}
}

L1_Welcome Lecture.pptx for introduction

More Related Content

Similar to L1_Welcome Lecture.pptx for introduction (20)

Recently uploaded (20)

L1_Welcome Lecture.pptx for introduction