CS 3050, Spring
2007
Class Schedule, Lecture Notes
Note: Schedule is subject to change,
please
check frequently
|
WK |
Class/Date |
Topic
|
Book Chapter |
Assignments
|
Reading
|
|
1 |
W 2/14 |
Introduction |
1 |
Syllabus |
|
|
F 2/16 |
Introduction and File Operations |
1, 2 |
Homework 1
assigned Lab1 Assigned |
Chapter 1 |
|
|
2 |
M 2/19 |
Physical and Logical Files |
2 |
Chapter 2 |
|
|
W 2/21 |
File Operations |
2 |
Chapter 2 | ||
|
F 2/23 |
C++ and Lab 1, seek |
2 |
Homework 1 due |
Chapter 3 | |
|
3 |
M 2/26 |
Disks |
3 |
Chapter 3 | |
|
W 2/28 |
Disks |
3 |
Lab 1 due, Homework 2
assigned |
Chapter 3 | |
|
F 3/2 |
Disks |
3 |
Chapter 3 | ||
|
4 |
M 3/5 |
Disks |
3 |
Homework 2 Due |
Chapter 3 |
|
W 3/7 |
Tape (slides) |
3 |
Lab 2 Assigned, Homework 3 Assigned |
Chapter 3 | |
|
F 3/9 |
CDs |
3 |
Chapter 3 | ||
|
5 |
M 3/12 |
CDs |
3 |
Chapter 3 | |
|
W 3/14 |
Journey of a Byte,
Buffer Mgmt |
3 |
Homework
3 Due |
Chapter 3 | |
|
F 3/16 |
Field Organization |
4 |
Chapter 4 |
||
|
6 |
M 3/19 |
Go over homework |
1-3 |
||
|
W 3/21 |
Quiz on Chapters 1-3 (review) |
||||
|
F 3/23 |
Record Organization |
4 |
Chapter 4 | ||
|
7 |
M 3/26 |
Indexes, Lab 2 |
4 |
|
Chapter 4 |
|
W 3/28 |
Lab 2, Length
Indicators, Classes and Buffers |
4 |
|
Chapter 4 | |
|
F 3/30 |
School Holiday | ||||
|
8 |
M 4/2 |
Hex Dump |
4 |
Lab 2 Due, Homework 4 Assigned | Chapter 4 |
|
W 4/4 |
Record Access
(slides) |
5 |
Lab 3
Assigned |
Chapter 5 |
|
|
F 4/6 |
Finish Chapter 5 |
5 |
Homework 4 Due |
Chapter 5 |
|
| SPRING BREAK: April
9-13 |
|||||
|
9 |
M 4/16 |
Data Compression |
6 |
Chapter 6 |
|
|
W 4/18 |
Quiz on Chapters 4 and 5
(review) |
4, 5 |
|||
|
F 4/20 |
Reclaiming Space in Files |
6.1 |
Chapter 6 |
||
|
|
|
Finding Things Quickly | 6.1, 6.2 |
Lab 3 Due | Chapter 6 |
|
W 4/25 |
Keysort | 6.4 |
Lab
4 Assigned |
Chapter 6 | |
|
F 4/27 |
Indexes |
7.1-7.5 |
Binary
Search Algorithm |
Chapter 7 |
|
|
11 |
|
Indexes |
Chapter 7 |
||
|
W 5/2 |
Cosequential Processing Multiway Merging |
8.1, 8.3 |
Lab
4 Due |
Chapter 8 |
|
|
F 5/4 |
Quiz on Chapters 6 and 7 (review) |
Lab 5
Assigned |
|||
|
12 |
|
Merging as a way of sorting large files on disk | 8.5 |
Chapter 8 | |
|
W 5/9 |
Indexing with Binary Search Trees | 9.1, 9.2, 9.4 | Chapter 9 | ||
|
F 5/11 |
BST, AVL Trees, and B-trees | 9.3, 9.5 | Homework 5
Assigned |
Chapter 9 | |
|
13 |
|
B-Trees |
9.5-9.12 | Chapter 9 |
|
|
W 5/16 |
B-Trees | 9.5-9.12 | Lab 5 Due |
Chapter 9 | |
|
F 5/18 |
B-Trees | 9.5-9.12 | Chapter 9 | ||
|
14 |
|
B-Trees |
9.13-9.15 |
Homework 5 Due |
Chapter 9 |
|
T 5/22 |
Reading Day | ||||
| W 5/23 |
|
9.13-9.15 | Chapter 9 | ||
| |
Thursday 5/31 |
|
Quiz on Chapters 8, 9 (review) |