Teaching Seminar: Heather Conboy, Making a List Abstract Data Type

Content

Speaker

Heather Conboy

Abstract

We commonly use lists for everyday tasks such as writing a shopping list or viewing recent bank transactions. In this talk, we first specify a list abstract data type, meaning an ordered collection of elements indexed by the integers starting from zero. We then implement two lists, one based on an array data structure and another based on a linked list data structure. We lastly briefly discuss the tradeoffs between these two list implementations. The talk assumes familiarity with array and linked list data structures.

Bio

Heather Conboy earned her Ph.D. in Computer Science from UMass Amherst in 2017. Her primary teaching goal is to provide students with the computing foundations and experience needed to develop quality software. Heather’s current research projects investigate an ethical and responsible computing education platform and electronic medical safety checklists. She previously worked on research projects in the areas of interface synthesis and model checking.

Faculty hosts

David Mix Barrington and Mordecai Golin