CSCB28F - File Structures  Fall 1998


Instructor: Daniel Panario,  panario@scar.utoronto.ca
==========

Tutor: Goldine Cupit
=====

Lectures: Mon, Wed 11:00--12:00, place S128 
========

Tutorials: there are 3 tutorial sections 
=========

 -----------------------------
| Time              |  Place    |
 -----------------------------
| Thu  9:00--10:00  |  (R3231)  |
| Fri 12:00--13:00  |  (R3011)  |
| Fri 13:00--14:00  |  (R4226)  |
 -----------------------------

Office hours: 
==========

Lecturer:  Mon and Wed 10:00--11:00 in S-626A.
========

Tutor:     Mon 12:00-13:00, Fri 9:00-10:00 in S627C.
=====


Textbook: 
========

M.J. Zoellick and B. Folk "File Structures",
second edition, Addison Wesley, 1992.


C programming language book: 
===========================

K.N. King, "C programming: a modern approach",
Addison Wesley, 1996.


Other texts for consult: 
=======================

B.W. Kernighan and D.M. Ritchie, "The C 
programming language", 2nd ed., Prentice-Hall, 1988.

P.D. Smith and G.M. Barnes, "Files and databases: 
an introduction", Addison-Wesley, 1987.


Course goals (from the academic calendar): 
=========================================

An introduction to techniques for storing, accessing and managing long-term
data in computer systems. Hardware and software aspects of data processing:
processors, storage devices, communications, file I/O control. Techniques
for organizing and managing files: serial files, direct files, indexed
files, multikey files, integrated files, file systems. Introduction to data
base management systems with emphasis on relational data base systems.


Course Outline (tentative): 
==========================

 --------------------------------------------------
| Topic                                |  Weeks    |
 --------------------------------------------------
| Introduction, C Programing Language  |    2      |
| File structures concepts             |    2      |
| Cosequential processing              |    1      |
| Indexes                              |    2      |
| B-Trees                              |    2      |
| Hashing                              |    2      |
| Introduction to database             |    2      |
 --------------------------------------------------


Marking Scheme: 
==============

3 Assignments at 15% each      45%
1 Term Test at 20%             20%
Final Exam at 35%              35%
                              ----
                              100%

There will be electronic submission of assignments. The 
first and second assignments are individual. The third 
one can be done in groups of at most 2 persons. To pass 
the course, you must receive at least 35/100 on either 
the final exam or the term test. 


Additional material will be taught in the tutorials. 
You are expected to know this material. Graded 
assignments and test will be handed back by the tutor.
See the webpage of the course for the policies on 
plagiarism and lateness. 

Web page: 

http://www.cs.toronto.edu/~daniel/teaching/B28/index.html

 
Schedule: 
========

First lecture - Sep 14

 ---------------------------------------
| Assignment | Hand-out Date | Due Date |
 ---------------------------------------
|    1       |   Sep 30      |  Oct 21  |
|    2       |   Oct 28      |  Nov 18  |
|    3       |   Nov 18      |  Dec  9  |
 ---------------------------------------


Midterm tests - October 28 (11:10 in lecture)

Last date to drop -  November 6

Last lecture - December 9

Final exam - December 14-22, 1998.