of the courses I have taught.
Carnegie Mellon (2001- present)
- Course for
people who have little or no programming experience. Taught
to students from any major on campus. Currently taught in
- Introduction to Data Structures
data structures (stacks, queues, linked lists, binary trees, lists,
sets, maps). Currently taught in Java.
Immigration Course I and II
- A course to
introduce cs majors
computer science as a field and some of the projects at Carnegie
Mellon. Co-taught with Rich Pattis or Jacobo Carrasquel.
Data Structures and Algorithms
core course that teaches students details of mathematical algorithm
analysis and core algorithms from the field, such as graph theory,
binary search tree balancing, heaps, priority queues, compression, and
game tree searching. Co taught with Danny Sleator, Klaus
Sutner, and Margaret Reid-Miller.
Consulting in the Community.
- A course
that engages students in a project with a non-profit client in the
community. Students are engaged in intellectual inquiry and
communication throughout the course in a rigrorous environment.
Program run with Joe Mertz.
- Program web site.
Communication, Leadership, and the Social Context of Computing via a
Consulting Course", Joe Mertz and Scott McElfresh, Proceedings of the
SIGCSE Technical Symposium.. Digital library.
- A summer program for high school
students, the Summer Academy
for Math and Science. From 2002-2004, I worked with Ananda
Gunawardena and Neema Moraveji on
computer science projects with students in this program.
Muhlenberg College (1998-2001)
Statistical Methods, Topics in
Mathematics, Computer Science I, Computer Science II, Introduction to
Computers, Data Structures, Theory of Programming Languages.
St Lawrence University
Concepts of Computation, Introduction to
Programming, Introduction to Computer Science, Data Structures,
Object-Oriented Programming, Programming Languages, Algorithm Analysis.
Dartmouth College (1994)
Introduction to Computer Science (Honors)
I received my PhD in Computer Science from Dartmouth
Science in June 2002.
My thesis: Locally Minimal Triangulations
L. "Scot" Drysdale
Triangle-based LMT-Skeleton of the
Minimum Weight Triangulation", Scott McElfresh (in preparation).
Exclusion Regions for Optimal Triangulations", Scot
McElfresh, Jack Scott Snoeyink. Discrete
Applied Mathematics 109 (2001) 49--65. [Preliminary
CG98, 14th European Workshop on Computational Geometry.]
Greedy Triangulation Algorithms", Matt Dickerson, Scot
McElfresh, Emo Welzl. Computational
Geometry: Theory and Applications, 8 (1997)
[Preliminary version at SoCG94, ACM Symposium on Computational
and Empirical Findings on Minimum Weight Triangulation Heuristics",
Matt Dickerson, Scott McElfresh, Mark Montague. Proceedings
of the 11th
Annual Symposium on Computational Geometry (1995) 238--247.
Examination of the properties of Locally Optimal
Empirical examination of various skeletons for the MWT.
Theoretical work on pre-tests for inclusion or exclusion from
the MWT or
Some recent work in
computational geometry includes: