intro - Computer Science 211 Data Structures Mount Holyoke...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Computer Science 211 Data Structures Mount Holyoke College Fall 2009 Topic Notes: Introduction and Overview Welcome to Computer Science 211! Why Take Data Structures? You have programming experience, at least some in Java. In this course, you will become a more sophisticated programmer, as you learn about designing correct and efficient algorithms and data structures for use in your programs. Along the way, you will: hone your problem solving skills, gain experience in programming in general, Java in particular, learn how to implement algorithms and data structures in Java, learn how to evaluate and visualize data structures and algorithms, learn how to understand (and prove) some properties of data structures and algorithms, learn how to consider the relative merits of different structures and algorithms, and learn how to design large programs (in an object-oriented way) so that it is easy to modify them We will do very little with graphics and animations, instead choosing to focus on the relatively sim-...
View Full Document

This document was uploaded on 02/15/2010.

Page1 / 2

intro - Computer Science 211 Data Structures Mount Holyoke...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online