Princeton University - Algorithms - Part 1 and 2
Date: 1 February 2013 | Posted by: pm1
Princeton University - Algorithms - Part 1 and 2
English | Audio: aac, 44100 Hz, stereo (und)
MP4 | Video: h264, yuv420p, 960x540, 29.97 fps(r) (und) | 2.78 GB
Lectures + slides + demos + Exams + Exercises
Genre: Video Training
English | Audio: aac, 44100 Hz, stereo (und)
MP4 | Video: h264, yuv420p, 960x540, 29.97 fps(r) (und) | 2.78 GB
Lectures + slides + demos + Exams + Exercises
Genre: Video Training
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. An introduction to fundamental data types, algorithms, and data structures, with emphasis on applications and scientific performance analysis of Java implementations.
Specific topics covered include: union-find algorithms; basic iterable data types (stack, queues, and bags); sorting algorithms (quicksort, mergesort, heapsort) and applications; priority queues; binary search trees; red-black trees; hash tables; and symbol-table applications.
Part I covers basic iterable data types, sorting, and searching algorithms.
Part II covers graph-processing algorithms, including minimum spanning tree and shortest paths algorithms, and string processing algorithms, including string sorts, tries, substring search, regular expressions, and data compression, and concludes with an overview placing the contents of the course in a larger context.
.
.
.
See full article