explanation
Algorithm Part 1is the prime course in a two-part training series and familiarizes you with algorithms and data structures from Princeton University. It covers essential information about algorithms and data structures that programmers must know. Elite focuses more on the scientific analysis of the application of these algorithms and the performance of their implementation in Java. The first part of the course covers the preliminary structure of the data and sorting and searching algorithms. During this time, you will be familiar with starting with a unique set of data structures ( Union-Find ), performing different implementations such as find quickly and weightily, and applying this type of data to spillover problems in physical chemistry.
The analysis algorithm then builds a mathematical model that describes the algorithm’s behavior in a very scientific way, measuring its execution time, developing assumptions about performance, and finally measuring the memory used to learn in the Java program. . In the following sections, we will look at the structure of stacks and queues, implement them using linked lists and arrays, and learn about two more advanced features of Java: generics and iterators. Algorithms for sorting insertions and looseness, joins and other versions. Selective sort and quick sort were covered. Queues, priorities and implementation using binary heaps and sorting using heap sort, dictionaries and trees entailed in applications with sorted arrays (binary search) and unordered lists (search order), geometry for other topics in this course. and retrieve a balanced application of hash tables.
What skills can you gain?
Structural (building) data
algorithm
Programming using Java
Algorithm Specification, Part 1:
Publisher: Coursera
Instructors: Kevin Wayne, Robert Sedgwick
Language:English
Training level: Intermediate
Number: 13 classes in 6 sections
Course duration: approximately 53 hours
procedure
Week 1
- Course Introduction – 10 minutes
- Union−Find – 9 hours
- Algorithm Analysis – 1 hour
Week 2
- Stacks and Queues – 9 hours
- Basic Sorting – 1 hour
Week 3
- Merge sort – 9 hours
- Quicksort – 1 hour
Week 4
- Priority queue – 9 hours
- Basic Symbol Table – 2 hours
Week 5
- Balanced Search Tree – 2 hours
- Geometric Applications of BST – 9 hours
Week 6
- Hash Table – 1 hour
- Symbol Table Application – 26m
precondition
image
sample video
installation manual
Custom view after extraction to player.
Subtitles: English
Quality: 720p
download link
Password file: free download software
file size
1.71GB