rsun 发表于 2013-12-20 16:13 ![]()
还有一些问题,麻烦指导!
Berkeley的data structure和princeton的algorithm能不能推荐一门?
好像berk ...
其实两门课我都没有跟过,61B只是看了一点点。。。为了不误人子弟,只分享别人的观点:
在这里看到的:http://coursetalk.org/coursera/algorithms-part-i
好评的:“
This was my first MOOC. The strongest parts were:
+ Lectures
+ Programming Assignments
+ Discussion Forums The weakest parts were:
+ Quizzes
+ Final I really like the auto grader. It provided instant feedback. The test cases and resource utilizations were extremely helpful in completing the assignment. While getting the assignment to work wasn't a major challenge, getting to work within the time and space boundaries was. It was a challenge to optimize these assignments, and without the auto grader and its feedback, I doubt that I would have reached those levels of optimized performance.
”
和差评的:
“
The weakest point are surely quiz. With the randomization occurring at every attempt, replicating algorithms in pen and paper was an unpleasant, frustrating experience, and I quickly lost interest in completing it - the power of repeatable quiz, is to fix knowledge errors and misconceptions by feedback, not punish those trying to learn. Assignments were quite interesting and I wish I would have tried a couple more... In the end, the lack of any sort of reward or performance measure, even only the honor certification, drained my interest in investing more time than simply watching the videos, and I finished skipping few units, to start different courses. Overall, the very high quality of the lectures will make me consider to check the courses again in the future for improvements.
”
总结如下:
1 princeton的讲课好、作业自动评分,问答社区TA好; 坏处是无certification,内容略简单了
2 61B好处是讲课好(地里很多跟过人的评论),内容更深更全;坏处是无certification,无进度监督,无作业批改
|