Very Tentative CS 3114 Calendar and Readings


Week

Date

Topic

Readings

Notes

Due Dates

 

1

 

May 24

Introduction

Binary Search Tree Definition

 

Course Policies

BST Overview

 

May 25

BST Theorems

Eclipse Overview

Weiss: 4.3

          

Theorems

Eclipse Overview

 

May 26

BST Implementation

 

Java Generics Overview (under construction)

Weiss: 4.4 - 4.5

 

BST Implementation

 

Java Generics

 

May 27 Algorithm Analysis   Alg Analysis  

May 28

Asymptotics Weiss: 2.1 - 2.4 Asymptotics Q1

 

2

 

May 31

Memorial Day      
June 1

PR Quadtree Operations

  PR Quadtree Concepts  

June 2

PR Quadtree Implementation Issues

Buffer Pools

 

PR Quadtree Implementation Issues

Buffer Pools

Q2

HW 1

June 3

File access: sequential and random

Secondary Storage

 

Java File I/O

Secondary Stg

 
June 4 Test 1      

 

3

 

June 7

Hash Tables

Weiss: 5.1, 5.3, 5.4

Hash Tables

Q3

BST Project

June 8 Hash Table continued      

June 9

Java equals() discussion

Hash Functions

 

Weiss: 5.2

Java equals()

Hash Functions

 

June 10

Other Hash Table Issues

Perfect Hash Functions

 

Other Issues

Perfect Hash Functions

Q4

June 11

AVL Trees

Weiss: 4.4

AVL Trees

Q5

HW 2

 

4

 

June 14

Design Discussion and GIS Discussion

 

OO Design

 

June 15

Project Discussions

 

 

Q6

BP Project

June 16

Skip lists Weiss: 10.4.2 Skip lists  
June 17 B Trees Weiss: 4.7 B trees Q7
June 18 B-Trees      

 

5

 

June 21

Graph Structures & Traversals

Weiss:  9.1

Graph Structures

Graph Traversals

 

June 22

Weighted Graphs

Weiss:  9.3

Weighted Graphs

Q8

Hash Project

June 23

Topological Ordering

Weiss: 9.2

Topo Ordering

 

June 24

Heaps Weiss: 6.3 Heaps

HW 3 (5 pm)

June 25

Test 2  summary

     

 

6

 

June 28

Sorting Weiss: 7.1, 7.2, 7.4-6, 7.7, 7.9 Sorting Algorithms

GIS Project

(June 27)

June 29 Sorting   Sorting Analysis  
June 30        
July 1        
July 2        

 

Exam

13:00 - 15:00 July 3  summary