Coursera - Algorithms: Design and Analysis (Stanford University)
WEBRip | English | MP4 | 960 x 540 | AVC ~21.7 kbps | 15 fps
AAC | 113 Kbps | 44.1 KHz | 2 channels | ~30 hours | 3.66 GB
Genre: eLearning Video / Computer Science, Programming
Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This course is an introduction to algorithms for learners with at least a little programming experience. The course is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this course, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.

Specific topics include: "Big-oh" notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), randomized algorithms (QuickSort, contraction algorithm for min cuts), data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of BFS and DFS, connectivity, shortest paths).

About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.

Syllabus:
Week 1
Introduction; "big-oh" notation and asymptotic analysis; divide-and-conquer basics.
Week 2
The master method for analyzing divide and conquer algorithms; the QuickSort algorithm and its analysis; probability review.
Week 3
Linear-time selection; graphs, cuts, and the contraction algorithm.
Week 4
Breadth-first and depth-first search; computing strong components; applications.
Week 5
Dijkstra's shortest-path algorithms; heaps; balanced binary search trees.
Week 6
Hashing; bloom filters.
Week 7
Final exam (1 attempt per 24 hours)

Specific topics in Part 2 include: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes), dynamic programming (knapsack, sequence alignment, optimal search trees, shortest paths), NP-completeness and what it means for the algorithm designer, analysis of heuristics, local search.

About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.

Syllabus
Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.
Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional); Huffman codes.
Week 3
Dynamic programming: introduction, the knapsack problem, sequence alignment, and optimal binary search trees.
Week 4
The Bellman-Ford algorithm; all-pairs shortest paths.
Week 5
NP-complete problems and exact algorithms for them.
Week 6
Approximation and local search algorithms for NP-complete problems; the wider world of algorithms.
Final Exam
Final exam (1 attempt per 24 hours)

General
Complete name : 01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.mp4
Format : MPEG-4
Format profile : Base Media
Codec ID : isom (isom/iso2/avc1/mp41)
File size : 21.6 MiB
Duration : 21 min 48 s
Overall bit rate mode : Variable
Overall bit rate : 139 kb/s
Encoded date : UTC 1970-01-01 00:00:00
Tagged date : UTC 1970-01-01 00:00:00
Writing application : Lavf53.29.100

Video
ID : 1
Format : AVC
Format/Info : Advanced Video Codec
Format profile : High@L3.1
Format settings : CABAC / 4 Ref Frames
Format settings, CABAC : Yes
Format settings, RefFrames : 4 frames
Codec ID : avc1
Codec ID/Info : Advanced Video Coding
Duration : 21 min 48 s
Bit rate : 21.7 kb/s
Width : 960 pixels
Height : 540 pixels
Display aspect ratio : 16:9
Frame rate mode : Constant
Frame rate : 15.000 FPS
Color space : YUV
Chroma subsampling : 4:2:0
Bit depth : 8 bits
Scan type : Progressive
Bits/(Pixel*Frame) : 0.003
Stream size : 3.38 MiB (16%)
Writing library : x264 core 120 r2120 0c7dab9
Encoding settings : cabac=1 / ref=3 / deblock=1:0:0 / analyse=0x3:0x113 / me=hex / subme=7 / psy=1 / psy_rd=1.00:0.00 / mixed_ref=1 / me_range=16 / chroma_me=1 / trellis=1 / 8x8dct=1 / cqm=0 / deadzone=21,11 / fast_pskip=1 / chroma_qp_offset=-2 / threads=12 / sliced_threads=0 / nr=0 / decimate=1 / interlaced=0 / bluray_compat=0 / constrained_intra=0 / bframes=3 / b_pyramid=2 / b_adapt=1 / b_bias=0 / direct=1 / weightb=1 / open_gop=0 / weightp=2 / keyint=250 / keyint_min=15 / scenecut=40 / intra_refresh=0 / rc_lookahead=40 / rc=crf / mbtree=1 / crf=28.0 / qcomp=0.60 / qpmin=0 / qpmax=69 / qpstep=4 / ip_ratio=1.40 / aq=1:1.00
Encoded date : UTC 1970-01-01 00:00:00
Tagged date : UTC 1970-01-01 00:00:00

Audio
ID : 2
Format : AAC
Format/Info : Advanced Audio Codec
Format profile : LC
Codec ID : mp4a-40-2
Duration : 21 min 48 s
Bit rate mode : Variable
Bit rate : 113 kb/s
Maximum bit rate : 128 kb/s
Channel(s) : 2 channels
Channel positions : Front: L R
Sampling rate : 44.1 kHz
Frame rate : 43.066 FPS (1024 SPF)
Compression mode : Lossy
Stream size : 17.6 MiB (81%)
Default : Yes
Alternate group : 1
Encoded date : UTC 1970-01-01 00:00:00
Tagged date : UTC 1970-01-01 00:00:00

Screenshots








Download link:
Kod:


rapidgator_net:
https://rapidgator.net/file/e2e8b7b84d094eab3c673ca066353ea3/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part01.rar.html
https://rapidgator.net/file/cceedfce454c43438ccee01e233e8e6a/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part02.rar.html
https://rapidgator.net/file/b8049474df29424b107d71152e95c138/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part03.rar.html
https://rapidgator.net/file/e0adfa2259fb416c3815994af619e995/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part04.rar.html
https://rapidgator.net/file/043bace6f7ffac88b8b37e68f875c3c9/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part05.rar.html
https://rapidgator.net/file/dabf208c14096daedb8a408c4ac02727/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part06.rar.html
https://rapidgator.net/file/9ee288c8b0da0a3989c8f30a933f3d47/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part07.rar.html
https://rapidgator.net/file/3b8c08fefef6c3aa530a5e28956a6573/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part08.rar.html
https://rapidgator.net/file/14b7ab90ab084b38432e34b074ab649c/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part09.rar.html

nitroflare_com:
http://nitroflare.com/view/77710B6A7CAB628/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part01.rar
http://nitroflare.com/view/2D1BCA2D9E1A9E5/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part02.rar
http://nitroflare.com/view/42CEA6461B0B1A2/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part03.rar
http://nitroflare.com/view/57CAB6DC7CF8104/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part04.rar
http://nitroflare.com/view/C444B3BF7F008EE/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part05.rar
http://nitroflare.com/view/473506ED16D561B/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part06.rar
http://nitroflare.com/view/3ECA6C79E03C12D/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part07.rar
http://nitroflare.com/view/BA4F4F0362F8122/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part08.rar
http://nitroflare.com/view/1903ED77680C38C/zmi4f.Coursera..Algorithms.Design.and.Analysis..Stanford.University.Part.12.part09.rar
Links are Interchangeable - No Password - Single Extraction