Welcome to MATH 8650: Advanced Data Structures (Fall 2016)

Instructor: Dr. Timo Heister, heister@clemson.edu, http://www.math.clemson.edu/~heister/

Meeting time: Tue/Thu 2:00pm-3:15pm, Martin M204

Please contact me via email for questions, appointments, etc..

Course Description

This course is designed to introduce students to advanced data structures and algorithms from computer science. The goal is to provide a solid foundation for sophisticated software development, research in computational mathematics, and other computational problems.

We will be using the Python programming language for weekly exercises and larger group projects.

Handouts and Resources

  1. This site: http://www.math.clemson.edu/~heister/math8650-fall2016/
  2. Blackboard: http://bb.clemson.edu (grades, materials, etc.)
  3. No required textbox. Reading material will be supplied.
  4. Syllabus


  1. 2016-08-18 Thu:
    • introduction
    • syllabus
    • outline of the class
    • python intro (intro.pdf)
  2. 2016-08-23 Tue:
  3. 2016-08-25 Thu:
    • binary search
    • sorting (insertion sort, merge sort)
  4. 2016-08-30 Tue:
    • divide and conquer and complexity
    • summary about sorting algorithms, optimal complexity, merge sort
    • Abstract Data Types, mathematical definition
    • Stacks and stack implementations (linked list, array, …)
    • Python List and resizing strategy: source code
    • Python sorting (Timsort): description
  5. 2016-09-01 Thu:
  6. 2016-09-06 Tue:
    • deque implementations: circular array, linked blocks
    • Python implementation: linked blocks
    • work on HW04
  7. 2016-09-08 Thu:

Class Schedule

Date: 2016-09-08 15:23:07 EDT

HTML generated by org-mode 6.33x in emacs 23