Mary Hudachek-Buswell

Mary Hudachek-Buswell is a Lecturer in Georgia Tech's College of Computing. Her current research interests are in-person, online, and large scale computing education courses, and changing approaches to computer science instruction. With changes in technology, her focus is on how to bring visual aids in to play with learning in order to connect the computing topics with students. Dr. HB’s work examines both synchronous, asynchronous, and real-time instruction to facilitate learning in the different student communities in large courses. She has taught a wide variety of courses: CS3311/3312 Junior Design Project Sequence, CS2316 Data Input and Manipulation, CS1332 Data Structures & Algorithms, and CS1371 Computing for Engineers. Dr. HB has won several awards for her teaching, most recently Georgia Tech’s Undergraduate Educator Award – 2020, Georgia Tech’s Education Partnership Award – 2019, and the College of Computing’s William D. "Bill" Leahy Jr. Outstanding Instructor Award – 2019.

Filter Courses within "Mary Hudachek-Buswell" (Click to filter)
Reset Filters | Advanced Global Search
Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues (edX) EdX
Georgia Institute of Technology,GTx

Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues (edX)

CS: Programming Computer Science

Dive into the core concepts of data storage and manipulation with our Data Structures & Algorithms I course. This edX offering provides a hands-on approach to learning about Arrays, ArrayLists, LinkedLists, Stacks, and Queues. Through engaging visualizations and practical exercises, you'll gain a deep understanding of how these structures work, their performance characteristics, and how to implement them effectively.

Self Paced
Self-Paced
Algorithms Data Structures Java Programming
Details
Data Structures & Algorithms II: Binary Trees, Heaps, SkipLists and HashMaps (edX) EdX
Georgia Institute of Technology,GTx

Data Structures & Algorithms II: Binary Trees, Heaps, SkipLists and HashMaps (edX)

Computer Science

Dive deep into the world of complex data structures with our Data Structures & Algorithms II course. Learn about Binary Trees, Heaps, SkipLists, and HashMaps to enhance your programming skills and understand how to efficiently manage large datasets. This course is designed for those who want to take their knowledge beyond basic algorithms.

Self Paced
Self-Paced
Algorithms Data Structures BST
Details
Data Structures & Algorithms III: AVL and 2-4 Trees, Divide and Conquer Algorithms (edX) EdX
Georgia Institute of Technology,GTx

Data Structures & Algorithms III: AVL and 2-4 Trees, Divide and Conquer Algorithms (edX)

Computer Science

Expand your knowledge of complex tree data structures with this course on AVL and (2-4) trees. Learn how to balance these intricate structures and implement effective operations. Delve into the world of Divide and Conquer algorithms, starting from simple iterative sorts and progressing to more sophisticated techniques that enhance efficiency in sorting tasks.

Self Paced
Self-Paced
Algorithms Data Structures Selection
Details
Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms (edX) EdX
Georgia Institute of Technology,GTx

Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms (edX)

Computer Science

Dive deep into advanced algorithms with this specialized course on edX. From pattern matching to graph theory, learn essential techniques like KMP, Rabin-Karp, Dijkstra’s Shortest Path, Minimum Spanning Tree (MST) construction, and Dynamic Programming. Enhance your problem-solving skills with practical examples and visualizations.

Self Paced
Self-Paced
Algorithms Data Structures Dynamic Programming
Details
Page 1