Sign Up
Log in Sign up

Computer Science & Engineering Teaching Candidate Talk

Monday, November 14, 2022 11:30 AM to 12:30 PM

I'm Interested
Jule Shatz
I'm Interested

About this Event

McKelvey Hall , Room 1020

Jule Schatz

PhD Candidate in the Department of Computer Science, University of Michigan. 

Binary trees and more specifically binary search trees, provide efficient solutions to many problems in computer science. This teaching demo will go through what binary trees are and how to write recursive functions to use them efficiently. This demonstration is aimed at students in the 2nd computer science course after having seen binary search, recursion, and linked data structures (linked lists, trees).

 

Event Details

Event Type

Lectures & Presentations

Schools

McKelvey School of Engineering

Topic

Science & Technology

Department

Computer Science & Engineering

Event Contact

smaria@wustl.edu

Speaker Information

Jule Schatz has served as instructional assistant and graduate student instructor for several classes at the University of Michigan and was primary instructor of an undergraduate class in spring 2022.  She has received the Toner Prize 2022 honoring graduate student instructors who demonstrated innovation and excellence in teaching, especially during the pandemic.  She also received the Aspire, Advance, and Achieve Mentoring Award in 2021, and the Graduate Student Instructor Academic Year Award for 2020/21.  Her research focuses on creating generally intelligent computer agents using Soar, a cognitive architecture. 

See Who Is Interested

  • Ubongabasi Etukudoh
  • Justine Craig-Meyer

2 people are interested in this event

I'm Interested

Dial-In Information

Join Zoom Meeting here: 

https://wustl.zoom.us/j/97225624163?pwd=S0c1cFArVkJKb3pTWjdycGF3eENQdz09

About this Event

McKelvey Hall , Room 1020

Jule Schatz

PhD Candidate in the Department of Computer Science, University of Michigan. 

Binary trees and more specifically binary search trees, provide efficient solutions to many problems in computer science. This teaching demo will go through what binary trees are and how to write recursive functions to use them efficiently. This demonstration is aimed at students in the 2nd computer science course after having seen binary search, recursion, and linked data structures (linked lists, trees).