Data Structures and Algorithms for Efficient Programs

Python Dynamic Programming, Queue, Binary Search Tree


Instructor: Yang Liu

Time: Wednesday, February 20, 9:00am - 4:00pm

Location: Interdisciplinary Life Science Building (ILSB), Room 3143 (9am - 1pm) and 3147 (1pm - 4pm)

The workshop will help students and researchers who seek program performance. The workshop will cover time complexity analysis, fundamental data structures, and important techniques for algorithm design. Theoretical concepts will be studied through hands-on python programs.

Bring your own laptop for the workshop. Seats are limited to 20. Pizza will be served.

Note: If you cannot attend the workshop due to a scheduling conflict or have any questions, please contact Dr. Yang Liu at


  • Morning session (9:00 am - 12:00 pm with 10 minute break at ~10:30 am)
    • Complexity and Big-O
    • Stack
    • Queue
    • Heap
    • Dictionary
    • Binary Search Tree
  • Lunch Break (12:00 pm - 12:40 pm)
  • Afternoon session (1:00 - 4:00pm with 10 minute break at ~2:30 pm)
    • Divide and Conquer
    • Greedy Algorithms
    • Dynamic Programming

Note: During the class sessions many aspects of the material will be illustrated live via a login to Attendees are welcome to follow these parts with their own laptops. They will need to configure their laptops to use the TAMULink wireless network. Relevant details on this can be found at: