Course Home
    Announcements
    Syllabus
    Course Policies
    Course Schedule/Notes
    Discussion
    Projects
    Project Submission
    Sample Tests
    Test Solutions
    Grades
    Re-Grade Form
    Resources

COP 3530: Data Structures and Algorithms

Discussion Section
Discussion Contact: John Quarles

The discussion sections will address problems students have with the lecture material and/or assignments. Once these problems have been addressed, the remaining time in a discussion section meeting will be used to solve problems from the text. The specific problems addressed in the discussion sections are given below (by week).

Date Topics
May 16 Questions about Project 0
Java Download and Installation
Course Source Code Download and Setup
Review of Java Packages including Compilation and Execution
Review of Asymptotic Notation
May 23 Problem 5.19 (Linear List Left Shift)
Problem 5.20 (Linear List Circular Shift)
May 30 Problem 6.11 (In-place Chain Reversal)
Problem 6.14 (Chain Meld)
June 6 Problem 8.6 (K-Dimensional Array Mapping)
Problem 8.45 (Sparse Matrix Multiplication)
Problem 9.20 (Towers of Hanoi Variation)
June 13 Problem 11.23 (Hash Function Selection)
Problem 11.24 (Hash Function Selection)
Problem 11.40 (LZW Compression)
June 20 Problem 12.16 (Tree Reconstruction)
Problem 12.18 (Tree Reconstruction)
Problem 12.31 (Iterative Preorder Traversal)
Problem 12.47 (Linked Binary Tree Iterator)
June 27 NO DISCUSSION - Summer Break
July 4 NO DISCUSSION - Fourth of July
July 11 Problem 17.16 (Graph Representation)
Problem 17.41 (BFS)
July 18 Problem 18.12 (Stack Folding)
Problem 18.26 (Graph Coloring)
July 25 Problem 19.16 (Natural Merge Sort)
Problem 19.20 (Pivoting)
Problem 19.30 (Partitioning)
August 1 Problem 20.5 (0/1/2 Knapsack Problem)
Problem 20.20 (Longest Common Subsequence)
August 8 NO DISCUSSION - Discussion Cancelled


Christian Roberson 2005-2006