RiseUpp Logo
Educator Logo

Advanced Data Structures and Algorithms - part 3

Master advanced tree structures and sorting algorithms with AVL trees, 2-4 trees, and divide-and-conquer methods in this 5-week course.

Master advanced tree structures and sorting algorithms with AVL trees, 2-4 trees, and divide-and-conquer methods in this 5-week course.

This advanced course explores complex data structures and algorithms, focusing on self-balancing trees and efficient sorting methods. Students learn AVL and 2-4 tree implementations, study various balancing techniques, and master both iterative and divide-and-conquer sorting algorithms. The course emphasizes practical implementation in Java while analyzing time complexity and performance optimization.

5,342 already enrolled

English

English

Powered by

Provider Logo
Advanced Data Structures and Algorithms - part 3

This course includes

5 Weeks

Of Self-paced video lessons

Intermediate Level

Completion Certificate

awarded on course completion

16,148

Audit For Free

What you'll learn

  • Implement AVL trees with proper balancing techniques

  • Master 2-4 tree operations and handle overflow/underflow cases

  • Develop efficient sorting algorithms using iterative and divide-and-conquer approaches

  • Analyze algorithm stability, memory usage, and time complexity

  • Optimize sorting implementations for better performance

  • Implement complex tree rotations and balancing operations

Skills you'll gain

data structures
algorithms
AVL trees
2-4 trees
sorting algorithms
Java programming
time complexity
divide and conquer

This course includes:

PreRecorded video

Graded assignments, Labs, Course exam

Access on Mobile, Tablet, Desktop

Limited Access access

Shareable certificate

Closed caption

Get a Completion Certificate

Share your certificate with prospective employers and your professional network on LinkedIn.

Certificate

Top companies offer this course to their employees

Top companies provide this course to enhance their employees' skills, ensuring they excel in handling complex projects and drive organizational success.

icon-0icon-1icon-2icon-3icon-4

There are 5 modules in this course

The course provides comprehensive coverage of advanced data structures and algorithms, focusing on self-balancing trees and efficient sorting techniques. The curriculum includes detailed exploration of AVL and 2-4 trees, implementation of various sorting algorithms including bubble sort, merge sort, and quick sort, and analysis of algorithm efficiency. Students work with interactive visualization tools and complete hands-on programming assignments to reinforce concepts.

Introduction and Review

Module 1

AVL Trees

Module 2

(2-4) Trees

Module 3

Iterative Sorting Algorithms

Module 4

Divide & Conquer Sorting Algorithms

Module 5

Fee Structure

Payment options

Financial Aid

Instructor

A Distinguished Leader in Computer Science Education and Innovation

Mary Hudachek-Buswell serves as Associate Chair and Senior Lecturer in the School of Computing Instruction at Georgia Institute of Technology, where she has established herself as a pioneering educator in computer science. After completing degrees in Mathematics from the University of Mary Washington and Auburn University, followed by an MS and PhD in Computer Science from Georgia State University, she has transformed computing education through innovative teaching approaches. Her expertise spans both traditional and online education, particularly in data structures and algorithms, where she developed an acclaimed online course featuring 117 instructional videos and the innovative csvistool visualization platform. Her teaching excellence has been recognized through numerous accolades, including Georgia Tech's Undergraduate Educator Award (2020), Education Partnership Award (2019), the College of Computing's William D. "Bill" Leahy Jr. Outstanding Instructor Award (2019), and most recently, the prestigious Geoffrey G. Eichholz Faculty Teaching Award. Her research focuses on enhancing computing education through visual aids and adaptive teaching methodologies across synchronous, asynchronous, and real-time instruction formats. She has taught a diverse range of courses including the Junior Design Project Sequence, Data Input and Manipulation, Data Structures & Algorithms, and Computing for Engineers, while consistently innovating in educational technology and student engagement strategies. Beyond teaching, she has made significant contributions to the development of teaching assistant training programs and online learning tools, cementing her position as a transformative figure in computer science education.

Advanced Data Structures and Algorithms - part 3

This course includes

5 Weeks

Of Self-paced video lessons

Intermediate Level

Completion Certificate

awarded on course completion

16,148

Audit For Free

Testimonials

Testimonials and success stories are a testament to the quality of this program and its impact on your career and learning journey. Be the first to help others make an informed decision by sharing your review of the course.

Frequently asked questions

Below are some of the most commonly asked questions about this course. We aim to provide clear and concise answers to help you better understand the course content, structure, and any other relevant information. If you have any additional questions or if your question is not listed here, please don't hesitate to reach out to our support team for further assistance.