back to CSI 2131 home

Lecture Contents

Tentative Schedule of Lectures:
 
 
1) Jan 5 Introduction to File Management Ch 1.1,1.2,handout
2) Jan 10 Fundamental File Structures Operations Ch 2
3) Jan 12 Managing Files of Records Ch 4.1, 5.1, 2.5
4) Jan 17 Secondary Storage Devices: Magnetic Disks Ch. 3.1
5) Jan 19 Secondary Storage Devices: Magnetic Tapes and CD-ROMs Ch: 3.2,3.5,3.6
6) Jan 24 A journey of a byte and Buffering Ch. 3.8, 3.9
7) Jan 26 Data Compression: Part I Ch. 6.2, Class notes on Huffman code
8) Jan 31 Data Compression: Part II Class notes on Lempel-Ziv code
9) Feb 2 Reclaiming space in files Ch. 6.2
10) Feb 7
Review before midterm test

11) Feb 9
Binary Searching, Keysorting and Indexing Ch.6.3.1-6.3.3,6.4,7.1-7.3
12) Feb 16
 Indexing Ch. 7.4-7.6, 7.7-7.10
Feb 21-25 Study break
-
13) Feb 28 Co-sequential Processing
Ch 8.1, 8.2
14) Mar 2
Co-sequential Processing: sorting large files Ch. 8.3, 8.5 (up to 8.5.3)
15) Mar 7 Hashing I Ch. 11.1,11.2,11.3,11.5
16) Mar 9
Hashing II Ch 11.3,11.4,11.6
17) Mar  14 Hashing III Ch. 11.7, 11.8, 11.9
18) Mar 16 Extendible Hashing I Ch. 12.1, 12.2, (12.3 overview only) 
19) Mar 21 Extendible Hashing II Ch. 12.4, 12.5
20) Mar 23 B trees I Ch. 9.1-9.6
Mar 28 Easter break
21) Mar 30 B trees II Ch. 9.8-9.12
22) Apr 4
B+ trees I Ch. 10.1-10.5
23) Apr 6
B+ trees II Ch. 10.6,10.7 (10.8-10.11 overview only)
24) Apr 11
Practice with B trees and B+ trees; course overview. -