HOME > Development > Data Structures and Algorithms in Java_1

Data Structures and Algorithms in Java_1

  • Development
  • May 08, 2025
SynopsisData Structures and Algorithms in Java, available at $19.99,...
Data Structures and Algorithms in Java_1  No.1

Data Structures and Algorithms in Java, available at $19.99, has an average rating of 4.4, with 45 lectures, 2 quizzes, based on 165 reviews, and has 8006 subscribers.

You will learn about Explain and Use Sorting Algorithms Construct Efficient Algorithms Explain and Use Data Structures Solve Problems Implement Data structures and Algorithms in Java This course is ideal for individuals who are Anyone who wants to improve their Problem Solving skills It is particularly useful for Anyone who wants to improve their Problem Solving skills.

Enroll now: Data Structures and Algorithms in Java

Summary

Title: Data Structures and Algorithms in Java

Price: $19.99

Average Rating: 4.4

Number of Lectures: 45

Number of Quizzes: 2

Number of Published Lectures: 39

Number of Published Quizzes: 2

Number of Curriculum Items: 47

Number of Published Curriculum Objects: 41

Original Price: $89.99

Quality Status: approved

Status: Live

What You Will Learn

  • Explain and Use Sorting Algorithms
  • Construct Efficient Algorithms
  • Explain and Use Data Structures
  • Solve Problems
  • Implement Data structures and Algorithms in Java
  • Who Should Attend

  • Anyone who wants to improve their Problem Solving skills
  • Target Audiences

  • Anyone who wants to improve their Problem Solving skills
  • This course will give you the ability to?solve problems, most people focus on the programming language, but people often forget about algorithms.

    Algorithms?are definitely more important than a programming language, you can learn a programming language in about week, but the problem-solving ability is much harder to learn. But the benefits are worth it.

    When you get to?interview?mostly they care about your?problem-solving abilities.

    To get your dream job, you need to know how to solve whatever problem they have. In this course, you will learn how to do that.

    Also, I believe that?nobody?has time for long and boring lectures, so in?this class, I?try to explain the?important things?in a?fast and engaging?way, so I won’t bore you to death.

    We start off with?Sorting algorithms, I explain each algorithm and then I show you implementation.

    After that we take a look at?Data Structures, I?choose In my opinion the best Structures for you to learn the important concepts.

    As a bonus, I go through the complex?problem-solving techniques.?And I?show you how these works on common examples such as?Knapsack?and?Minimum spanning tree.

    I believe that learning and understanding these concepts will?help you solve problems more efficiently.?

    Course Curriculum

    Chapter 1: Introduction

    Lecture 1: Introduction

    Lecture 2: Welcome

    Lecture 3: Say Hello

    Chapter 2: Sorting Algorithms

    Lecture 1: Problem definition

    Lecture 2: Selection Sort

    Lecture 3: CODE | Selection Sort

    Lecture 4: Bubble Sort

    Lecture 5: CODE | Bubble Sort

    Lecture 6: Recursion

    Lecture 7: CODE | Recursion

    Lecture 8: Merge Sort

    Lecture 9: CODE | Merge Sort

    Lecture 10: Quick Sort

    Lecture 11: CODE | Quick Sort

    Lecture 12: Comapring

    Lecture 13: CODE | Comparing

    Lecture 14: PRACTICE | Create Algorithms

    Chapter 3: Time Complexity

    Lecture 1: What is Time Complexity?

    Lecture 2: Big O Notation

    Chapter 4: Data Structures

    Lecture 1: Introduction

    Lecture 2: Binary search tree

    Lecture 3: CODE | Binary Search Tree

    Lecture 4: AVL tree

    Lecture 5: AVL tree (insertion)

    Lecture 6: AVL tree (deletion)

    Lecture 7: CODE | AVL tree

    Lecture 8: Linked List

    Lecture 9: CODE | Linked List

    Lecture 10: Trie

    Lecture 11: CODE | Trie

    Lecture 12: Hash Table

    Lecture 13: CODE | Hash Table

    Chapter 5: Problem solving techniques

    Lecture 1: Divide and Conquer

    Lecture 2: Dynamic Programing

    Lecture 3: Greedy approach

    Lecture 4: Backtracking

    Chapter 6: Complex Problems

    Lecture 1: 0-1 Knapsack problem

    Lecture 2: Kruskals algorithm

    Lecture 3: Dijkstras Shortest Path algorithm

    Instructors

  • Data Structures and Algorithms in Java_1  No.2
    Lukes Programming School
    Bestselling Instructor with over 150 000 Students
  • Rating Distribution

  • 1 stars: 6 votes
  • 2 stars: 3 votes
  • 3 stars: 23 votes
  • 4 stars: 49 votes
  • 5 stars: 84 votes
  • Frequently Asked Questions

    How long do I have access to the course materials?

    You can view and review the lecture materials indefinitely, like an on-demand channel.

    Can I take my courses with me wherever I go?

    Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!