FLIPPED CLASSROOM ACTIVITY Resource Creation Assignment 02 RCA

  • Slides: 23
Download presentation
FLIPPED CLASSROOM ACTIVITY Resource Creation Assignment- 02 (RCA 02) Submitted By J. VIJILA Assistant

FLIPPED CLASSROOM ACTIVITY Resource Creation Assignment- 02 (RCA 02) Submitted By J. VIJILA Assistant Professor / Computer Science and Engineering University College of Engineering, Nagercoil (Anna University Constituent College)

Table of Contents SECTION SLIDE # ABOUT J. Vijila 3 OUT-OF-CLASS SEGMENT 5 IN-CLASS

Table of Contents SECTION SLIDE # ABOUT J. Vijila 3 OUT-OF-CLASS SEGMENT 5 IN-CLASS SEGMENT 11 EVALUATION 13 CORRECT SOLUTION 22 2

About Vijila & Course Content Vijila is working as an Assistant Professor in the

About Vijila & Course Content Vijila is working as an Assistant Professor in the department of Computer Science and Engineering. She is interested in handling programming papers. Currently she is pursuing Ph. D in the area of wireless communication. COURSE OVERVIEW Data Structure is a way of collecting and organizing data in order to perform operations on these data in an effective way. Different kinds of data structure are suitable for different kinds of application. Minimum Spanning Tree (MST) is a subset of the edges of a connected weighted undirected graph to connect all the vertices together with minimum cost PHILOSOPHY AND GOAL • Leads students toward a clear understanding of MST and its types with examples • Encourages creative thinking and improving the understanding of MST OBJECTIVES • To understand the basics of MST • To implement the concept of Prims and Kruskal algorithm in real time. 3

J. Vijila Minimum Spanning Tree Data Structures Computer Science II Yr UG Students in

J. Vijila Minimum Spanning Tree Data Structures Computer Science II Yr UG Students in Information Technology UNIVERSITY COLLEGE OF ENGINEERING, NAGERCOIL 4

Out-of-class Activity -1 Learning Objective(s) of Out-of-Class Activity At the end of watching the

Out-of-class Activity -1 Learning Objective(s) of Out-of-Class Activity At the end of watching the videos student should be able to 1. 2. 3. 4. Understand the necessity of Minimum Spanning Tree Properties of MST Basic concept of Prims and Kruskal algorithm Applications of Prims and Kruskal algorithm Key Concept(s) to be covered 1. Basics of MST and Properties of MST 2. Concept of Prims and Kruskal algorithm 3. Applications of Prims and Kruskal algorithm 5

Out-of-class Activity Design - 2 Main Video Source URL https: //youtu. be/jey 8 LEREk.

Out-of-class Activity Design - 2 Main Video Source URL https: //youtu. be/jey 8 LEREk. Kc https: //youtu. be/Pn 874 k. Ec 3 IA https: //youtu. be/5 Xk. K 88 VEILk https: //youtu. be/0 t. Bz. HYo. Tfi. Y Standard You. Tube License of Video Mapping Concept to Video Source CONCEPT VIDEO SEGMENT DURATION (in min) Basics of MST and Properties V 1 – 0. 00 – 7: 36 7. 36 Prims algorithm V 1 – 0. 00 – 7: 01 7. 01 Kruskal algorithm V 2 - 0: 00 – 4: 47 4. 47 Applications of MST V 3 – 0: 00 – 5: 34 TOTAL DURATION 24: 18 min 6

Out-of-class Activity Design - 3 Aligning Assessment with Learning Objective Explain the basics of

Out-of-class Activity Design - 3 Aligning Assessment with Learning Objective Explain the basics of MST Assessment Strategy Q 1. what is MST? Q 2. Explain the various properties of MST? Expected duration (in min) Additional Instructions (if any) Watch V 1 and then answer 7: 36 minutes Q 1 and Q 2 7

Out-of-class Activity Design - 3 Aligning Assessment with Learning Objective Assessment Strategy Expected duration

Out-of-class Activity Design - 3 Aligning Assessment with Learning Objective Assessment Strategy Expected duration (in min) Additional Instructions (if any) Watch V 2 and Explain Prims algorithm Q 1. Explain the concept of Prims algorithm? then answer 7: 01 minutes Q 1 8

Out-of-class Activity Design - 3 Aligning Assessment with Learning Objective Assessment Strategy Expected duration

Out-of-class Activity Design - 3 Aligning Assessment with Learning Objective Assessment Strategy Expected duration (in min) Additional Instructions (if any) Watch V 3 and Explain the Q 1. Explain the process of Kruskal Algorithm. Kruskal algorithm then answer 4: 47 minutes Q 1 9

Out-of-class Activity Design - 3 Aligning Assessment with Learning Objective Assessment Strategy Expected duration

Out-of-class Activity Design - 3 Aligning Assessment with Learning Objective Assessment Strategy Expected duration (in min) Additional Instructions (if any) Watch V 4 Explain the Q 1. Discuss the various applications of Prims and Kruskal. algorithm Total activity duration and then 5: 34 minutes answer Q 1 24: 18 minutes 10

In-class Activity Design -1 Learning Objective(s) of In - Class Activity At the end

In-class Activity Design -1 Learning Objective(s) of In - Class Activity At the end of the class, students will be able to, 1. Know the basics of MST 2. Properties of MST 3. Types of MST 4. Applications of MST Key Concept(s) to be covered § § Use of Prims and Kruskal algorithm in Real World Problem Solving. Implementation of Prims and Kruskal 11

In-class Activity Design -2 Active Learning activity(ies) that you plan to do Real world

In-class Activity Design -2 Active Learning activity(ies) that you plan to do Real world problem solving using. § Think-Pair-Share Concept clarification using. § Peer Instruction 12

In-class Activity Design -2 Q 1: Which of the following is/are the operations performed

In-class Activity Design -2 Q 1: Which of the following is/are the operations performed by kruskal's algorithm. i) sort the edges of G in increasing order by length ii) keep a subgraph S of G initially empty iii) builds a tree one vertex at a time A) i, and ii only B) ii and iii only C) i and iii only D) All i, ii and iii 13

In-class Activity Design -2 Q 2: Rather than build a subgraph one edge at

In-class Activity Design -2 Q 2: Rather than build a subgraph one edge at a time. . . . builds a tree one vertex at a time. A) kruskal's algorithm B) prim's algorithm C) dijkstra algorithm D) bellman ford algorithm 14

In-class Activity Design -2 Q 3: . . . . is known as a

In-class Activity Design -2 Q 3: . . . . is known as a greedy algorithm, because it chooses at each step the cheapest edge to add to subgraph S. A) Kruskal's algorithm B) Prim's algorithm C) Dijkstra algorithm D) All the above 15

In-class Activity Design -2 Q 4: . . . . turns out that one

In-class Activity Design -2 Q 4: . . . . turns out that one can find the shortest paths from a given source to all points in a graph in the same time. A) Kruskal's algorithm B) Prim's algorithm C) Dijkstra algorithm D) Bellman ford algorithm 16

In-class Activity Design -2 Q 5. . . . is a more generalized single

In-class Activity Design -2 Q 5. . . . is a more generalized single source shortest path algorithm which can find the shortest path in a graph with negative weighted edges. A) Kruskal's algorithm B) Prim's algorithm C) Dijkstra algorithm D) Bellman ford algorithm 17

In-class Activity Design -2 Q 6. The result of prim's algorithm is a total

In-class Activity Design -2 Q 6. The result of prim's algorithm is a total time bound of. . . . A) O(logn) B) O(m+n logn) C) O(mn) D) O(m logn) 18

In-class Activity Design -2 Peer Instruction Strategy § All the students first vote individually.

In-class Activity Design -2 Peer Instruction Strategy § All the students first vote individually. § Then the students discuss with peers and come to consensus. 19

In-class Activity Design -2 TPS Strategy Premise (Evidence): Q 1 The students were allowed

In-class Activity Design -2 TPS Strategy Premise (Evidence): Q 1 The students were allowed to watch the videos on Prims and Kruskal algorithms. During the class hours TPS strategy was adopted. Students were given time for thinking over the topics. Later, they were paired. During the session, students discussed the topics. Then they were instructed to share their views. 20

In-class Activity Design -2 TPS Strategy Think (~6 minutes) Pair (~10 minutes) : Think

In-class Activity Design -2 TPS Strategy Think (~6 minutes) Pair (~10 minutes) : Think individually and identify the scenario : Now pair up and discuss 21

In-class Activity Design -2 [Q 1] Correct Solution: (A) A) i, and ii only

In-class Activity Design -2 [Q 1] Correct Solution: (A) A) i, and ii only [Q 2] Correct Solution: (B) B) prim's algorithm [Q 3] Correct Solution: (A) A) Kruskal's algorithm [Q 4] Correct Solution: (c) C) Dijkstra algorithm [Q 4] Correct Solution: (D) D) Bellman Ford [Q 6] Correct Solution: (B) B) O(m+n logn) 22

In-class Activity Design -2 FEED BACK 23

In-class Activity Design -2 FEED BACK 23