SCS Teaching Track Faculty Candidate - Elijah Rivera

— 4:00pm

Location:
In Person and Virtual - ET - ASA Conference Room, Gates Hillman 6115 and Zoom

Speaker:
ELIJAH RIVERA, Ph.D. Candidate, Department of Computer Science, Brown University
https://www.elijahrivera.com/

Adapted lecture from the course “Program Design with Data Structures and Algorithms" at Brown University. This talk assumes familiarity with list-like and array-like data structures. Arrays offer efficient storage and lookup operations for ordered or numerically labeled data, but real-world data often doesn't lend itself to numeric organization. Does this mean we miss out on the benefits of arrays? We don't have to! 

In this lecture, we’ll design a powerful new data structure—the hashmap—that allows us to use non-numeric keys with the same ease as numeric indices. We’ll dive into the design challenges and trade-offs involved in transforming keys into array indices, and by the end we’ll achieve a data structure that maintains constant time access to data, no matter what kinds of labels our information carries. 

— 

Elijah Rivera is a PhD candidate in CS at Brown University, where he is serving as Teaching Fellow for "Program Design with Data Structures and Algorithms." He is advised by Prof. Shriram Krishnamurthi and Prof. Kathi Fisler. His expertise and his heart are both in computing education, but his mind is also easily distracted by interesting problems from many other fields of CS. Prior to his time at Brown, he received both his S.B. and M.Eng. from MIT, where he worked on several research projects in the fields of programming languages, program synthesis, and formal verification. S3D Joint with CSD

In Person and Zoom Participation.  See announcement.

Add event to Google
Add event to iCal