Data Structures & Algorithms in Java

Overview

What you'll learn

• Data Structures Basics
• Importance of Data Structures
• Algorithms Introduction
• Time Complexity
• Recursion Fundamentals
• Recursive Functions
• Recursive Trees
• Tower of Hanoi
• Sorting Algorithms
• Bubble Sort
• Quick Sort
• Merge Sort

Syllabus 21

1. What is Data Structure?

   A data structure is a method of arranging data to be used effectively. This module focuses on introducing you to Data Structures.

2. Importance of Data Structure

   Data Structures are the backbone of any programming language. This module explains the significance of Data Structures.

3. Introduction to Algorithm

   This module introduces you to the algorithm and its role in coding.

4. Time Complexity

   Time Complexity represents the number of times a statement gets executed. This module explains time and space complexity, and you will learn to find algorithms' time and space complexity.

5. Additional Example of Time Complexity

   This module gives you a better understanding of time complexity with the help of the code example.

6. Importance of Recursion

   This module explains the importance of recursion in programming languages.

7. What is Recursion?

   Recursion is a technique in which a function calls itself one or more times in its code. This module helps you understand recursion in detail.

8. Example of Recursion

   Examples are the best way to understand any concept. Thus, this module consists of examples of recursion that will help you understand it better.

9. Steps to Create Recursive Function

   To learn and execute recursion, you must be thorough with the steps involved. This module addresses the steps involved in creating recursive functions.

10. Recursive Function Examples

    This module has examples of recursion that explains termination condition, business logic, and the recursive call steps to help you understand recursion better.

11. Recursion in Tree

    This module explains what recursion is and how it works in the context of a tree.

12. Internal Mechanism of Recursion

    It is essential to understand the internal mechanism of recursion as it is one of the significant concepts of programming languages. This module focuses on the internal mechanism of recursion and explains it with the help of a stack example.

13. Assignment Solutions

    This module contains solutions for the various recursion problems that address their time complexity.

14. Tower of Hanoi

    Tower of Hanoi is a mathematical puzzle or a game that will help you understand the stack and recursion concept. This module aims at familiarizing you with the recursion through the Tower of Hanoi concept.

15. Tower of Hanoi Example

    This module helps you understand the Tower of Hanoi concept better by explaining the concept with the help of an example.

16. Need for Sorting Algorithm

    Sorting algorithms are considered a significant part of programming. Before getting started with sorting algorithms, it is crucial to understand their need and this module focuses on addressing their importance.

17. Types of Sorting Algorithm

    This module familiarizes you with the various types of sorting algorithms present.

18. Bubble Sort

    Bubble sort is a simple sorting algorithm that repeatedly steps through the list to be sorted. This module explains bubble sort and its algorithm in detail.

19. Quick Sort

    Quick sort is a sorting algorithm that uses a partitioning step to divide an array into subarrays, followed by a sorting step to sort the subarrays. This module explains the quick sort, time complexity, and algorithm with an example and demonstration.

20. Merge Sort

    A merge sort is a sorting algorithm that sorts items by dividing them into two groups, sorting each group, and then merging the groups back together. This module explains the merge sort, time complexity, and algorithm with an example and demonstration.

21. Insertion Sort

    Insertion sort is a sorting algorithm in which each element is inserted into its correct position in a sorted array. This module explains insertion sort, time complexity, and algorithm with an example and demonstration.

Advantages and disadvantages

Some points apply to every course of this kind; see how we rank.