Data Structures and Algorithms
Computer Science 213, Fall 2009
Main | Syllabus | Grading | Programming Style | Honesty | Archive

Professor Lisa N. Michaud

Email:
lmichaud@anselm.edu

AIM: ________________________

Office: 207 Poisson Hall

Lecture (108)

Mon / Wed / Fri

11:30am-12:20pm
Lab
(108)
Monday 2:30-4:20pm

Office Hours
(207)

Tuesday

11:30am-12:30pm

Wednesday 2:00-3:00pm
Thursday 1:30-3:30pm
(Other) by appointment

Welcome to Computer Science 213, Data Structures and Algorithms.

*ANNOUNCEMENTS - Last Updated: 12/7/09

For Lab on Monday, December 7th:

Due Thursday, December 10th:

General:

CLICK HERE for Projects and Handouts from throughout the semester.

*OVERVIEW OF THE COURSE

At the start of your studies in Computer Science, you focused on the basic building blocks of the modern programming language: what they are, how to use them, and how they can be combined. In this semester, we take that one step further; we explore our ability as writers of programs to create more and more complex data types from those basic pieces. This will aid us in the creation of ever more complex and interesting ways of storing and manipulating information. Along the way, we will encounter the questions that arise from more complicated programs, including concepts of object inheritance, recursive approaches to programming, and the analysis of the algorithms we use.

*GRADING

Your grade will be calculated based on quizzes, labs, programming projects, two exams, and your in-class participation. The distribution will be based on the below (but is subject to change):

Quizzes (~5) 10%
Labs (~12 5%
Programming Projects (~8) 55%
Midterm Exam 15%
Comprehensive Final Exam 15%

Asking and answering questions in class and contributing to classroom discussion will be rewarded. A positive contribution to the course may result in bonus points;a negative contribution, such as disrespectful attitude or behavior, including the use of cell phones or text messaging in class, will result in a penalty.

*LECTURES AND LABS

This course meets three times a week for lecture, and one additional afternoon a week for a lab. Labs will typically cover exercises which illustrate recent lecture topics. Attendance in lab is mandatory; no credit is given for a lab that is missed

*EMAIL POLICY

Information and announcements will be frequently communicated via email. It is the student's responsibility to check for email announcements on a regular basis throughout the week. Emails will usually be sent from the Blackboard system, so make certain the email address you have registered in Blackboard is the one at which you prefer to receive emails.

*REQUIRED TEXTBOOK

The required text for this course is Data Abstractions & Problem Solving with java by Frank M. Carrano and Janet J. Prichard . You are expected to keep up with the reading associated with each chapter either before or immediately after it is covered in class.

*COURSE WEBSITE

If you are viewing this text on paper, you may want to also check it out online at:

http://www.anselm.edu/internet/compsci/Faculty_Staff/lmichaud/teaching/213

This web page is linked from the Blackboard portal for this course. The online version of the syllabus will be kept up-to-date with assignments and announcements.

Free Original Clipart at Designed to a T