CSC 305 - File Structures

Ray Seyfarth

Text

"File Structures" by Michael Folk, Bill Zoellick, and Greg Riccardi

Goals

Disk device fundamentals
File structures and algorithms for organizing very large files
Using Python to write file structures code

To achieve these goals we will study most of chapters 1 through 10 of the text. We will also learn about using Python under UNIX.

Prerequisites

Successful completion of CSC102 and CSC102L (C or higher grade). We will learn Python and do Python programming. It is expected that students have done programming using linked lists.

Homework

There will be 8-16 homework assignments which will be worth 10 points each. Homework must be produced using a computer (not hand-written).

Classwork

There will probably be in-class assignments or quizzes which will be worth 10 points each.

Programs

There will be 6 to 8 programs to write. They will vary in length with the latter programs longer. Each program will be worth 20 points.

Programs will be written on the orca UNIX system and will be compiled and tested by the instructor. submitted for grading.

Programs will be graded on correctness (80%) and style (20%).

Programs will be due at the start of the class period of the due date. Late programs will not be accepted except under circumstances which I approve such as illness or University-related travel. Approval must be done before the due date. Incomplete programs will be graded if submitted on time. The final time and date for acceptance of any program will be at noon of the Friday prior to exam week.

Tests

There will be 2 tests which will be comprehensive. However, they will focus on recent topics. The first test will be held during a regularly scheduled class meeting and the second test will be held during the time scheduled for the exam for this class. Each of the tests will be worth 200 points.