UDEMY 2021 - Algorithms and Data Structures in Java – Part I
- 1. UDEMY 2021 - Create Ethereum & Blockchain Applications Using Solidity
- 2. UDEMY 2021 - Ethereum : Decentralized Application Design & Development
- 3. UDEMY 2021 - ARP spoofing &Man In The Middle Attacks Execution &Detection
- 4. UDEMY 2021 - Ethical Hacking for Mobile Phones, Facebook & Social Media!
AVL tree, red-black tree, B-tree, binary search tree, array, linked list, stack, queue and splay tree
What Will I Learn?
This course is about data structures and algorithms. We are going to implement the problems in Java, but I try to do it as generic as possible: so the core of the algorithms can be used in C++ or Python. The course takes approximately 11 hours to complete. I highly recommend typing out these data structures several times on your own in order to get a good grasp of it.
In the first part of the course we are going to learn about basic data structures such as linked lists, stacks and queues, heaps and some advanced ones such as AVL trees, red-black trees or hash tables. We will try to optimize each data structure ( for example avoiding obsolete references ) as much as possible.
In each chapter I am going to talk about the theoretical background of each algorithm or data structure, then we are going to write the code on a step by step basis in Eclipse, Java.
Most of the advanced algorithms relies heavily on these topics so it is definitely worth understanding the basics. These principles can be used in several fields: in investment banking, artificial intelligence or electronic trading algorithms on the stock market.
LAST UPDATE OF THE COURSE: 2016 october
Who is the target audience?
Created by Holczer BalazsLast updated 4/2018EnglishEnglish [Auto-generated]
Size: 1.45 GB