Description
Algorithms, Part I, The first course of the 2-part series of training and familiarization with Algorithms And Data structures presented by Princeton University Is . This collection covers essential information about algorithms and data structures that every programmer should know. The focus of this collection is more on the application of these algorithms and the scientific analysis of their implementation in Java language. The first part of this course covers basic data structures and sorting and searching algorithms. During this course, first with the data structure Separate collections (Union-Find) And its various implementations, such as finding and unifying fast and weighted data and applying this type of data to the problem of seepage from physical chemistry.
Then, you will learn to analyze algorithms in a completely scientific way by measuring execution time, developing assumptions about performance, building a mathematical model to explain the behavior of the algorithm, and finally measuring the memory used by the Java program. In the next sections, stack and queue structures and their implementation with linked list and array and introduction to two advanced features of Java namely generics and iterators, insertion and shell sorting algorithms, integration and its different versions, selection and Quicksort coverage. are given Priority queues and implementation with binary heap and sorting with heapsort, dictionaries and implementation with sorted array (binary search) and unordered list (sequential search) along with its applications, balanced search trees and applications Its geometry and hash tables are other topics of this course.
What skills do you acquire:
- Data structure
- Algorithms
- Programming with Java
Specifications of Algorithms, Part I:
- Publisher: Coursera
- teacher : Kevin Wayne, Robert Sedgewick
- English language
- Education level: Intermediate
- Number: 13 lessons in 6 sections
- Duration of the course: approximately 53 hours
courses
Week 1
- Course Introduction – 10m
- Union-Find – 9h
- Analysis of Algorithms – 1h
Week 2
- Stacks and Queues – 9h
- Elementary Sorts – 1h
Week 3
- Mergesort – 9h
- Quicksort – 1h
Week 4
- Priority Queues – 9h
- Elementary Symbol Tables – 2h
Week 5
- Balanced Search Trees – 2h
- Geometric Applications of BSTs – 9h
Week 6
- Hash Tables – 1h
- Symbol Table Applications – 26m
prerequisites
Pictures
Sample video
Installation guide
After extracting, watch with your favorite player.
Subtitle: English and…
Quality: 720p
download link
Password file(s): www.downloadly.ir
Size
1.71 GB