Semester.ly

Johns Hopkins University | EN.550.472

Graph Theory

4.0

credits

Average Course Rating

(4.46)

Study of systems of “vertices” with some pairs joined by “edges.” Theory of adjacency, connectivity, traversability, feedback, and other concepts underlying properties important in engineering and the sciences. Topics include paths, cycles, and trees; routing problems associated with Euler and Hamilton; design of graphs realizing specified incidence conditions and other constraints. Attention directed toward problem solving, algorithms, and applications. One or more topics taken up in greater depth.

Spring 2013

(4.0)

Spring 2014

(4.38)

Spring 2015

(5.0)

Spring 2013

Professor: Rico Zenklusen

(4.0)

The best aspect of this course was the intriguing subject matter. The instructor was open to feedback and the lectures were well-organized. One student felt that the section was useless. Another student felt there was too much focus on algorithm creation and run time analysis. Suggestions included providing more MATLAB problems and offering more practice problems in sections. Prospective students should know that this course is extremely chal enging mathematical y because of the abstract nature of the subject. 17

Spring 2014

Professor: Amitabh Basu

(4.38)

This class featured clear and well-organized lectures, an engaged and enthusiastic instructor, and considerable intellectual challenge. Many students thought this class pushed them harder academically than most other classes they have had. The combination of undergrad and graduate students left many undergrads struggling to keep up with the higher expectations. Some suggestions for improving the course included a more available TA, more time for homework, and separate assignments for the 400 level students and 600 level students. Prospective students should know this is an intellectually challenging course with a consistently heavy workload.

Spring 2015

Professor: Amitabh Basu

(5.0)

Students enjoyed the real world applications of the material covered in this course, as well as the accessibility of the TAs and instructor, and the organized and interesting lectures presented by the instructor. Some students found the exams to be too difficult to complete within the time al otted. Suggestions for improvement included having exercises in completing timed proofs before exams, starting the course later in the day, providing easier homework sets, and expanding the class size. Prospective students should be prepared for an intel ectual y chal enging course. Previous experience with probability and proofs would be beneficial.