David Levine

Professor of Computer Science

(207) 228-8440

232 Science Building

Education

  • Ph.D., Dartmouth College, Department of Mathematics and Computer Science, 1986
  • A.M, Dartmouth College, Department of Mathematics and Computer Science, 1982
  • B.A., Swarthmore College, Major in mathematics, minor in physics
 

Current Courses

COS 360 - Programming Languages

Research Interests

Theoretical and empirical analysis of algorithms, especially as related to robotics and computational geometry; design and analysis of large hypertext systems; computer science education; and object-oriented techniques.

 David Levine has taught computer science for over three decades at Williams College, Gettysburg College, Saint Bonaventure University, and now the University of Southern Maine.   Working with the College Board, he has had an input on the grade of over 100,000 Advanced Placement Computer Science examinations despite claiming not to like grading problems.   When not teaching, he loves being out in the woods, having climbed all of the NH 4000-footers and hiked over 2/3 of the Appalachian trail with his wife.   Since moving to Maine in 2020, he has spent way too much time playing disc golf.

Fall 2025 Office Hours: Mon. 2:30 p.m. – 3:30 p.m. and Wed. 12:30 p.m. – 1:30 p.m. in The Dubyak Center

Selected Publications

Levine, D. (2026). "If You Can't Beat 'Em, Conscript 'Em: Experiences Requiring the Use of AI in a Capstone Course", In Proceedings of the 57th SIGCSE Technical Symposium on Computer Science Education, Saint Louis, MO, February 2026; accepted for publication – page numbers unknown at this time.

Chamberlain, D., Pitcairn, A., Snow, N., Sweeney, B., and Levine, D. (2025). "Large Language Models and Introductory Lab Exercises: Susceptibility, Resistance, and Potential". Journal of Computing Sciences in Colleges (Papers of the 29th Annual CCSC Northeastern Conference), Brockport, NY, April 2025, pp. 49-63.

"Fast Linear Expected-Time Algorithms For Computing Convex Hulls and Maxima", with Jon Bentley and Ken Clarkson, Proceedings of the First Symposium on Discrete Algorithms, 1990; revised and expanded version found in Algorithmica, Vol. 9, No. 1, 1993, pp. 168-183.

"Contours of Constructive Hypertext", with Mark Bernstein and Michael Joyce, ECHT '92 - Proceedings of the ACM Conference on Hypertext, December 1992, Milan, Italy. 

"Role Playing: Easing the Paradigm Shift", with Steven Andrianoff and Joseph Bergin.  Proceedings of the OOPSLA Educators’ Symposium, Seattle, WA, November 2002.

"The Sort Detective", Part of the Nifty Assignments Panel, Proceedings of the ACM Technical Symposium on Computer Science Education, February 2002.

5 Steps to a 5: AP Computer Science, with Kathleen Larson, McGraw-Hill, New York, 2005, ISBN 0‑07‑143711‑8.

“XP Practices Applied to Grading”, with Henry Walker, Proceedings of the ACM Technical Symposium on Computer Science Education, February 2006.

(207) 228-8440

232 Science Building

Education

  • Ph.D., Dartmouth College, Department of Mathematics and Computer Science, 1986
  • A.M, Dartmouth College, Department of Mathematics and Computer Science, 1982
  • B.A., Swarthmore College, Major in mathematics, minor in physics
 

Current Courses

COS 360 - Programming Languages

Research Interests

Theoretical and empirical analysis of algorithms, especially as related to robotics and computational geometry; design and analysis of large hypertext systems; computer science education; and object-oriented techniques.