Semester.ly

Johns Hopkins University | EN.600.226

Data Structures

4.0

credits

Average Course Rating

(3.89)

This course covers the design and implementation of data structures including arrays, stacks, queues, linked lists, binary trees, heaps, balanced trees (e.g. 2-3 trees, AVL-trees) and graphs. Other topics include sorting, hashing, memory allocation, and garbage collection. Course work involves both written homework and Java programming assignments.

Fall 2012

(4.07)

Fall 2014

(3.86)

Spring 2013

(3.29)

Spring 2014

(4.31)

Spring 2015

(3.92)

Fall 2012

Professor: Joanne Selinski

(4.07)

Students enjoyed the interesting subject matter and said that the professor explained it well. They also liked getting hands-on programming practice. Students said the negative aspect of the course was the difficult and time-consuming assignments. They also said that it was hard to pay attention to lectures when the professor was coding in class. Suggestions for improvement included having shorter homework or having more time to finish them. Students taking this course should have strong a programming background and should expect to spend a lot of time working on assignments.

Fall 2014

Professor: Sara More

(3.86)

Students enjoyed the interesting material covered in this class that they thought was taught by a helpful and approachable professor. Students thought the greatest drawback of the course were that lectures sometimes seemed disorganized and that homework assignments were not always well-aligned with the material being covered in lectures. They also thought the course could be improved with timelier grading of assignments. It was important for prospective participants to know that a solid background in java programming would be especially valuable for this course, students said.

Spring 2013

Professor: Joanne Selinski

(3.29)

The best aspects of this course included the opportunity to code structures, the Piazza forum for asking questions and responding, and the chance to improve upon one’s knowledge of Java. Some students felt the instructor’s feedback on assignments was disorganized and that the grading seemed arbitrary. Some students also felt the instructor would at times, relay faulty or inaccurate information to the students. Suggestions included incorporating an optional lab to correspond with this class and utilizing more organized visual aids to coincide with lecture material. Prospective students should be prepared for a heavy workload outside of the classroom.

Spring 2014

Professor: Data Structures

(4.31)

Many students felt that the professor was an excellent lecturer and they enjoyed the projects required from them. They thought that this was a comprehensive approach to learning and al owed students to connect with others from their major. Also, the TA and instructor promptly responded to students’ questions and comments. In addition, the instructor hands out notes for the entire semester at the beginning. The amount of work students had thrown upon them was stressful, but seemed to be worth the 4 credits. Suggestions for improvement include: a grading rubric for assignments, more TAs/CAs available, smaller class size, and more time spent on projects. Prospective students should have some background in Java.

Spring 2015

Professor: Sara More

(3.92)

The best aspects of the course included the passionate and knowledgeable professor, as well as the interesting material. Students found lectures to be very informative, though many indicated that having class notes posted in advance would have been helpful for weekly preparation. Students appreciated the difficulty of assignments, but many were confused by the grading system. Suggestions for improvement included providing more supplemental resources for students to better understand concepts, and providing more prompt and detailed feedback on assignments. Prospective students may benefit from a background in programming and should be prepared for a heavy work load.