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

Massive Open Online Course
  • Overview
  • Course Content
  • Requirements & Materials
Overview

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

Course Description

This Data Structures & Algorithms course completes the data structures portion presented in the sequence of courses with self-balancing AVL and (2-4) trees. It also begins the algorithm portion in the sequence of courses as you will investigate and explore the two more complex data structures: AVL and (2-4) trees. Both of these data structures focus on self-balancing techniques that will ensure all operations are O(log n). Time complexity is threaded throughout the course within all the data structures and algorithms and a short Java review is presented on topics relevant to new data structures covered in this course. The course does require prior knowledge of Java, object-oriented programming, and linear and nonlinear data structures.

Course Content

AVL TREES

(2-4) TREES

ITERATIVE SORTING ALGORITHMS

DIVIDE & CONQUER SORTING ALGORITHMS

Requirements & Materials

Prerequisites

Recommended

  • Basic knowledge of the Java programming language, object-oriented principles, and the following abstract data types: Binary Search Trees, Heaps, and Hashmaps.

Materials

Required

  • Internet connection (DSL, LAN, or cable connection desirable)

Who Should Attend

This course is designed for anyone who wants to learn more complex tree data structures, AVL and (2-4) trees; investigate the balancing techniques found in both tree types; implement these techniques in AVL operations; or explore sorting algorithms with simple iterative sorts, followed by Divide and Conquer algorithms. You will use the course visualizations to understand the performance. 

Adult professional learning on a laptop

What You Will Learn

  • Java programming skills by implementing AVLs and sorting algorithms
  • Study techniques for restoring balance in AVL and (2-4) trees
  • When to apply single and double rotations in AVLs
  • Complex (2-4) trees that exhibit underflow and overflow problems
  • The appropriate use of promotion, transfer, and fusion in (2-4) trees
  • The time complexity for the AVLs, (2-4) Trees, and sorting algorithms
Female professional in computer science lab looking at tablet

How You Will Benefit

  • Implement basic iterative sorting algorithms: Bubble, Insertion, and Selection.
  • Explore optimizations to improve efficiency, including Cocktail Shaker Sort.
  • Contemplate two Divide & Conquer comparison sorting algorithms Merge and Quick Sort.
  • Consider one non-comparison Divide & Conquer algorithm: LSD Radix Sort.
  • Analyze the stability, memory usage, and adaptations of all sorting algorithms presented.
  • Taught by Experts in the Field icon
    Taught by Experts in the Field
  • Grow Your Professional Network icon
    Grow Your Professional Network
Global Learning Icon - White section icon

Want to see all Massive Open Online Courses?

The course schedule was well-structured with a mix of lectures, class discussions, and hands-on exercises led by knowledgeable and engaging instructors.

- Abe Kani
President

TRAIN AT YOUR LOCATION

We enable employers to provide specialized, on-location training on their own timetables. Our world-renowned experts can create unique content that meets your employees' specific needs. We also have the ability to deliver courses via web conferencing or on-demand online videos. For 15 or more students, it is more cost-effective for us to come to you.

  • Save Money
  • Flexible Schedule
  • Group Training
  • Customize Content
  • On-Site Training
  • Earn a Certificate
Learn More

Want to learn more about this course?