Course: CSE221: Algorithm Theory and Lab

Welcome Note

Assalamu 'Alaikum.

I am Fatema Tuj Johora, welcoming you to Algorithms Course.

I hope we will learn together to enrich ourselves and together we can make this journey memorable.
May the Almighty grant you peace and happiness always.

Select activity Announcements

Announcements Forum
Select activity Label

	Instructor : Fatema Tuj Johora (FTJ) Office Room #316 (2nd floor) - AB4 Office Hour : 8:30 am to 4:00pm Contact Number: 01315689508 Email: fatema.cse@diu.edu.bd

Course Rationale

Algorithms deals with efficient ways to solve different mathematical and real-life problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve computational problems. This course emphasizes the relationship between algorithms and programming and explores algorithms from the programmer’s perspective for solving problems efficiently using various programming languages.

Course Objective

This course introduces students to the analysis and design of computer algorithms. Upon completion of this course, students will be able to do the following:

• Analyse the asymptotic performance of algorithms.

• Demonstrate familiarity with major algorithms and data structures.

• Apply important algorithmic design paradigms and methods of analysis.

• Synthesize efficient algorithms in common engineering design situations.

Course Outcomes (CO’s)

CO1

Analyze and calculate time complexity and space complexity of various algorithms or any written code using mathematical formula and comparison of algorithms.

CO2

Generate and interpret the output of iterative and recursive codes with the analysis of the problem definition.

CO3

Identify which algorithm listed under which algorithmic paradigm. Compare among various algorithms/implemented codes and choose the efficient one.

CO4

Break down and describe the simulation of various algorithms for different input values.

CO5

Design and apply appropriate algorithms to solve real-life problems.

Grading Scheme


Theory Class	Lab Class
Attendance: 7% Class Tests/Quizzes: 15% Assignment: 5% Presentation (using video/ppt): 8% Midterm Exam: 25% Final Exam: 40%	Lab Attendance: 10% Lab Performance Test: 25% Assignment + Viva: 10% Project: 25% Lab Final: 30%

Select activity Simulator ...

Simulator

Let Make Some Fun with Algorithm before starting with the visualization
Select activity Text Book:a.    Introduction to Alg...
Text Book:
a. Introduction to Algorithms ,
Click here for Course Outline
Reference Books :
a. Algorithms (4th Edition)
Author: Robert Sedgewick and Kevin Wayne
b. Algorithm Design
Author: Jon Kleinberg, Eva Tardos
c. Data Structures And Algorithms Made Easy In JAVA
Author: Narasimha Karumanchi
*** Useful Web Links:
www.visualgo.net
www.geeksforgeeks.org
www.topcoder.com
www.codeforces.com

**** Additional Support for Students
Student Portal: http://studentportal.diu.edu.bd/
Academic Guidelines https://daffodilvarsity.edu.bd/article/academic-guidelines
Rules and Regulations of DIU https://daffodilvarsity.edu.bd/article/rules-and-regulation
Career Development Center: https://cdc.daffodilvarsity.edu.bd/
For general queries: http://daffodilvarsity.edu.bd/
Select activity NOTICE BOARDQUIZ FOR PC-C: TOPICS: GRAPH

Students must

Mark as done

NOTICE BOARD
QUIZ FOR PC-C:
TOPICS: GRAPH

FORUMS

Select activity Evaluation

Evaluation Assignment

Opened: Sunday, 29 October 2023, 3:10 PM

Due: Wednesday, 29 November 2023, 5:30 PM

Students must

Mark as done
Select activity FORUM 1

FORUM 1

Due: Friday, 24 February 2023, 8:01 AM

Students must

Mark as done
Select activity FORUM 2

FORUM 2

Due: Friday, 24 February 2023, 8:03 AM

Students must

Mark as done
Select activity FO0RUM 3

FO0RUM 3 Forum

Due: Friday, 3 March 2023, 8:04 AM

Students must

Mark as done
Select activity FORUM 4

FORUM 4

Due: Saturday, 4 March 2023, 8:06 AM

Students must

Mark as done

Lab Report

Highlighted

Select activity Lab Report till Final Exam (PC-B)

Lab Report till Final Exam (PC-B) Assignment

Opened: Thursday, 18 May 2023, 12:00 AM

Due: Thursday, 1 June 2023, 12:00 AM

Students must

Mark as done
Select activity Lab Report till Final Exam (PC-C)

Lab Report till Final Exam (PC-C) Assignment

Opened: Thursday, 18 May 2023, 12:00 AM

Due: Thursday, 1 June 2023, 12:00 AM

Students must

Mark as done
Select activity Lab Report till Final Exam (PC-D)

Lab Report till Final Exam (PC-D) Assignment

Opened: Thursday, 18 May 2023, 12:00 AM

Due: Thursday, 1 June 2023, 12:00 AM

Students must

Mark as done
Select activity ASSIGNMENT (PC-B)

ASSIGNMENT (PC-B)

Opened: Thursday, 18 May 2023, 12:00 AM

Due: Thursday, 1 June 2023, 12:00 AM

Students must

Mark as done

Check BLC week and there are several task in week based on the topics of Algorithm theory. Solve at least one problem from each type of problem
Select activity ASSIGNMENT (PC-C)

ASSIGNMENT (PC-C)

Opened: Thursday, 18 May 2023, 12:00 AM

Due: Thursday, 1 June 2023, 12:00 AM

Students must

Mark as done

Check BLC week and there are several task in week based on the topics of Algorithm theory. Solve at least one problem from each type of problem
Select activity ASSIGNMENT (PC-D)

ASSIGNMENT (PC-D)

Opened: Thursday, 18 May 2023, 12:00 AM

Due: Thursday, 1 June 2023, 12:00 AM

Students must

Mark as done

Check BLC week and there are several task in week based on the topics of Algorithm theory. Solve at least one problem from each type of problem

LAB REPORT

SURVEY

Select activity LAB REPORT (up to Mid Term Exam)

LAB REPORT (up to Mid Term Exam) Assignment

Due: Thursday, 9 March 2023, 9:54 AM

Students must

Mark as done
Select activity Evaluation ( PC-B)

Evaluation ( PC-B) Assignment

Opened: Thursday, 2 March 2023, 12:00 AM

Students must

Mark as done
Select activity Merge sort (PC-B)

Merge sort (PC-B) Assignment

Opened: Thursday, 9 March 2023, 12:00 AM

Due: Thursday, 9 March 2023, 12:00 AM

Students must

Mark as done
Select activity Problem on coin change and Fractional Knapsack (PC-C)

Problem on coin change and Fractional Knapsack (PC-C) Assignment

Opened: Wednesday, 5 April 2023, 10:25 AM

Due: Tuesday, 9 May 2023, 5:00 PM

Students must

Mark as done
Select activity DP-Coin change (PC-B)

DP-Coin change (PC-B) Assignment

Opened: Thursday, 11 May 2023, 10:30 AM

Due: Thursday, 11 May 2023, 11:00 AM

Students must

Mark as done
Select activity LCS-(PC-D)

LCS-(PC-D) Assignment

Opened: Wednesday, 17 May 2023, 12:00 AM

Due: Wednesday, 17 May 2023, 1:00 PM

Students must

Mark as done

Week-01 Preparing Background

Select activity Label

Topics of discussion


Introduction and importance of Algorithm and its application
Function and Recursion, 
Euclid’s Greatest Common Divisor(GCD) Algorithm

Expected Learning Outcome

Gain knowledge about the importance of algorithm
Perform exercise on function and recursion function

Week-01 Plan
Week plan	Topics	Materials
Week-01: Lecture-01	Introduction to Algorithms	Video Lecture Lecture Slide
Week-01: Lecture-02	Computational complexity and Asymptotic Notation of Algorithms	Video Lecture: Part-1/2 Video Lecture: Part -2/2 PowerPoint Slide
Week-01: Lab - 01	Problems with C Basics, Loops, Array, F unction, Recursion	Instruction for Lab Task - 01 Lab Task - 01

Week-02: Notation and Complexity Analysis

Select activity Label

Topics of discussion


Introduction with the Asymptotic Notation 
Discussion on the Complexity of Algorithms
Importance of Complexity for designing an Algorithm

Expected Learning Outcome


Gain knowledge about the importance of algorithm
Find out the Asymptotic Notation from an Algorithm
Find out the complexity from any code or algorithm

Week-02 Plan
Week plan	Topics	Materials
Week-02: Lecture-03	Asymptotic Notation and Complexity Analysis	Video Lecture_Part:1/3 Video Lecture_Part:2/3 Video Lecture_Part:3/3 Lecture Slide link
Week-02: Lecture-04	Searching Algorithms: Linear Search and Binary Search	Video Lecture_Part:1/3 Video Lecture_Part:2/3 Video Lecture_Part:3/3 Lecture Slide link
Week-02: Lab - 02	Problems with Array, Function, Binary Search	Video Instruction on Lab Task -2 Lab Task -2 Video Lecture On Function_Part-1/3 Video Lecture On Function_Part-2/3 Video Lecture On Function_Part-3/3 Slide of Function Home Task on Array_Function

Week-03 Searching and Sorting Algorithm Based on Brute Force Approach

Select activity ...

Topics of discussion

Introduction to brute force techniques.
Introduction to the searching Algorithm.
Introduction to the sorting Algorithm
Quiz #01

Expected Learning Outcome


Knowledge about the Linear Search algorithm and its complexity
Knowledge about the Insertion sort algorithm and its complexity
Knowledge about the Bubble sort algorithm and its complexity
 Knowledge about the Selection sort algorithm and its complexity
 Exercise the Sorting and searching Algorithm with some additional problems.

Week-03 Plan
Week plan	Topics	Materials
Week-03: Lecture-05	Introduction to Sorting Algorithms: 1. Selection Sort and 2. Insertion Sort	Video Lecture: Part - 1/2 Video Lecture: Part - 2/2 Lecture Slide
Week-03: Lecture-06	Divide and Conquer Approach: Merge Sort	Video Lecture: Part-1/3 Video Lecture: Part - 2/3 Video Lecture: Part - 3/3 Power point Lecture Slide ======================= Click for Derails Explanation Video Lecture: How Merge Sort Works - 1/3 Video Lecture: How Merge Sort Works - 2/3 Video Lecture: How Merge Sort Works - 3/3
Week-03: Lab - 03	Sorting Algorithms: Selection Sort and Insertion Sort	Lab Task - 3 Home Work of Lab Task -3

Assignment (PC-C)

Select activity Assignment on Quick Sort and Insertion Sort

Assignment on Quick Sort and Insertion Sort

Opened: Sunday, 12 February 2023, 2:30 PM

Due: Sunday, 12 February 2023, 3:00 PM

Students must

Mark as done

Week-04 Searching and Sorting Algorithm Based on Divide and Conquer Approach

Select activity Label

Topics of discussion


Introduction to Divide and Conquer Approach.
Introduction to the searching Algorithm based on Divide and Conquer Approach. 
Introduction to the Sorting Algorithm based on Divide and Conquer Approach.

Expected Learning Outcome

Knowledge about the Binary Search algorithm and its complexity
Knowledge about the Merge sort algorithm and its complexity
Knowledge about the Quick sort algorithm and its complexity
Exercise the Sorting and searching Algorithm with some additional problems.

Week-04 Plan
Week plan	Topics	Materials
Week-04: Lecture-07	Discussion on Divide and Conquer Approach: Merge Sort
Week-04: Lecture-08	Divide and Conquer Approach: Quick Sort	Video Lecture QuickSort: Part-1/3 Video Lecture QuickSort: Part-2/3 Video Lecture QuickSort: Part-3/3 Lecture Slide on Quick Sort
Week-04: Lab - 04	Section: O-2: Lab Performance Test : 1	Section: O-2 Lab Performance Test : 1

Week-05 Introduction to Greedy Approach

Select activity Label

Topics of discussion

Introduction to Greedy Approach
Discussion on Coin Change Problem
Discussion on Bin packing Problem
Discussion on Knapsack Problem
Discussion on Hoffman coding
Assignment-01

Expected Learning Outcome

Solve the Coin Change Problem based on Greedy Method
Solve the Knapsack Problem based on Greedy Method
Solve the Hoffman coding based on Greedy Method
 Solve the  Bin packing Problem based on Greedy Method
 Exercise the Sorting Algorithm with some additional problems in the Lab.

Week-05 Plan
Week plan	Topics	Materials
Week-05: Lecture-09	Greedy Method: Coin Change Bin-Packing Problem	Video Lecture : Part-1/2 Video Lecture: Part-2/2 Lecture Slide
Week-05: Lecture-10 Date:	Greedy Partial Knapsack Greedy Huffman Coding	Video Lecture (Knapsack problem) Video Lecture (Huffman Coding) Lecture Slide
Week-05: Lab - 05	** Section: O2 Implementation of Merge Sort Quick Sort	*** Section: O-2 Video Instruction on Lab Task - 4 Lab Task - 4

Select activity Lab - 05

Students must

Mark as done

Lab - 05

Week-06: Introduction to Dynamic Programming

Select activity Label

Topics of discussion


Introduction to Dynamic Programming (DP)
Discussion on Fibonacci Numbers Problem
Discussion on Coin Change Problem (DP)
Discussion on Knapsack Problem (0/1)

Expected Learning Outcome

Solve the Coin Change Problem based on DP
Solve the Knapsack Problem based on DP
Solve the Fibonacci Numbers Problem based on DP
Exercise the Bin-packing Algorithm with some additional problems in the Lab.

Week-06 Plan
Week plan	Topics	Materials
Week-06: Lecture-11	Dynamic Programming: 1. Fibonacci Numbers Problem 2. DP: Coin Change	DP Introduction and Fibonacci Series Video Lecture DP: Coin Change Video Lecture: Part-1/2 Video Lecture: Part-2/2 Lecture Slide-1: DP Introduction and Fibonacci Series Lecture Slide-2: DP Coin Change
Week-06: Lecture-12	DP: 0/1 Knapsack	Lecture Video Part: 1/2 Lecture Video Part: 2/2 Slide on 0/1 Knapsack
Week-06: Lab - 0 6	Implementation of Greedy Approaches Coin Change Bin Packing Fractional Knapsack	Section :O-2 Video Instruction on Lab Task - 5 Lab Task - 5

Select activity Lab Task 

Students must

Mark as done

Lab Task

Week-07 Mid-Term Examination

Week-08: Introduction to Dynamic Programming (Continue)

Select activity l

l

Topics of discussion


Introduction to Dynamic Programming (DP)
Discussion on longest Common Subsequence and Edit Distance Problem
Discussion on longest Increasing Subsequence (DP)

Expected Learning Outcome


Solve the Longest Common Subsequence (LCS) Problem based on DP
Solve the Longest Increasing Subsequence (LIS)
Exercise the Bin-packing, LCS, LIS Algorithm with some additional problems in the Lab.

Week-08 Plan
Week plan	Topics	Materials
Week-08: Lecture-01	Longest Increasing Subsequence(LIS)	LIS Video Lecture: Part-1/2 Video Lecture: Part-2/2 Lecture Slide: LIS
Week-08: Lecture-02	Longest Common Subsequence (LCS)	LCS Video Lecture: Part-1/2 Video Lecture: Part-1/2 Lecture Slide
Week-08: Lab - 07	Implementation of LCS, LIS	Lab Task - 7

Select activity Lab - 08

Students must

Mark as done

Lab - 08
Select activity Discussion on Week-08

Discussion on Week-08 Forum

Discuss on Week-08 content if you have any problem and confusion.

Week-09: Introduction to Graph And Graph Traversal

Select activity Label

Topics of discussion


Introduction to Graph
Graph Representation
Discussion on Graph Traversal

Expected Learning Outcome


Solve the Breadth-First Search (BFS) algorithm
Solve the Depth First Search (DFS) Algorithm

Week-09 Plan
Week plan	Topics	Materials
Week-09: Lecture-01	Graph and Graph Representation	Lecture Video_ Part:1/3 Lecture Video_ Part:2/3 Lecture Video_ Part:3/3 Lecture Slide: Graph Exercise of Graph
Week-09: Lecture-02	BFS, DFS and Application of DFS	Lecture Video_ Part:1/4 Lecture Video_ Part:2/4 Lecture Video_ Part:3/4 Lecture Video_ Part:4/4 Lecture Slide: BFS+DFS
Week-09: Lab - 08	Implementation of Graph, DFS	Lab Task on Graph

Select activity Live discussionGraph Introduction (Sec I)BFS...

Students must

Mark as done

Live discussion
Graph Introduction (Sec I)
BFS (Sec I)
DFS Sec I
Topological Sort Sec I
MST and Prims Sec I
Kruskal Sec I
Dijkstra Sec I
Graph Introduction (Sec H)
BFS (Sec H)
DFS (Sec H)
DFS Part 2 Sec H
MST and Prims Sec H
Kruskal Sec H
Dijkstra Sec H
Graph Introduction (Sec G)
BFS Sec G
DFS Sec G
Topological Sort Sec G
MST and Prims Sec G
Prims Part 2 Sec G
Dijkstra Sec G
Select activity Lab - 08 (copy)

Students must

Mark as done

Lab - 08

Week-10: Graph Application

Select activity Label

Topics of discussion


DFS Application
Quiz #03

Expected Learning Outcome


Full Tree Traversal
Cycle Finding
Component FInding
Topological Sort (TS)
Strongly Connected Component (SCC)

Week-10 Plan
Week plan	Topics	Materials
Week-10: Lecture-01 Video on Lecture PPT on Lecture	Full Tree Traversal Cycle Finding Component Finding	Video Link PPT link
Week-10: Lecture-02 Video on Lecture PPT on Lecture	Ts, SCC	Video Link PPT link
Week-10: Lab - 09 Video on Lab Manual on Lab	DFS, MST Lab performance-02	Video Link Manual Link

Week-11: Graph: Single Source Shortest Path Algorithm

Select activity Label

Topics of discussion

Discussion on Minimum Spanning Tree (MST)
Discussion on Single Source Shortest Path

Expected Learning Outcome

Solve MST using Kruskal’s Algorithm
Solve MST using Prim’s Algorithm
Single-Source Shortest Path(SSSP) by Dijkstra’s Algorithm

Week-11 Plan
Week plan	Topics	Materials
Week-11: Lecture-01	MST: Kruskal’s Algorithm MST: Prim’s Algorithm	Lecture Video: Kruskal's Lecture Video: Prim's Lecture Video:Prim's_Part-2 Slide
Week-11: Lecture-02	SSSP: Dijkstra’s Algorithm	Lecture Video:Dijkstra Slide

Select activity Discussion on Week-11

Discussion on Week-11 Forum

Discuss on Week-11 content if you have any problem and confusion.
Select activity Graph

Graph File

Students must

Mark as done
Select activity BFS

BFS File

Students must

Mark as done
Select activity DFS

DFS File

Students must

Mark as done
Select activity TS

TS File

Students must

Mark as done
Select activity SCC

SCC File

Students must

Mark as done
Select activity Kruskal

Kruskal File

Students must

Mark as done
Select activity Prims

Prims File

Students must

Mark as done
Select activity Dijkstra

Dijkstra File

Students must

Mark as done
Select activity Exercise

Exercise File

Students must

Mark as done

Week-12: Graph: All Pair Shortest Path Algorithm

Select activity Label

CO1	Analyze and calculate time complexity and space complexity of various algorithms or any written code using mathematical formula and comparison of algorithms.
CO2	Generate and interpret the output of iterative and recursive codes with the analysis of the problem definition.
CO3	Identify which algorithm listed under which algorithmic paradigm. Compare among various algorithms/implemented codes and choose the efficient one.
CO4	Break down and describe the simulation of various algorithms for different input values.
CO5	Design and apply appropriate algorithms to solve real-life problems.

Welcome Note

Announcements

FORUMS

Evaluation

FORUM 1

FORUM 2

FO0RUM 3

FORUM 4

Lab Report

Lab Report till Final Exam (PC-B)

Lab Report till Final Exam (PC-C)

Lab Report till Final Exam (PC-D)

ASSIGNMENT (PC-B)

ASSIGNMENT (PC-C)

ASSIGNMENT (PC-D)

LAB REPORT

SURVEY

LAB REPORT (up to Mid Term Exam)

Evaluation ( PC-B)

Merge sort (PC-B)

Problem on coin change and Fractional Knapsack (PC-C)

DP-Coin change (PC-B)

LCS-(PC-D)

Week-01 Preparing Background

Week-02: Notation and Complexity Analysis

Week-03 Searching and Sorting Algorithm Based on Brute Force Approach

Assignment (PC-C)

Assignment on Quick Sort and Insertion Sort

Week-04 Searching and Sorting Algorithm Based on Divide and Conquer Approach

Week-05 Introduction to Greedy Approach

Week-06: Introduction to Dynamic Programming

Week-07 Mid-Term Examination

Week-08: Introduction to Dynamic Programming (Continue)

Discussion on Week-08

Week-09: Introduction to Graph And Graph Traversal

Week-10: Graph Application

Week-11: Graph: Single Source Shortest Path Algorithm

Discussion on Week-11

Graph

BFS

DFS

TS

SCC

Kruskal

Prims

Dijkstra

Exercise

Week-12: Graph: All Pair Shortest Path Algorithm

Week-13: Final Presentation and Lab Final

Week-14: Final Examination

Section outline

Assalamu 'Alaikum.

I am Fatema Tuj Johora, welcoming you to Algorithms Course.

I hope we will learn together to enrich ourselves and together we can make this journey memorable. May the Almighty grant you peace and happiness always.

Instructor : Fatema Tuj Johora (FTJ)

Course Rationale

Course Objective

This course introduces students to the analysis and design of computer algorithms. Upon completion of this course, students will be able to do the following:

• Analyse the asymptotic performance of algorithms.

• Demonstrate familiarity with major algorithms and data structures.

• Apply important algorithmic design paradigms and methods of analysis.

• Synthesize efficient algorithms in common engineering design situations.

Course Outcomes (CO’s)

Grading Scheme

Theory Class

Lab Class

Attendance: 7%Class Tests/Quizzes: 15% Assignment: 5%Presentation (using video/ppt): 8%Midterm Exam: 25%Final Exam: 40%

Lab Attendance: 10%Lab Performance Test: 25%Assignment + Viva: 10%Project: 25%Lab Final: 30%

Simulator

a. Introduction to Algorithms ,

Click here for Course Outline

Reference Books :

a. Algorithms (4th Edition) Author: Robert Sedgewick and Kevin Wayne

b. Algorithm Design Author: Jon Kleinberg, Eva Tardos

c. Data Structures And Algorithms Made Easy In JAVA Author: Narasimha Karumanchi

*** Useful Web Links:

**** Additional Support for Students

Student Portal: http://studentportal.diu.edu.bd/

Academic Guidelines https://daffodilvarsity.edu.bd/article/academic-guidelines

Academic Guidelines https://daffodilvarsity.edu.bd/article/academic-guidelines

I hope we will learn together to enrich ourselves and together we can make this journey memorable.
May the Almighty grant you peace and happiness always.

Attendance: 7%
Class Tests/Quizzes: 15%
Assignment: 5%
Presentation (using video/ppt): 8%
Midterm Exam: 25%
Final Exam: 40%

Lab Attendance: 10%
Lab Performance Test: 25%
Assignment + Viva: 10%
Project: 25%
Lab Final: 30%

a. Algorithms (4th Edition)
Author: Robert Sedgewick and Kevin Wayne

b. Algorithm Design
Author: Jon Kleinberg, Eva Tardos

c. Data Structures And Algorithms Made Easy In JAVA
Author: Narasimha Karumanchi

Introduction and importance of Algorithm and its application
Function and Recursion,
Euclid’s Greatest Common Divisor(GCD) Algorithm

Gain knowledge about the importance of algorithm
Perform exercise on function and recursion function

Introduction with the Asymptotic Notation
Discussion on the Complexity of Algorithms
Importance of Complexity for designing an Algorithm

Gain knowledge about the importance of algorithm
Find out the Asymptotic Notation from an Algorithm
Find out the complexity from any code or algorithm

Introduction to brute force techniques.
Introduction to the searching Algorithm.
Introduction to the sorting Algorithm
Quiz #01