Description
Algorithms, part I, is the main course in the 2-part training series and familiarization with algorithms and data structures provided by Princeton University. It covers essential information about algorithms and data structures that every programmer should know. Elite focuses more on the application of these algorithms and the scientific analysis of their implementation performance in Java. The first part of the course covers preliminary data structures and sorting and searching algorithms. During this period, start with the data structure of collections of distinct ( Union-Find ), and implement different it’s like find and has fast and weight and apply this kind of data on exudate issue of physical chemistry will be familiar.
Then, the analysis of algorithms in a completely scientific way consists of measuring the execution time, the elaboration of hypotheses on the performances, to build a mathematical model to explain the behavior of the algorithm, and finally, to measure the memory used by the Java program to learn. In the following sections, the structure of Stack and Queues and their implementation with Link List and Array, and a familiarity with two advanced Java features i.e. Generics and Iterators etc. sorting algorithms Insertion and Loose, combined and different versions of it. Selective and Quicksort have been covered. The queue, priority, and implementation with a binary heap and sorting with heapsort., the dictionary and implementation with the sorted array ( Binary Search ), and the unordered list ( search order ) to accompany the ‘application, and it is the tree, looking for a balanced application of its geometric and hash tables of the other topics of the course are.
What skills does it get you:
Structural data (building)
Algorithms
Programming with Java
Algorithm Specifications Part I:
Publisher: Coursera
Speaker: Kevin Wayne, Robert Sedgewick
French language
Level of training: Medium
Number: 13 lessons in 6 sections
Course duration: approximately 53 hours
Course
Week 1
- Introduction to the course – 10m
- Union−Find – 9am
- Analysis of Algorithms – 1h
Week 2
- Stacks and Queues – 9am
- Elementary sorts – 1h
Week 3
- Merge – 9am
- Quick sorting – 1 hour
Week 4
- Priority Queues – 9am
- Tables of elementary symbols – 2h
Week 5
- Balanced research trees – 2h
- Geometric applications of BST – 9am
Week 6
- Hash tables – 1h
- Symbol Table Applications – 26m
Preconditions
Pictures
sample movie
Installation guide
After extracting with the player, your custom view.
Subtitles: English
Quality: 720p
Download link
Password file(s): ngaur.com
File size
1.71 GB