Section: Week-09: Introduction to Graph And Graph Traversal | CSE221: Algorithm Theory and Lab

Section outline

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

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

Topics of discussion

Introduction to GraphGraph RepresentationDiscussion on Graph Traversal

Expected Learning Outcome

Expected Learning Outcome

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

Week plan

Topics

Materials

Week-09: Lecture-01

Graph and Graph Representation

Week-09: Lecture-02

BFS, DFS and Application of DFS

Week-09: Lab - 08

Implementation of Graph, DFS

Implementation of Graph, DFS

Implementation of Graph, DFS

Live discussion

Lab - 08

Introduction to Graph
Graph Representation
Discussion on Graph Traversal

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