- 3 reviews
- 3 completed
Finished the full course in 5 days (without final exam, that does not interest me). For somebody who already knows the subject, the course is easy, and the single effort is just to write some recursive functions for some of the quizzes. This is another child course born by simplifying SICP. The particular experience of the professor Wes shared in his videos makes the course interesting to follow. He inserted too many jokes in the lectures, which can be tiring for some persons in some mood. Definitively, it is not the best course to follow as an introduction to the subject, if you do not already know the subject. The course teaches the basic ideas about lexers, parsers, and implements a sublanguage of html + js using ply. To represent graphically the output, the professor extracted a file named graphics.py from a latex compiler implemented in python, and uses that library that already renders tokens identical to html/ For example, opentag(tag), closetag() from html are present in this latex library, hence the output of the final html/js evaluator will be generated as a pdf. Definitively, it is worth taking this course, but does not allocate so high priority comparing to other courses.
One of the best classes I ever took in my life. This is a class that must not miss from the curricula of any CS. I am quite sad that the other classes of Sedgewick -- of Analysis of Algorithms and Analytic Combinatorics -- do not have an automatic grader.
If you do not have any idea about Linear Programming, but if you have a background of Linear Algebra and programming in any programming language, this class will teach you from scratch how to conceive a problem using the technique of Linear Programming. You will learn how to formalize the classical problems of discrete optimizations, like TSP, Sudoku, etc., and solve them using the simplex method. In each week , we were asked to solve a problem using an external tool, like cvxopt, and the next week we were asked to program the tool ourselves. Finally, we built a basic simplex which was able to solve linear integer problems. This method of teaching surprised me. It should be adopted as a method by all researchers in their courses they teach for their students. The involvement of the professors was huge. Practically, they answered all questions for all students. I built a working simplex during this class, and from now on Linear Programming method entered in the bag of my tools that I use to conceive programming problems, a tool that I missed before to take this class. Definitively, in the next session I take the class again , to grasp the details that I missed in this session.