TUTORIALS -- CSC228 H (Summer 2000)
I will do my best to post all the tutorials on this page every Friday
following the Thursday tutorials. These document are in PS format.
Please let me know of any incovenience with this format. Generally,
the programs will be selfexplanatory; however, if anybody wishes to have
further comments on them, just let mo know!
Tutorials
- Tutorial 1
(June 1, 2000): Compiling and linking C++ programs using g++; sample file
reader programs.
- Tutorial 2:
(June 8, 2000) Questions about the assignment 2; Using argc / argv;
Merging transaction files and processing the master file with the merged transaction file.
- Tutorial 3:
(June 15, 2000) Functions for direct file access in C++; Relative record number vs. offset;
examples.
- Tutorial 4:
(June 22, 2000) Function Templates; Template Classes; and Case Study (kindly given by M. Chechik).
- Tutorial 5:
(June 29, 2000) Simple hashing; example.
Note: I fear there will be no on line material until monday; reason: I got sick of
today's italian victory in Euro 2000 :-((.
Note (30/06/00): I promised to post a sample code for hashing. It turns out that Appendix J
on extensible hashing illustrates what you need for solving Assignment 3.
- Tutorial 6:
(July 6, 2000) UNIX file system.
Note: Please always let me know when I forget to post announced tutorial notes !
- Tutorial 7:
(July 20, 2000) B-trees; inserting into and deleting from B-trees; high-level overview of how
the B-tree index fits in with a hashed master file.
- Tutorial 8:
(July 27, 2000) Relational algebra; basic operations with emphasis on join and projection
operations; examples. Please consult Chapter on "Relational Algebra" in Raghu Ramakrishanan's
book to reread the examples I used in the tutorial.
- Tutorial 9:
(August 3, 2000) Solving problems from recent, old final exams.
NOTE: I promised to look for a gut example of help in B-tree implementation. However, the one
Appendix I is showing you the way. Among critical issues are, I think:
- How to design the interface between a B-tree node element and the hashed master file ?
- How to design the a B-tree node ? Thinks of how data are to be organized on the node.
- How to stoe the Btree into a file ?
Further Documents