Computer Science and Engineering| Indian Institute of Technology Kharagpur

cse.iitkgp.ac.in

Algorithms – I (CS21203)

Autumn 2023, IIT Kharagpur

 Computer Science and Engineering| Indian Institute of Technology Kharagpur
cse.iitkgp.ac.in

Logistics
• Course Name and code: Algorithms - I, CS21203

• Time: Wednesday (10:00-10:55 am), Thursday (09:00-09:55 am), Friday

(11:00am-12:55 pm)

• Venue: NC442 (Roll no.s ending with odd digits), NC443 (Roll no.s
ending with even digits)

• Course website: https://cs21203-iitkgp.github.io/au2023/

• Prerequisites: PDS
Aug 02, 2023 2
CS21203 / Algorithms - I | Introduction
 Computer Science and Engineering| Indian Institute of Technology Kharagpur
cse.iitkgp.ac.in

The Team
TAs
Name Gmail id
Instructors Owais Iqbal [email protected]
Rahul Barman [email protected]
Animesh Singh [email protected]
Aditya Hirwani [email protected]
Pranav Sonare [email protected]
Aftab Hussain [email protected]
Shubhraneel Pal [email protected]
Ayan Chaudhury Suhas Jain [email protected]
Abir Das
Debanjan Saha [email protected]
Monal Prasad [email protected]
Velpuri Venkata S Sriharsha [email protected]

• And YOU!!
Aug 02, 2023 3
CS21203 / Algorithms - I | Introduction
 Computer Science and Engineering| Indian Institute of Technology Kharagpur
cse.iitkgp.ac.in

Course Information

• Books and References:

1. Thomas H Cormen, Charles E Lieserson, Ronald L Rivest and Clifford Stein,
Introduction to Algorithms. (3rd Edition)
2. Jon Kleinberg and Éva Tardos, Algorithm Design, Pearson, 2005.
3. Sanjoy Dasgupta, Christos H. Papadimitriou and Umesh V. Vazirani,
Algorithms, Tata McGraw-Hill, 2008.
4. Jeff Erickson, Algorithms, 2019.
5. Mark Allen Weiss, Data Structures and Algorithm Analysis in C.

• More references specific to the lectures will be added in the course

website as and when needed.

Aug 02, 2023 4

CS21203 / Algorithms - I | Introduction
 Computer Science and Engineering| Indian Institute of Technology Kharagpur
cse.iitkgp.ac.in

Course Information

• Evaluation: ClassTest (20%) – 2; Mid Sem (30%); End Sem (50%). [Tentative]

• ClassTests and Semester Exams:

• They will have a combination of Mathematical, Analytical and short coding based
problems.
• Tentative class test dates: I. 30 Aug II. Oct 18
• Will be taken outside class timings (evening is most likely)

• Practice homeworks will be given in the website. These will not be graded.

Aug 02, 2023 5

CS21203 / Algorithms - I | Introduction
 Computer Science and Engineering| Indian Institute of Technology Kharagpur
cse.iitkgp.ac.in

What are algorithms?

Source: http://redd.it/b5mtc7

Dictionary definition: A procedure for solving a mathematical problem

(as of finding the greatest common divisor) in a finite number of steps
that frequently involves repetition of an operation.

By Donald E Knuth: An algorithm is a finite, definite, effective procedure,

with some input and some output.

By Cormen et al.: An algorithm is a sequence of computational steps that

transform the input into the output.

Aug 02, 2023 CS21203 / Algorithms - I | Introduction 6

 Computer Science and Engineering| Indian Institute of Technology Kharagpur
cse.iitkgp.ac.in

Why is the study of algorithms worthwhile?

• Especially, modern computers are pretty fast and memory cost is low

• (If for no other reason) – show that your algorithm produces the right answer
always

• Different algorithms for the same problem often differ dramatically in terms
of efficiency

• Before showing an example, lets step into the practical world!

Aug 02, 2023 CS21203 / Algorithms - I | Introduction 7

 Computer Science and Engineering| Indian Institute of Technology Kharagpur
cse.iitkgp.ac.in

Why is the study of algorithms worthwhile?

• typical job interview process, e.g., Google’s software developer [Source: Link]

• Round 1: online assessment (~90 Minutes)

• Two data structures and algorithms questions you have to complete
• Write your own test cases and must pass all test cases that you cannot see
• You can use any IDE of your choice
• The recruiter will not review your resume if you do not pass the OA

•Round 2: Technical phone interview

• Solve data structure and algorithm questions
• Write code (usually in txt/cloud doc) and explain the correctness/time complexity
• Additional behavioral questions that are usually not decisive

Aug 02, 2023 CS21203 / Algorithms - I | Introduction 8

 Computer Science and Engineering| Indian Institute of Technology Kharagpur
cse.iitkgp.ac.in

Why is the study of algorithms worthwhile?

• typical job interview process, e.g., Google’s software developer [Source: Link]

• Round 3: Onsite interviews (May not be applicable in India)

• Spend a full day at a Google office and do four to six interviews.
• Topics asked are usually data structure and algorithm and system design
• You are expected to do extremely well in coding interviews

•Of course algorithms are also important for doing research in all CS areas

Aug 02, 2023 CS21203 / Algorithms - I | Introduction 9

 Computer Science and Engineering| Indian Institute of Technology Kharagpur
cse.iitkgp.ac.in

Why is the study of algorithms worthwhile?

• Lets see an example of variation of efficiency

• Suppose you want to sort numbers

• Algorithm 1 takes operations
• Algorithm 2 takes operations
• and are constants and not dependent on

• Let computer execute 10 billion operations/second and computer execute

10 million operations/second

• Let Algorithm 1 is run on computer while Algorithm 2 is run on computer

• Let Algorithm 1 is translated into code really beautifully and Algorithm 2 is

not.
• This results in and
Aug 02, 2023 CS21203 / Algorithms - I | Introduction 10
 Computer Science and Engineering| Indian Institute of Technology Kharagpur
cse.iitkgp.ac.in

Why is the study of algorithms worthwhile?

• To sort million numbers, Computer takes
hrs

• For the same, Computer takes

mins

Aug 02, 2023 CS21203 / Algorithms - I | Introduction 11

 Computer Science and Engineering| Indian Institute of Technology Kharagpur
cse.iitkgp.ac.in

First Algorithm: Insertion Sort

5 2 4 6 1 3 2 4 5 6 1 3
key 1
2 5 2 4 6 1 3 1 2 4 5 6 6 3
2 5 5 4 6 1 3 1 2 4 5 5 6 3
2 2 5 4 6 1 3 1 2 4 4 5 6 3
4 2 5 4 6 1 3 1 2 2 4 5 6 3
4 2 5 5 6 1 3 1 1 2 4 5 6 3
4 2 4 5 6 1 3
3 1 2 4 5 6 3 3 1 2 4 4 5 6
6 2 4 5 6 1 3 3 1 2 4 5 6 6 3 1 2 3 4 5 6
6 2 4 5 6 1 3 3 1 2 4 5 5 6
Aug 02, 2023 CS21203 / Algorithms - I | Introduction 12
 Computer Science and Engineering| Indian Institute of Technology Kharagpur
cse.iitkgp.ac.in

First Pseudocode: Insertion Sort

• Let us write a pseudocode describing this process

• But before that – what is a pseudocode and how is it different from a real
code?
• Pseudocode does not bother much about language specific synatxes
• Whatever helps to express the idea is used
• Is not concerned with issues of software engineering

Aug 02, 2023 CS21203 / Algorithms - I | Introduction 13

 Computer Science and Engineering| Indian Institute of Technology Kharagpur
cse.iitkgp.ac.in

First Pseudocode: Insertion Sort

Aug 02, 2023 CS21203 / Algorithms - I | Introduction 14

Computer Science and Engineering| Indian Institute of Technology Kharagpur
cse.iitkgp.ac.in

Thank You!!