1 / 14

Classroom Presenter 3

Classroom Presenter 3. Demo. Richard Anderson Ruth Anderson Dept of Computer Science & Engineering University of Washington. 1. Instructor Interface. Student Activities Demo. Student machines receive copy of instructor slides

prince
Download Presentation

Classroom Presenter 3

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Classroom Presenter 3 Demo Richard Anderson Ruth Anderson Dept of Computer Science & Engineering University of Washington 1

  2. Instructor Interface

  3. Student Activities Demo • Student machines receive copy of instructor slides • Students complete the activity by annotating slides with ink or text • Students submit their responses to the instructor

  4. Draw a picture of something from your field of engineering: Student Activity 4 To submit your picture, press the button

  5. Student Activity Student Attention vs. Time Level of Attention 10 20 30 40 50 60 Time

  6. Find the Runtime of Kruskal’s void Graph::kruskal(){ int edgesAccepted = 0; DisjSet s(NUM_VERTICES); while (edgesAccepted < NUM_VERTICES – 1){ e = smallest weight edge not deleted yet; // edge e = (u, v) uset = s.find(u); vset = s.find(v); if (uset != vset){ edgesAccepted++; s.unionSets(uset, vset); } } } Deletemin = log E Find = log V Union = O(1)

  7. Highlight the Minimum Spanning Tree (MST) (use Kruskal’s Algorithm) 2 2 3 B A F H 2 1 1 4 10 9 G 4 C 8 2 D E 7 Total Cost: • Now find the MST using Prim’s method. • Under what conditions will these methods give the same result?

  8. Fill in the Runtimes of Dictionary Implementations O(1) O(N) O(N) O(log N) O(log N) O(N) O(log N) O(N) O(N) O(N) O(N) O(log N)

  9. Do a Radix Sort Values to Sort: 126, 328, 636, 341, 416, 131, 328 BucketSort on least significant digit: BucketSort on next-higher digit: BucketSort on most significant digit :

  10. Reading Pipeline Diagrams • What cycle is the “add” instruction being fetched in? • What is the last cycle where the “or” instruction is active? • What happens in cycle 4?

  11. Pedagogical Goals • Active learning • Classroom Assessment • Determine level of understanding to adjust material • Inclusion of student materials into discussion • Diversity of ideas • Examples to illustrate points • Discussion of misconceptions

  12. Student Activity Build the Perfect Coffee Cup List three desirable properties:

  13. What is your favorite animal? dog cat dragon manatee Quick Poll 13

  14. Thank You! For latest downloads, source code, papers, presentations, mailing list: http://classroompresenter.cs.washington.edu/ Richard Anderson (anderson@cs.washington.edu) Ruth Anderson (rea@cs.washington.edu) 14

More Related