Coursera – Algorithms, Part I 2021-1 – Downloadly
Description
Algorithms, Part I, is the main course in the two-part training series and provides familiarity with Princeton University’s algorithms and data structures. It contains important information about algorithms and data structures that every programmer should know. Elite focuses more on the application of these algorithms and scientific analysis of their implementation performance in Java. The first part of the course covers the preparatory structures of data as well as sorting and search algorithms. During this time, the data structure of various data sets (Union-Find) will begin and various data on the subject of sludge from physical chemistry will be used.
Then the algorithm scientifically analyzes the running time, develops assumptions about performance, creates a mathematical model to explain the behavior of the algorithm, and finally measures the memory that the Java program uses to learn. . The next sections are about the structure of stack and queues and their implementation with the link list and array as well as a familiarity with two advanced features of Java namely generics and iterators etc. Algorithms that sort, combine and miscellaneous insertion and loose versions of it. Selective and quicksort were covered. The queue, priority and implementation with a binary heap and sorting with heapsort., the dictionary and implementation with sorted array (binary search) and an unordered list (search order) attached to the application and it is the Tree, finding a balanced application of its geometric and hash tables are the other topics of the course.
What skills do you earn:
Structural data (building data).
Algorithms
Programming with Java
Specifications of Algorithms, Part I:
Publisher: Coursera
Lecturers: Kevin Wayne, Robert Sedgewick
Language: English
Training level: Medium
Number: 13 lessons in 6 sections
Course duration: approx. 53 hours
Courses
week 1
- Course introduction – 10 m
- Union−Find – 9h
- Analysis of algorithms – 1h
Week 2
- Stacks and queues – 9h
- Elementary sorts – 1h
Week 3
- Merge sort – 9h
- Quicksort – 1h
Week 4
- Priority queues – 9 hours
- Elementary symbol tables – 2h
Week 5
- Balanced Search Trees – 2h
- Geometric Applications of BSTs – 9h
Week 6
- Hash tables – 1h
- Symbol table applications – 26 m
requirements
Pictures
Example film
installation Guide
After extracting with the player you will get your custom view.
Subtitles: English
Quality: 720p
Download link
Password file(s): free software
File size
1.71GB