Advanced Algorithms in Java

Advanced Algorithms in Java, available at $64.99, has an average rating of 4.33, with 72 lectures, based on 464 reviews, and has 8402 subscribers.

You will learn about Have an understand of how algorithms work, at a deep level Write better Java code that is more optimised This course is ideal for individuals who are Students or Java developers who are ready to take the skills to the next level by learning complex algorithms and data structures. or Students or Java developers who want to understand algorithms at a deep level It is particularly useful for Students or Java developers who are ready to take the skills to the next level by learning complex algorithms and data structures. or Students or Java developers who want to understand algorithms at a deep level.

Enroll now: Advanced Algorithms in Java

Summary

Title: Advanced Algorithms in Java

Price: $64.99

Average Rating: 4.33

Number of Lectures: 72

Number of Published Lectures: 72

Number of Curriculum Items: 72

Number of Published Curriculum Objects: 72

Original Price: $69.99

Quality Status: approved

Status: Live

What You Will Learn

Have an understand of how algorithms work, at a deep level

Write better Java code that is more optimised

Who Should Attend

Students or Java developers who are ready to take the skills to the next level by learning complex algorithms and data structures.

Students or Java developers who want to understand algorithms at a deep level

Target Audiences

Students or Java developers who are ready to take the skills to the next level by learning complex algorithms and data structures.

Students or Java developers who want to understand algorithms at a deep level

Once you know the basics of Java, you will want to start figuring out Algorithms and Data structures.

Used correctly, your code will run faster, and use less memory, and be more stable, with the efficient use of the right Algorithms and data structures.

But the reverse is also true.?When used incorrectly, you can find your code consuming more memory and running slower!

Programmers who understand how to use and implement Algorithms and data structures correctly, are in high demand.??

Until now, acquiring the knowledge of how to do things the right way has been a painful process of learning by trial and error.

All that has changed with the release of this brand-new course – Advanced Algorithms in Java.

Marcos Costa, is an expert Java developer with 18 years of experience.??Early in his career he realised the importance of understanding algorithms at a deep level.

Soon he began to get noticed by his peers for his knowledge and rose to Tech Lead Engineer.

His skills took him to positions all over the world, including Australia and the USA where he now resides.

Now he created a course designed to help Java programmers to really understand algorithms at a deep level.

What will you learn in this course?

You’ll learn to become a better problem solver, by using better implementations and making better decisions with your coding.

Marcos will explain to you in an easy to follow and understandable way, how to implement a number of algorithms that you can put to good use in your own projects.

Follow along, line by line as the algorithms are developed, and watch it execute, and get a deep understanding of how the algorithms work.

Unlike most other courses, you will actually understand how to put together and use these algorithms in your own code.??This course is heavily practical – its not just boring theory and slides that you see in many other courses that target the same topics.?

What topics are covered in the course?

You will learn five different Pattern Matching algorithms.

Lempel-Ziv-Welch Algorithm

Huffman Compression

Prefix Tree or Trie Tree

Suffix Trie?

Suffix Tree

You will implement two version of Boyer Moore algorithm (the simplest and easiest and the more complex).

And then implement the Suffix Tree from O(n2) to only O(n).?

This is a very long, complex and interesting implementation!

What benefits will you get out of the course?

You will learn and understand complex algorithms.

Improve your confidence in interviews as a result of what you have learned in the course.

Write better Java code, that is more efficient and optimized, factoring in your newly found understanding of memory vs processor trade-offs.

Quite literally, you will take your Java skills to the next level.

Why enrolling in this course is the best decision you can make.

This course helps you to understand how to implement a number of core algorithms.??You will come away with a detailed understanding of how they work, and how to apply what you have learned into your own programs.

You’ll be able to write better Java code, and as a result your programs will be better optimized for execution and use less resources.

After completing this course, you will be able to add the algorithms you have learned into your arsenal of skills, giving you more opportunities to further your career.

The sooner you sign up for this course, the sooner you will have the skills and knowledge you need to increase your job or consulting opportunities. ? ?Your new job or consulting opportunity?awaits! ?

Why not get started today?

?Click the?Signup?button to sign up for the course!

Course Curriculum

Chapter 1: Installation and Setup

Lecture 1: Introduction to the Course

Lecture 2: How to Get the Most from this Course

Lecture 3: Which version of Java should you use?

Lecture 4: Install JDK 10 on Windows

Lecture 5: Install and Configure Intellij on Windows

Lecture 6: Install JDK 10 on a Mac

Lecture 7: Install and Configure Intellij on a Mac

Lecture 8: Install JDK 10 on Linux

Lecture 9: Install and Configure Intellij on Linux

Lecture 10: Creating Maven Project with JUNIT

Lecture 11: Learning Unit Testing with JUNIT

Chapter 2: Pattern Matching Algorithms

Lecture 1: Euclid Augorithm Introduction

Lecture 2: Euclid Algorithm Coding

Lecture 3: Euclid Algorithm Unit Test

Lecture 4: Brute Force Introduction

Lecture 5: Brute Force Coding

Lecture 6: Brute Force Unit Test

Lecture 7: Knuth Morris Pratt (KMP) Introduction

Lecture 8: KMP Longest Suffix Prefix Table Introduction

Lecture 9: KMP Longest Suffix Preffix Table Coding

Lecture 10: KMP Longest Suffix Preffix Table Test

Lecture 11: Knuth Morris Pratt (KMP) Coding

Lecture 12: Knuth Morris Pratt (KMP) Test

Lecture 13: Rabin-Karp Introduction

Lecture 14: Rabin-Karp Coding

Lecture 15: Rabin-Karp Test

Lecture 16: Boyer Moore Horspool Introduction

Lecture 17: Boyer Moore Horspool Coding

Lecture 18: Boyer Moore Horspool Test

Lecture 19: Boyer Moore Introduction

Lecture 20: Boyer Moore Coding Part 1

Lecture 21: Boyer Moore Coding Part 2

Lecture 22: Boyer Moore Coding Part 3

Lecture 23: Z Algorithm Introduction

Lecture 24: Z Algorithm Coding Part1

Lecture 25: Z Algorithm Coding Part2

Chapter 3: Compression Algorithms

Lecture 1: Huffman Compression Encoding Introduction

Lecture 2: Huffman Compression Encoding Coding Part 1

Lecture 3: Huffman Compression Encoding Coding Part 2

Lecture 4: Huffman Compression Encoding Coding Part 3

Lecture 5: Huffman Compression Encoding Coding Part 4

Lecture 6: Huffman Compression Decode Introduction

Lecture 7: Huffman Compression Decode Coding Part 1

Lecture 8: Huffman Compression Decode Coding Part 2

Lecture 9: Huffman Compression Decode Coding Part 3

Lecture 10: LZW Lempel-Ziv-Welch Compression Introduction

Lecture 11: LZW Compression Coding Compression

Lecture 12: LZW Compression Coding Decompression

Chapter 4: Exploring Trie Trees

Lecture 1: Prefix Tree Introduction

Lecture 2: Prefix Tree Coding Part 1

Lecture 3: Prefix Tree Coding Part 2

Lecture 4: Prefix Tree Coding Part 3

Lecture 5: Suffix Trie Introduction

Lecture 6: Suffix Trie Coding Part 1

Lecture 7: Suffix Trie Coding Part 2

Lecture 8: Suffix Trie Coding Part 3

Lecture 9: Suffix Trie Coding Part 4

Lecture 10: Suffix Tree Naive Implementation

Lecture 11: Suffix Tree Ukkonens Ticks

Lecture 12: Suffix Tree Ukkonens Suffix Links

Lecture 13: Suffix Tree Ukkonnens Active Points 1

Lecture 14: Suffix Tree Ukkonnens Active Points 2

Lecture 15: Suffix Tree Ukkonnens Edge Index

Lecture 16: Suffix Tree Ukkonnens Coding Part 1

Lecture 17: Suffix Tree Ukkonnens Testing Part 1

Lecture 18: Suffix Tree Ukkonnens Coding Part 2

Lecture 19: Suffix Tree Ukkonnens Coding Part 3

Lecture 20: Suffix Tree Ukkonnens Coding Part 4

Lecture 21: Suffix Tree Ukkonnens Coding Part 5

Lecture 22: Suffix Tree Ukkonnens Coding Part 6

Chapter 5: Extra Information – Source code, and other stuff

Lecture 1: Source Code

Lecture 2: Bonus Lecture and Information

Instructors

Tim Buchalkas Learn Programming Academy
Professional Programmers and Teachers – 2M students

Marcos Costa
Software Engineer Tech Lead

Rating Distribution

1 stars: 4 votes

2 stars: 11 votes

3 stars: 64 votes

4 stars: 179 votes

5 stars: 206 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!