Binary Heaps and AP CS A Outreach Program

LUNCH
Lunch will be served at 11:45 AM.

ABSTRACT
1. Binary Heaps
I will present the heap data structure. Two properties define a heap. First, it is a complete binary tree, so it is implemented using the array representation for complete binary trees. Second, the values stored in a heap are partially ordered. This means that there is a relationship between the value stored at any node and the values of its children. Due to its space and time efficiency, the heap is a popular choice for implementing a priority queue.

2. AP CS A Outreach program
I will present the outreach program between Penn Engineering and the non-profit Heights Phila I am coordinating. The program's goals are: (1) to expand CS access & excellence across Philadelphia and (2) to prepare students for the AP CS A exam. The program runs year-long, with in-person and online instruction during the school year and in-person during the summer. Since its inception, the number of students enrolled has more than doubled, and more than 75% of the students who took the AP CS A exam passed with a score of 3 or above). I will also discuss future outreach, teaching, and research ideas and what makes Duke University a great place to implement those projects.

SPEAKER BIO
Dr. Eric Fouh is an Assistant Practice Professor of Computer Science at the University of Pennsylvania, where he teaches a variety of introductory and advanced courses. His research interests include computer science education, learning sciences, learning technologies, and learning analytics. He is passionate about using technology to improve the teaching and learning of computer science. He is a member of the ACM Special Interest Group on Computer Science Education (SIGCSE). He has publications in top academic computing education conferences and journals, including the SIGCSE Technical Symposium, the International Conference on Learning Analytics & Knowledge (LAK), and Computers in Human Behavior.