Course Policies

15-121 Introduction to Data Structures
Fall 2010

Instructors: Margaret Reid-Miller and Dave Feinberg


Table of Contents

Course Description

A continuation of the process of program design and analysis for students with some prior programming experience (functions, loops, and arrays, not necessarily in Java). The course reinforces object-oriented programming techniques in Java and covers data aggregates, data structures (e.g., linked lists, stacks, queues, trees, and graphs), and an introduction to the analysis of algorithms that operate on those data structures. NOTE: students must achieve a C or better in order to use this course to satisfy the pre-requisite for any subsequent Computer Science course.

-- From the Official Course Description

Prerequisites: 15-110 or AP CS A with a score of 5, or placement

Text Books

There is no required text book.

Software

If you have your own computer you will need to install this software.

Grading

Coursework Grade You must take all exams at the times given. NO MAKEUPS will be allowed except for major documented life events (e.g., major medical illness, death in immediate family, etc.) or university sports meets. NOTE: You must inform the instructor at least one week in advance of a university sport meet to arrange an alternative time.

Grading Scale

 
Final Grade Pct. Points Earned
A
90 - 100
B
80 - 89
C
70 - 79
D
60 - 69
R
less than 60%

Record Keeping

Please keep copies of all of your graded work, electronic submissions, and electronic feedback, until you receive your final course grade and are satisfied that it is correct. Without the original work and the grading information, it is more difficult and time consuming to correct errors.

Student Responsibilities

We expect you to attend all classes and labs, as you are responsible for everything covered during class. If you are absent, you are responsible for any material you missed.

We expect you to bring a notebook, paper, and pencils or pens to class every day.

You may not use electronic devices in the classroom without prior permission; no texting, no IMing, no email, no surfing the Web, no radar, etc.

Collaboration and Cheating

We encourage you to discuss the exercises and homework with other students. But the discussion is limited to clarifying the assignments and sketching a general approaches to a solution. You should never look at another person's program to help you write yours, nor allow another student to look at your program. It is important that you do your own work so as to maximize your learning.

Here are some examples of acceptable collaboration:

As a general rule, if you do not understand what you are handing in, you are probably cheating. If you have given somebody the answer, you are probably cheating. In order to help you draw the line, here are some examples of clear cases of cheating:

Your course instructor reserves the right to determine an appropriate penalty based on the violation of academic dishonesty that occurs. But be assured that the penalty will be far worse than not turning in the work in question. Most likely, you will receive no credit for the assignment, your semester grade will be penalized by 10% (one letter grade), and we are required to notify the university, your advisor, your department, etc. It is university policy that you will not be allowed to drop the course or change to pass/fail. Violations of the university policy can result in severe penalties including failing this course and possible expulsion from Carnegie Mellon University. If you have any questions about this policy and any work you are doing in the course, please feel free to contact your instructor for help.

Students with Disabilities

Individuals with documented disabilities may be eligible to receive services/accommodations from CMU's Equal Opportunity Services (EOS) office. For more information, please contact Larry Powell, Manager of Disability Services at (412) 268-2013 (voice/TTY).