Owen Astrachan

Owen Astrachan

Owen Astrachan is Professor of the Practice of Computer Science at Duke University where he is also the department's director of undergraduate studies. He earned an AB degree in Mathemetics from Dartmouth College in 1978 (with distinction, Summa Cum-Laude, and Phi Beta Kappa), an MAT in teaching mathematics from Duke in 1979 and MS and Ph.D degrees in computer science from Duke in 1989 and 1992.[1]

Contents

Teaching

He is the author of Astrachan, Owen (2000), A Computer Science Tapestry: Exploring Programming and Computer Science with C++, McGraw Hill, ISBN 0-07-232203-9 . At Duke he won the Richard K. Lublin Distinguished Teaching Award[2] in 2002 for "the ability to engender genuine intellectual excitement, ability to engender curiosity, knowledge of field and ability to communicate that knowledge". He also won the Robert Cox teaching award at Duke in 1995 and an Outstanding Instructor award while teaching for a semester at the University of British Columbia.

Astrachan has won a number of National Science Foundation (NSF) awards.[3] In 2007 he received one of two NSF CISE Distinguished Education Fellow[4] awards recognizing his role "as an accomplished, creative, and innovative leader who serves the nation as a spokesperson and force for change in undergraduate computing education."

This NSF grant and award follows a CAREER award in 1997 to investigate "practical and pedagogical concerns of the computer science and software engineering communities with an integrated approach to the use, learning, and teaching of [design] patterns"[5] an award in 1996 to develop materials in support of "an application oriented, apprenticeship learning approach to the CS2 course"[6] and other NSF awards for developing curricular materials to support education, research, and visualization[7] in 1996 and for developing modules and courses for ubiquitous and mobile computing[8] in 2000.

Assignments

In creating assignments for programming courses, Astrachan's Law Parlante, Nick (2003), "Astrachan's Law", ACM SIGCSE Bulletin 35 (4): 26, doi:10.1145/960492.960518  refers to a tenet in developing assignments:

Do not give an assignment that computes something that is more easily figured out without a computer, such as the old Fahrenheit/Celsius conversion problem... Astrachan's Law reminds us to do a little showing off with our computation.

Several assignments developed by Astrachan have appeared in the Nifty Assignments Archive including

  • Huffman Coding Parlante, Nick; Mike Clancy, Rich Pattis, Stuart Reges, Julie Zelenski, Owen Astrachan (1999), "Nifty Assignments Panel", ACM SIGCSE Bulletin 31: 354–355, doi:10.1145/384266.299809 
  • Word Ladders Parlante, Nick; Mike Clancy, Stuart Reges, Julie Zelenski, Owen Astrachan (2001), "Nifty Assignments Panel", ACM SIGCSE Bulletin 33: 412–413, doi:10.1145/366413.364797 
  • DNA Parlante, Nick; Thomas Murtagh, Mehran Sahami, David Reed, Christopher Stone, Brent Heeringa, Karen Reid Owen Astrachan (2009), "Nifty Assignments Panel", ACM SIGCSE Bulletin 41: 483, doi:10.1145/1539024.1509031 

Luis von Ahn was a student in two undergraduate courses at Duke under Astrachan. When visiting Duke in 2008, von Ahn discussed his PageRank assignment at Carnegie Mellon University. The assignment has been picked up at Cal Tech's Ideas Behind the Web course, but also at Duke University in the Rankophiliac assignment for Compsci 182s Technical and Social Foundations of the Internet. Example for this project.

Programming Contests

Owen Astrachan was a member of Duke's ACM's Programming Team that placed fourth in the world in 1989[9] and seventh in the world in 1990. He has coached a Duke team to the world finals every year but one since 1994 which is the most appearances in the world finals of any US team.[10] In 2006 Business Week followed the Duke team during the world finals and reported on how badly they did.[11]

For four years, 1990–1993, he and other graduate students ran the first distributed, Internet-based programming contest which is reported in Owen Astrachan; David Kotz, Vivek Khera, Lars Nyland (1993), "The Internet Programming Contest: a report and philosophy", Proceedings of the SIGCSE Symposium 25: 48–52, doi:10.1145/169073.169105 . In both the 1992 and 1993 contests[12] Sergey Brin participated first as an undergraduate from the University of Maryland then as a graduate student from Stanford as did Sanjay Ghemawat[13] (from MIT) in 1992 and 1993, Daniel Sleator (from CMU) in 1992, Dawson Engler (from MIT) in 1993 and Martin Odersky (from Yale) in 1993.

References

External links


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Owen (name) — For other uses, see Owen. Owen is an anglicized variant of the Welsh name Owain, and may appear as both a personal name and as a surname (with or without the s as in Owens [son of Owen] ). Owen is cognate with Eugene meaning noble born.[1][2] The …   Wikipedia

  • Ordenamiento de burbuja — La Ordenación de burbuja (Bubble Sort en inglés) es un sencillo algoritmo de ordenamiento. Funciona revisando cada elemento de la lista que va a ser ordenada con el siguiente, intercambiándolos de posición si están en el orden equivocado. Es… …   Wikipedia Español

  • Advanced Placement Computer Science — This article is part of the Advanced Placement  series. General exam structure    •    Awards Current Subjects: Art History Biology Calculus (AB BC) Chemistry Chinese Language and Culture Comparative Government Politics… …   Wikipedia

  • Bubble sort — Infobox Algorithm class=Sorting algorithm data=Array time= О(n²) space= О(n) total, O(1) auxiliary optimal=NoBubble sort is a simple sorting algorithm. It works by repeatedly stepping through the list to be sorted, comparing two items at a time… …   Wikipedia

  • Chapel Hill, North Carolina — Coordinates: 35°56′N 79°2′W / 35.933°N 79.033°W / 35.933; 79.033 …   Wikipedia

  • Algoritmo de ordenamiento — Quicksort en acción sobre una lista de números aleatorios. Las líneas horizontales son valores pivote. En computación y matemáticas un algoritmo de ordenamiento es un algoritmo que pone elementos de una lista o un vector en una secuencia dada por …   Wikipedia Español

  • Reflections Projections — reflections❘projections reflections❘projections 2011 logo Status Active Genre Technology, computing …   Wikipedia

  • New York Police Blues : saison 12 — Saison 12 de New York Police Blues Cet article présente le guide de la saison 12 de la série télévisée New York Police Blues (N.Y.P.D. Blue). Ce qui suit dévoile des moments clés de l’intrigue. Sommaire 1 Épisode 1 : Un nouveau départ 2… …   Wikipédia en Français

  • Saison 12 de New York Police Blues — Cet article présente le guide de la saison 12 de la série télévisée New York Police Blues (N.Y.P.D. Blue). Sommaire 1 Épisode 1 : Un nouveau départ 2 Épisode 2 : Mise à pied 3 Épisode 3 : Vengeanc …   Wikipédia en Français

  • Saison 12 de new york police blues — Cet article présente le guide de la saison 12 de la série télévisée New York Police Blues (N.Y.P.D. Blue). Ce qui suit dévoile des moments clés de l’intrigue. Sommaire 1 Épisode 1 : Un nouveau départ 2 Épisode 2 : Mise à pied …   Wikipédia en Français

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”