R SUMATHI ALGORITHM AND COMPLEXITY GRAPH TRAVERSAL AND

R. SUMATHI ALGORITHM AND COMPLEXITY GRAPH TRAVERSAL AND ITS APPLICATIONS COMPUTER SCIENCE AND ENGINEERING 2 nd YEAR UG STUDENTS in COMPUTER SCIENCE AND ENGINEERING KALASALINGAM UNIVERSITY IDP in Educational Technology, IIT Bombay 2

Out-of-class Activity Design-1 Learning Objective(s) of Out-of-Class Activity At the end of watching the videos student should be able to Students can able to learn the basics of BFS and DFS traversal Students can able to find the path of any given graph using graph traversal Students can able to compare the concepts of DFS and BFS with example § § § Key Concept(s) to be covered Breadth First Search Depth First Search Comparison of BFS and DFS IDP in Educational Technology, IIT Bombay 3

Out-of-class Activity Design - 2 Video Source URL V 1: https: //www. youtube. com/watch? v=QRq 6 p 9 s 8 NVg&t=5 s V 2: https: //www. youtube. com/watch? v=ia. BEKo 5 s. M 7 w&t=129 s V 3: https: //www. youtube. com/watch? v=8 C_e. BEQPZb. Y License of Video CC (reuse allowed) Mapping Concept to Video Source CONCEPT Breadth First Search Depth First Search Comparison of BFS and DFS TOTAL DURATION VIDEO SEGMENT DURATION (in min) V 1 : 00 – 04: 33 4. 33 V 2: 00 – 03. 47 V 3: 00. 00 -02. 54 10. 34 min IDP in Educational Technology, IIT Bombay 4

Out-of-class Activity Design - 3 Aligning Assessment with Learning Objective Assessment Strategy Expected Duration (in min) Additional Instructions (if any) 3 minutes Watch V 1 and V 2 then answer Q 1 Basics of BFS Q 1: List out the data structures and DFS followed in BFS and DFS IDP in Educational Technology, IIT Bombay 5

Out-of-class Activity Design - 3 Aligning Assessment with Learning Objective Finding the path using Graph Traversal Assessment Strategy Q 2. Solve the Following graph using DFS ( starting vertex 1) Q 3. Find the path for the following graph using BFS (Starting vertex 7) IDP in Educational Technology, IIT Bombay Expected Duration (in min) Additional Instructions (if any) 12 minutes Watch V 1 and V 2 and then answer Q 2 and Q 3 6

Out-of-class Activity Design - 3 Aligning Assessment with Learning Objective Compare the BFS and DFS Assessment Strategy Q 4. compare and prove the time complexity for BFS and DFS traversal for the following graph Total activity duration Expected Duration (in min) Additional Instructions (if any) 10 minutes Watch V 3 and Submit answers to question Q 4 before coming to the class. 10 marks will be awarded for correct answer 25 minutes IDP in Educational Technology, IIT Bombay 7

In-class Activity Design -1 Learning Objective(s) of In-Class Activity At the end of the class, ▪ ▪ Students will be able to solve the Graph Traversal Algorithm (Analyze Level) Compare BFS and DFS strategy for the same problem in terms of time complexity (Analyze Level) Key Concept(s) to be covered BFS and DFS procedure for Problem Solving. ▪ Comparison of basics of BFS and DFS algorithm ▪ IDP in Educational Technology, IIT Bombay 8

In-class Activity Design • Active Learning activity that you plan to do • Applying the Tree traversal techniques to find the path from starting vertex to all other vertices in the graph with real time example of map colouring. § Think-Pair-Share • Concept clarification using -Peer Instruction IDP in Educational Technology, IIT Bombay 9

In-class Activity Design -2 Peer Instruction Strategy – What Teacher Does Given the world color map which contains different colors indicating land, water etc. From the map students have to color all vegetation land mention in green color starting from A – H for the given graph. Think (~2 minutes) Q 1: Find the Breadth First Search and Depth first search for the following graph (A*) A B C D E F G H IDP in Educational Technology, IIT Bombay 10

In-class Activity Design -2 Peer Instruction strategy : What the teacher does Q 2: Check the path of BFS and DFS for the given Graph(A*)? Pair (~ 5 minutes ) A-E-F-G-H-B-C-D A-B-C-D-H-B-F-E A-B-E-C-F-D-G-H A-E-B-C-F-D-G-H & & A-E-F-G-H-B-C-D A-B-C-D-H-G-F-E A-B-E-C-F-D-G-H 5 marks will be awarded for the correct answer for both BFS and DFS traversal IDP in Educational Technology, IIT Bombay 11

Peer Instruction Strategy – What Student Does Pair (~5 minutes) Students finds the adjacent list a for all vertices in the graph, for each questions they have to answer individually. Use the BFS and DFS algorithm , they find the path of both BFS and DFS and they discuss the answers among the peers and come to consensus 5 marks will be provided for the correct answer They will wait for correct answers from the instructors IDP in Educational Technology, IIT Bombay 12

TPS Strategy – What Instructor does Share (~8 minutes) Instructor asks a group to share their answers in the class and check whethere are having the same or different answers. Based on the Feedback of the correct solution and check the answer using stack and queue techniques and announce the correct path of the given real time application At the end of the Class IDP in Educational Technology, IIT Bombay 13

Justify why the above is an active learning strategy Students have to listen the videos carefully and solve the given problem students are required to think the concepts clearly and compare the both concepts using the steps mentioned for finding the path They also request to submit the feedback in person inside the class or submit their comments in moodle website IDP in Educational Technology, IIT Bombay 14