Tom Lysaght's Homepage

CS211 DATA STRUCTURES AND ALGORITHMS II

2nd SCIENCE and HIGHER DIPLOMA IN INFORMATION TECHNOLOGY

SAMPLE EXAM QUESTIONS

Sample Exam Questions (HTML)

Sample Exam Questions (.doc)

OUTLINE SLIDES

Introduction- Postscript file.

Binary Trees - Postscript file.

Outline notes Binary Search Tree (postscript file)

Inheritance - Summary - Postscript file.

Binary Search Tree Traversals - Postscript file.

Huffman coding (Outline slides) - Postscript file.

Huffman coding - (Code outline slides) - Postscript file.

Height-Balanced Trees - (Code outline slides) - Postscript file.

Height-Balanced Trees - Example - Postscript file.

Height-Balanced Trees - Red-Black Trees- (outline slides) - Postscript file.

Red-Black Trees Simulation

Sorting- (outline slides) - Postscript file.

Complexity- (outline slides) - Postscript file.

LABORATORIES

LABORATORY 2 (Microsoft Word Document)

LABORATORY 2 (Text Document)

Sample solution to Laboratory2 (.txt file)

LABORATORY 3 (HTML Document)

Sample solution to Laboratory3 (.txt file)

LABORATORY 4 (HTML Document)

SAMPLE QUESTIONS FOR LABORATORY EXAM1

Class files for a Binary Tree. These files may give formatting errors when opened in notepad.
Alternatively save the files and open with Microsoft Word.

vehicle class and subclasses (.txt file)

Binary Search Tree (traversal and height methods) (.txt file)

BinarySearchTree.java (.txt file)

Huffman coding - Class Templates

Template Class Path (.txt file)

Template Class Forest(.txt file)

SAMPLE QUESTIONS FOR LABORATORY EXAM2

CODE FOR HUFFMAN ALGORITHM (Path, Forset, Huffman)

Class Path(.txt file)
Class Forest(.txt file)
Class Huffman(.txt file)