neal young / teaching

graduate courses

cs215, theory of computation (17) ( 81% ) winter 2016
cs215, theory of computation (20) ( 85% ) winter 2015
cs218, design and analysis of algorithms (46) ( 81% ) fall 2014
cs215, theory of computation (17) ( 80% ) winter 2014
cs262, algorithms and data structures (advanced algorithms) (6) ( 91% ) winter 2013
cs218, design and analysis of algorithms (49) ( 81% ) fall 2011
cs218, design and analysis of algorithms (41) ( 93% ) fall 2010
cs262, algorithms and data structures (advanced algorithms) (8) ( 96% ) winter 2010
cs218, design and analysis of algorithms (57) ( 87% ) fall 2009
cs270, research seminar (5) ( -% ) winter 2009
cs260, approximation algorithms (7) ( 92% ) spring 2008
cs215, theory of computation (14) ( 100% ) winter 2008
cs260, approximation algorithms (10) ( 64% ) spring 2007
cs260, approximation algorithms (8) ( 98% ) winter 2006
cs215, theory of computation (23) ( evals ) fall 2004
cs260, approximation algorithms (11) winter 2004

undergraduate courses

cs145, combinatorial optimization algorithms (35) ( 84% ) spring 2017
cs145, combinatorial optimization algorithms (18) ( 83% ) spring 2016
cs145, combinatorial optimization algorithms (13) ( 85% ) winter 2015
cs141, intermediate data structures and algorithms (65) ( 72% ) spring 2013
cs111, discrete structures (74) ( 72% ) fall 2012
cs141, intermediate data structures and algorithms (68) ( 76% ) fall 2012
cs141, intermediate data structures and algorithms (59) ( 75% ) spring 2012
engr101, professional development and mentoring (72) ( 77% ) fall 2011
cs141, intermediate data structures and algorithms (31) ( 83% ) spring 2011
engr101, professional development and mentoring (46) ( 90% ) fall 2010
cs141, intermediate data structures and algorithms (45) ( 78% ) spring 2010
cs141, intermediate data structures and algorithms (34) (34) ( -% ) spring 2009
cs141, intermediate data structures and algorithms (28) ( 79% ) fall 2007
cs145, combinatorial optimization algorithms (16) ( 80% ) spring 2007
cs141, intermediate data structures and algorithms (22) ( 88% ) fall 2006
cs141, intermediate data structures and algorithms (27) ( 79% ) spring 2006
cs141, intermediate data structures and algorithms (28) ( 85% ) winter 2006
cs141, intermediate data structures and algorithms (20) ( 81% ) fall 2005
cs141, intermediate data structures and algorithms (22) ( 83% ) winter 2005
cs141, intermediate data structures and algorithms (33)+ (50) spring 2004
Advanced undergraduate algorithms Dartmouth, 1997
Novel frameworks in theoretical CS Dartmouth, 1996

More Information

Footer