Home    Course Archive    My YouTube playlists    Video/Audio Library     Papers Archive    CV    My Keeper Shelf    Cultural References in Class Quotes

smh: COSC 311 Algorithms and Data Structures
FALL 2018

0. Basics
  1. Required Textbook:
    Goodrich, Tammasia, Goldwasser; Data Structures & Algorithms in Java, 6th edition
    Any format is fine. eText format is approximately $44.00
    Student Companion Site

  2. Do you need an alternative explanation of some data structures?
    The following book is ridiculously easy to read, but has incomplete coverage of algorithm analysis and advanced topics. It is inexpensive and well-written.
    Lafore, Data Structures and Algorithms in Java, 2nd Ed, Sams Publishing, 2002, ISBN-10: 0672324539.

  3. Do you need some extra help in Java? Suggestions:

  4. Language of Implementation: Java. All code will be in Java. We are a Java shop, for better or worse. Your code will be in Java.

  5. Syllabus

  6. Office Hours: T R 2:30 - 5:00 pm


1. Lectures
Date Topic Read
12/18 Final Exam: Topics
12/11 Review Huffman code, trie
Prefix sums algorithms
12/6 topological sort video
graph search video
12/4 Trie GTG: 13.3
11/29 priority queue redux and quiz
Huffman code 		GTG: 9.3.1, 9.3.2
13.4
11/27 Priority queue GTG: 9.1, 9.3.1, 9.3.2
11/20 Hourly#2 (see below for uploaded test)
11/15 Sort: Quick sort (12.2)
Radix sort (12.3.2)
Counting sort
Bogo Sort		 Quick sort (GTG 12.2),
Radix sort (GTG 12.3.2)
Counting sort
Bogosort
11/13 Skip list
Sort: Merge-sort 		GTG: (skip-list) 10.4
GTG: (merge sort) 12.1
11/8 quiz on (2, 3, 4) tree insert
Hashing recap
Bloom filter

Bloom Filter By example
11/6 2, 3, 4 tree (insert, find, delete)
Hashing 		GTG: 11.5
GTG: 10.2
10/25 HOURLY #1
10/23 Intro to splay trees Splay tree operations
Hourly #1 Review 		GTG 11.4
10/18 AVL rotations GTG: 11.3
10/16 BST: insert, delete
10/11 Tree traversals
Insert to BST 		GTG: 8.4, 11.1
10/9/2018 Quiz on postfix, infix, prefix, expression tree
General tree definitions and properties, depth & height
Binary tree definition and properties		 GTG: 8.1, 8.2
10/4 Stack algorithms: parameter matching, evaluate postfix, infix -> postfix Infix, Post, Prefix, Expression Tree Examples
10/01 More stack algorithms Postfix-Infix Practice
9/27 A second pass at quiz on tracing recursion
Stacks
More stack algorithms 		GTG 6.1
9/25 Reviewing recursion
Queue: singly linked list, circular queue 		GTG: 6.2
9/20 More recursion examples More recursion examples
GTG 5.1, 5.2, 5.3
9/18 More counting
Beginning recursion 		https://emunix.emich.edu/~haynes/Papers/Recursion/recursion.html
9/13 Simple counting GTG 4.1 - 4.3
9/11 Intro to running time analysis
A simple bubblesort to play around with timing and debugging: bubblesort		 GTG 4.1 (pp 150 - 153)
GTG all of GTG 4.1 and 4.2
9/6 Course overview Read Chapter 1


2. Homework
Identifier Distributed Due Description
hw1129: priority queue 11/29 12/11 Validate a priority queue
hw1108: Hashing 11/8 11/15 Simple hashing with linear probe. Rehashing
pp1016: Programming Project 10/16 11/1 Simulation of two queues/two servers: should I switch?
hw1011 10/11 10/18 Simple use of queue
hw0927 9/27 10/4 10/9 Testing circular queue
hw0913 9/13 9/20 9/25 GTG p 182: R-4.2, R-4.3, R-4.8, R-4.9, R-4.10, R-4.11
hw0911.txt 9/11 9/18 Singly linked list
hw0906.txt 9/6 9/11 Repeat a 1D int array


4. Quizzes and Tests Resources

Possibly useful papers


Code snippets
Last changed: