CSci 257
Course Syllabus

TR, 9:30am
Woods Lab 136

    Office Hours:   WL 133
   
   
MTWR 1:30-3:00
or by appointment
    email:     scarl AT sewanee D0T edu
    phone:     598-1305

Overview

Our objective in this course is to learn to design and implement the elementary abstract data types (lists, stacks, queues, trees, and tables); to analyze the algorithms that operate on these data types; and to properly use them in building programs. We'll also continue the study of Java constructs and fundamental programming techniques (such as recursion) started in CSci 157.

Prerequisites

Textbooks

The grade for the course will be based upon the following:


Workload
Points
 

Weekly Homework

20

 

5 Programming Projects

36

 

Reading Quizzes and Class Exercises

14

 

2 Exams (10 pts each)

20

 

Final exam (Friday, May 5th, 9:00am)

10

Attendance:

Attendance is an important factor in succeeding in this course. There will be in-class exercises from time to time, as well as the occasional quiz over the reading. The student is responsible for making up any work missed due to absence. The Office of the Dean of Students will be notified after three unexcused absences.

Computer use and accounts:

Assignments:

Homework and programming projects make up most of the course grade. We will also have a number of in-class lab exercises to get experience applying new programming concepts. Completed labs figure into the class participation portion of the grade.

Students are expected to work independently on homework assignments unless group work is specifically indicated. Each assignment will specify how and when it is to be turned in. Late assignments are penalized 10% for each day late, but every student has 3 grace days for the semester.
The Honor Code applies to all exams and assignments. Plagiarism is copying or imitating the language and thoughts of others, whether computer program, website, or written paper. For more information, see the Course Policies and Grading page.