Course Description and Policies
CS 241: Data Structures, Fall 2007

Course Description:

This course expands on CS231 to further develop a student's understanding of object oriented programming principles including encapsulation, polymorphism, and inheritance. Abstract data types are introduced including stacks, queues, arrays, lists, trees, hash tables and sets. Algorithms that make use of these structures shall also be studied, analyzed and implemented. These include searching, sorting, and recursion.

We will cover the following chapters in the text: Chapters 1-11, 14.1, 15.

Prerequisites

CS231 or equivalent.

Time:

Class: MW 12:50-2:20am in Collins 408
Lab: You are expected to attend at least 2 hours of lab during one or more of the following times:

• 9:10 AM - 10:10 AM Wed in CLN 411 - Orr
• 10:20 AM - 11:20 AM Mon/Wed in CLN 411 - Orr
• 10:20 AM - 1:20PM Wed in CLN 407 - Fiskio-Lasseter
• 1:00 PM - 4:00PM Thu in CLN 407 - Orr
• 12:50 PM - 2:20 PM Tue/Thu in CLN 411 - Fiskio-Lasseter
• 1:50 PM - 4:50 PM Wed in CLN 411 - Ruehr
• 2:30 PM - 4:00 PM Tue/Thu CLN 411 - Ruehr
• 4:00 PM - 7:00 PM Tue/Thu in CLN 411 - Levenick

Final Exam: Friday, Dec 14, 2007, from 2-5 pm

Required Text:

Data Structures and Algorithms in Java, by Peter Drake

Labs

Lab work will be assigned approximately once a week. All lab instructions will be available on the web. Labs will generally be graded on a scale of 0 to 10 pts.

Attendence: Students are expected to attend lab. Attendence is important because it gives students the opportunity to ask the instructor and classmates questions about the assignment. In general, students will need additional time outside of lab in order to complete their work.

Due Date: Late assignments will be penalized as follows:

• late by at most 1 week: 1 pt (or 10%).
• late by between 1 and 2 weeks: 2 pts (or 20%).
• late by more than 2 weeks: 5 pts (or 50%)

Evaluation

There will be 2 exams and a final.

Final course grades will be based in the following:

Attendence and Participation	10%
Labs	40%
Exam 1	15%
Exam 2	15%
Final	20%

Plagiarism and Cheating:

If you do a search on the web, you will find a significant amount of code available. You are not to use this material. The purpose of this class is for you to learn the concepts and coding. Using material off the web defeats this purpose.

In the context of this class, plagiarism is defined as representing someone else's work as your own. Cheating is defined as violating stated rules for an exam or an assignment. Plagiarized work will receive a grade of 0 as will any assignment in which cheating occurred. Both plagiarism and cheating will be reported to the university. (Also see student handbook and college catalogue for more details)