COP 3530

Data Structures and Algorithms

University of Florida

Discussion Sections

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).

  1. Questions with respect to Assignment 0. Make sure everyone knows how to get access to a proper version of Java and can download, unzip, compile and run the Java codes from the text. Explain how packages work and how to compile and run codes that use packages.
  2. Do bubble sort. Describe the method and program. Analyze using comparison count, step count, and asymptotic analysis. Review big O notation.
  3. Problems 5.19 (brief, in 5 min) and 5.20 (three reverses).
  4. Problems 6.11 and 6.14.
  5. Example 7.7.
  6. Problems 10.15, 10.16.
  7. Problems 11.23 and 11.24.
  8. Problems 12.16 and 12.18.
  9. Problems 12.31 and 12.47.
  10. Problems 12.62 and 13.12.
  11. Bin packing, Section 14.5.
  12. Section 15.1.2 - removing an item given its index
  13. Problems 17.51 and 17.52.
  14. Problems 18.9 and 18.26.
  15. Problems 20.5 and 20.20.