Csci 2111: Data and File Structures Week4, Lectures 1 & 2

1/31/00


Click here to start


Table of Contents

Csci 2111: Data and File Structures Week4, Lectures 1 & 2

Overview

Outline

Data Compression I: An Overview

Data Compression II: Using a Different Notation => Redundancy Compression

Data Compression II: Suppressing Repeating Sequences ==> Redundancy Compression

Data Compression III: Assigning Variable-Length Code

Data Compression IV: Irreversible Compression Techniques

Data Compression V: Compression in Unix I: Huffman Coding (pack and unpack)

Constructing Huffman Codes (A FOREST is a collection of TREES; each TREE has a root and a weight)

Data Compression VI: Compression in Unix II: Lempel-Ziv (compress and uncompress)

Constructing Lempel-Ziv Codes

Reclaiming Space in Files I: Record Deletion and Storage Compaction

Reclaiming Space in Files II: Deleting Fixed-Length Records for Reclaiming Space Dynamically

Reclaiming Space in Files III: Deleting Variable-Length Records for Reclaiming Space Dynamically

Reclaiming Space in Files IV: Storage Fragmentation

Reclaiming Space in Files V: Placement Strategies I

Reclaiming Space in Files V: Placement Strategies II

Finding Things Quickly I: Overview I

Finding things Quickly II: Overview II

Finding things Quickly III: Binary Search

Finding things Quickly IV: Binary Search versus Sequential Search

Finding things Quickly V: Sorting a Disk File in Memory

Finding things Quickly VI: The limitations of Binary Search and Internal Sorting

Finding things Quickly VII: KeySorting

Finding things Quickly VIII: Limitation of the KeySort Method

Finding things Quickly IX: Pinned Records

Author: N & N

Email: nat@cs.dal.ca

Home Page: http://borg.cs.dal.ca/~nat