CSCI 464, Section 2 - Spring 2006
Lecture Topics and Reading Assignments

(Last updated on March 28, 2007)

This schedule is subject to change, and therefore will remain:



Week Subject Reading Assignments Due
1 1/16 Overview
USING Tutorial
The Assembly Process
Notes: Syllabus
Notes: The USING Instruction: A Tutorial
Notes: Two-pass Assembler
2 1/23 Standard Linkage
External Symbols
ASSIST Replacement
High Level Assembler
Notes: Using ASSIST Replacement
Notes: Using the High Level Assembler
3 1/30 Introduction to Linear Lists
Stacks, Queues, Deques
Sequential Allocation: Stacks

TAoCP: §1.1; §2.1
TAoCP: §2.2.1
TAoCP: §2.2.2 to p. 246
No 1
4 2/6 Sequential Allocation: Queues
X-Macros
Program Structures
Bottom-driven Loops
Structured Programming Macros
TAoCP: §2.2.2 to p. 246
HLASM Toolkit User Guide: Chapter 2 - Using Structured Programming Macros
HLASM Toolkit Feature Overview: August 2003 SHARE Session 8183
5 2/13 Linked Allocation: Stacks & Queues
Circular Lists
TAoCP: §2.2.3
TAoCP: §2.2.4
No 2
6 2/20 Review for Exam 1
Exam 1
7 2/27 Doubly Linked Lists
Recursion and Reentrancy
TAoCP: §2.2.5 to p. 281
Notes: Recursion and Reentrancy
MVS Assembler Services Guide: Obtaining Storage Through the STORAGE Macro
MVS Assembler Services Reference: STORAGE Macro
No 3
8 3/6 Trees
Traversing Binary Trees
Threaded Binary Trees
TAoCP: §2.3
TAoCP: §2.3.1
3/13 Spring Break
9 3/20 Threaded Binary Trees
Binary Tree Representation
Sequential Searching
Binary Search
TAoCP: §2.3.1
TAoCP: §2.3.2 to p. 338
TAoCP: §6.1 to p. 399; Exercises 2 & 4, p. 405
TAoCP: §6.2.1
No 4
10 3/27 Big O Notation
Binary Tree Searching
Balanced Trees
TAoCP: §1.2.11.1 (optional)
TAoCP: §6.2.2 to p. 432
TAoCP: §6.2.3 to p. 464; 471 - end
11 4/3 Balanced Trees
Hash Coding and Searching
TAoCP: §6.2.3 to p. 464; 471 - end
TAoCP: §6.4 (pp. 513-517, 519-529, 533-534, 547-end)
No 5
12 4/10 Review for Exam 2
Exam 2
Logic for
No 6
13 4/17 Heapsort and Priority Queues
Quicksort
Notes: Heapsort and Priority Queues No 6
14 4/24 Insertion Sorts
Exchange Sorts
Selection Sorts
Merge Sorts
Multiway Trees
TAoCP: §5.2 and §5.2.1
TAoCP: §5.2.2
TAoCP: §5.2.3
TAoCP: §5.2.4
TAoCP: §6.2.4
15 5/1 B-Trees and B+-Trees
Review for Final Exam
Notes: B-Trees No 7
16 5/9 Comprehensive Final Exam


This page was last modified on Wednesday, March 28, 2007, at 08:08:45 PM GMT