|
cs3000_01, algorithms and data (NEU)
(83)
|
(
4.7/5
)
|
fall 2019 |
|
cs3000_02, algorithms and data (NEU)
(86)
|
(
4.3/5
)
|
fall 2019 |
|
cs3000_03, algorithms and data (NEU)
(58)
|
(
4.7/5
)
|
fall 2019 |
|
cs3000, algorithms and data (NEU)
(81)
|
(
4.4/5
)
|
fall 2018 |
|
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 2x
(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)+
|
|
spring 2004 |
|
Advanced undergraduate algorithms
|
|
Dartmouth, 1997 |
|
Novel frameworks in theoretical CS
|
|
Dartmouth, 1996 |