- Регистрация
- 27 Авг 2018
- Сообщения
- 38,716
- Реакции
- 583,119
- Тема Автор Вы автор данного материала? |
- #1
- develop your own algorithms that best fit to the personal need
- detect non-optimal code snippets
- get to know basic complexity related definitions
- get to know linked lists
- get to know arrays
- get to know balanced trees: AVL trees and red-black trees
- get to know hash tables
- grasp the fundamentals of algorithms and data structures
- Eclipse or other IDE
- Core java
This course is about data structures and algorithms. We are going to implement the problems in Java. The course takes approximately 14 hours to complete. It is highly recommended to type out these data structures several times on your own in order to get a good grasp of it.
Section 1:
- data structures and abstract data types
- what are arrays and linked lists
- arrays and linked list related interview questions
- what are stacks and queues
- heap memory and stack memory
- tree data structures
- binary search trees
- balanced search trees: AVL trees and red-black trees
- splay trees (cache)
- B-trees and their applications in memory
- heaps
- what are hashing and hashtables (hashmaps)
- what are hash-functions
- how to achieve O(1) running time complexity
- what is LRU cache
- LRU cache implementation
- Fenwick trees (binary indexed trees)
- binary indexed tree implementation
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.
Thanks for joining the course, let's get started!
Who this course is for
- This course is meant for everyone from scientists to software developers who want to get closer to algorithmic thinking in the main
DOWNLOAD:
