Skip to content

Pain Mitigation w/ npm + AutoGrading Algorithms @ CMU

Photo of Brandon Lum (lumjjb)
Hosted By
Brandon Lum (. and 3 others
Pain Mitigation w/ npm + AutoGrading Algorithms @ CMU

Details

Please join us for two fantastic tech talks:

• Lin Clark from npm Inc. — "Oh, the pain: Team development workflows and pain mitigation with npm"

• Naman Bharadwaj, a student at Carnegie Mellon University — "AutoGrading Algorithm Complexity and Why Complexity Matters"

Agenda:

7:00pm: Refreshments

7:15pm: Announcements

7:25pm - Talk 1

8:00pm - Q & A

8:10pm - Talk 2

8:45pm - Q & A

8:55pm - Conversations and Departure

Oh, the pain: Team development workflows and pain mitigation with npm

Developing on teams can be painful. From broken builds to failing tests, there are all sorts of torments that your colleagues can heap upon you... but there are tools to help. In this talk, I will explain how some of the lesser known features of npm can be used as part of your team's workflow to keep everyone pain-free.

Lin Clark is the Dev Star at npm, Inc. Prior to npm, she worked as a technical lead on a team of developers and also as a core module maintainer on a large open source CMS. She also contributed to many open source projects and was involved in W3C standardization efforts. Together these experiences sparked the passion for good team development practices which inspired this talk.

AutoGrading Algorithm Performance and Why Performance Matters

Computation costs; running a program takes up time, yet understanding and verifying these runtime costs is still a difficult, human process. In this talk, Naman will discuss how a system might be able to automatically verify the running time of quicksort, and how this technology is being used to improve the teaching and learning of algorithms at an undergraduate level. Cost verification techniques have many applications, such as program optimization and autoparallelization.

Naman Bharadwaj is a fourth year undergraduate at Carnegie Mellon University, majoring in computer science and discrete math. For the past five semesters, Naman has been on the course staff of 15-210 Parallel and Sequential Data Structures and Algorithms, and for the past two semesters, he has been focusing on improving the way programming assignments for this course are "autograded," based on both algorithm correctness as well as algorithm complexity.

Directions for driving:

https://www.google.com/maps/dir/Morewood+Gardens+Parking+Lot,+Pittsburgh,+PA+15213/40.4435862,-79.9455491/@40.4438049,-79.9439932,18z/data=!4m10!4m9!1m5!1m1!1s0x8834f223cc46da6d:0x20fe8cbb72b0da5b!2m2!1d-79.944343!2d40.445461!1m0!3e2!5i1

Building Entrance:

https://www.google.com/maps/dir//40.4435789,-79.9455572/@40.4439882,-79.9436944,17z

Directions Inside Building:

  1. Upon going in, proceed forward and make a right.

  2. the room is right ahead through a door.

Photo of ACM Pittsburgh group
ACM Pittsburgh
See more events
Carnegie Mellon University
Newell Simon Hall (NSH) 3305 · Pittsburgh, PA