CS 3050: File Processing

Welcome to CS 3050, File Processing

Course Objectives

• To acquire knowledge and methods of file organization and the file access algorithms that  economize on disk access.
  
• To learn effective methods of analyzing the efficiency of these organization methods and algorithms.
• To acquire more programming skills.
• We will cover most of chapters 1-4 and selected sections of chapters 6, 8 and 9 from the text. Additional material may be covered as time permits.
  

Announcements and Upcoming Events

2/15/06	Welcome to CS 3050!
2/21/06	Office Hours Announced! Tuesday 8:30 am to 9:30 am Wednesday 11:30 am to 12:30 pm Thursday 2:30 pm to 4:30 pm and by appointment
4/26/06	Lab 5 will be posted on Friday, April 28. Lab 3 must be turned in before this to receive credit.
5/5/06	There will be an optional quiz available at the final time (when we will be taking Quiz 4) to raise your grade on Quiz 3. Please notify me before May 23, if you intend to take it.
5/18/06	Office Hours:      Monday, May 22: 2-4 pm      Tuesday, May 23: 2-4 pm      Wednesday, May 24: 10 am - 2 pm

Textbook is File Processing: An Object-Oriented Approach with C++, by Folk, Zoellick and Riccardi

Prerequisite: CS 2500

Corequisite: CS 3052

Instructor: Dr. Melanie Martin                           Office: Demergasso-Bava Hall 276

Email: mmartin@cs.csustan.edu                               Office Phone: (209) 667-3787

Web Page: www.cs.csustan.edu/~mmartin

Office Hours: 

Best way to contact Dr. Martin:  Email mmartin@cs.csustan.edu  Please put "CS3050" in the subject line of the email.

Warning: I reserve the right to make changes to the syllabus at any time during the term by announcing them in class and on my web page.

Course Email list: There is an email list set up for this course. Please join it at your earliest convenience, since class announcements and discussion may take place on the list.
To sign up, go to: http://majord.csustan.edu
Enter your email address and cs3050-1 as the name of the list.
Alternately, send email to:
cs3050-1-request@pollux.csustan.edu
with the following in the message body:
subscribe
end

Grading:  Grades will be based mainly upon multiple quizzes, homework and programming assignments.  A plus and minus grading scale will be used to assign final grades.  The final grade weighting of student work is estimated in the table below. 

Quizzes: There will be four, one-hour quizzes, all will be in class, closed book. If you know in advance that you might miss a quiz or exam, you must discuss this with me well in advance. The final quiz will take place during the final examination period. No make-up quizzes or exams will be given unless you have a verifiable emergency.  I do not give early exams to accommodate vacation schedules, so please make your holiday travel plans accordingly.  I reserve the right to refuse make-up requests.

Homework: There will be several non-programming assignments assigned to reinforce concepts discussed in lecture. Late assignments will be penalized 10% per calendar day late, up to a limit of 50%. Late programs overdue by more than 5 calendar days may not be accepted at all, especially later in the semester. It is in your best interest to start assignments early and to come see me right away if serious efforts on the assignment are getting you nowhere.

Programming Assignments: There will be 3 programming assignments. Late programming assignments will be penalized 10% per calendar day late, up to a limit of 50%. Late programs overdue by more than 5 calendar days may not be accepted at all, especially later in the semester. It is in your best interest to start assignments early and to come see me right away if serious efforts on the assignment are getting you nowhere.

Academic Honesty: The work you do for this course will be your own, unless otherwise specified. You are not to submit other people's work and represent it as your own. I consider academic honesty to be at the core of the University's activities in education and research. Academic honesty is expected at all times in this course. Cheating is an attack on the efforts of myself and fellow students and, above all, on the cheater's integrity. Those caught cheating will be dealt with to the full extent allowed under University policy.

Important dates:

(See Schedule of Courses or Academic Calendar)