Teaching Demonstration: Binary Search Trees
To view this live seminar via Zoom visit:
https://zoom.us/j/9274672434
A password is now required to attend this event; if you did not receive it via email, please contact Joyce Mazeski at jmazeski@cs.umass.edu or Randy Barrios at events@cs.umass.edu.
Abstract: Peter Klemperer will be presenting a teaching demonstration on the topic of Binary Search Trees. Learning Goals for the talk include: common operations on the Binary Search Tree, terminology, algorithms for the implementation of common operations, and Big-O analysis of the efficiency of common binary search tree operations. Following the example learning activity, Peter will be discussing the pedagogical reasoning behind this lesson's specific approach.
Bio: Peter F. Klemperer is an assistant professor of computer science and innovation hire in engineering. He is interested in all aspects of computer security, with an emphasis on virtualized systems and usability. Klemperer is interested in how virtualization can provide an isolated high ground position for malware detection in operating systems and processes. In general, he enjoys developing solutions to engineering problems in computer systems.
Klemperer teaches courses that serve as introductions to computer science and engineering, including: iDesign Studio, Engineering Robotic Systems, Introduction to Object Oriented Programming, and Data Structures. Klemperer completed his doctorate in Electrical and Computer Engineering at Carnegie Mellon University in 2014. He completed his Master's Degree in Electrical and Computer Engineering at the University of Illinois at Urbana-Champaign in 2008.