Tags
Language
Tags
July 2025
Su Mo Tu We Th Fr Sa
29 30 1 2 3 4 5
6 7 8 9 10 11 12
13 14 15 16 17 18 19
20 21 22 23 24 25 26
27 28 29 30 31 1 2
    Attention❗ To save your time, in order to download anything on this site, you must be registered 👉 HERE. If you do not have a registration yet, it is better to do it right away. ✌

    ( • )( • ) ( ͡⚆ ͜ʖ ͡⚆ ) (‿ˠ‿)
    SpicyMags.xyz

    Coursera - Algorithms: Design and Analysis, Part 1 (2013) [repost]

    Posted By: ParRus
    Coursera - Algorithms: Design and Analysis, Part 1 (2013) [repost]

    Coursera - Algorithms: Design and Analysis, Part 1 (2013)
    English | MP4 + PDF slides | 960 x 540 | AVC ~22.2 kbps | 15 fps
    AAC | 128 Kbps | 44.1 KHz | 2 channels | Subs: English (srt) | ~19 hours | 1.24 GB
    Genre: eLearning Video / Programming, Algorithm

    In this course you will learn several fundamental principles of algorithm design. You'll learn the divide-and-conquer design paradigm, with applications to fast sorting, searching, and multiplication. You'll learn several blazingly fast primitives for computing on graphs, such as how to compute connectivity information and shortest paths. Finally, we'll study how allowing the computer to "flip coins" can lead to elegant and practical algorithms and data structures.
    Learn the answers to questions such as: How do data structures like heaps, hash tables, bloom filters, and balanced search trees actually work, anyway? How come QuickSort runs so fast? What can graph algorithms tell us about the structure of the Web and social networks? Did my 3rd-grade teacher explain only a suboptimal algorithm for multiplying two numbers?

    Course Syllabus
    Week 1: Introduction. Asymptotic analysis including big-oh notation. Divide-and-conquer algorithms for sorting, counting inversions, matrix multiplication, and closest pair.

    Week 2: Running time analysis of divide-and-conquer algorithms. The master method. Introduction to randomized algorithms, with a probability review. QuickSort.

    Week 3: More on randomized algorithms and probability. Computing the median in linear time. A randomized algorithm for the minimum graph cut problem.

    Week 4: Graph primitives. Depth- and breadth-first search. Connected components in undirected graphs. Topological sort in directed acyclic graphs. Strongly connected components in directed graphs.

    Week 5: Dijkstra's shortest-path algorithm. Introduction to data structures. Heaps and applications.

    Week 6: Further data structures. Hash tables and applications. Balanced binary search trees.

    More Info: homepage

    second part: Coursera - Algorithms: Design and Analysis, Part 2

    General
    Complete name : 013_3 - 3 - Strassens Subcubic Matrix Multiplication Algorithm (22 min).mp4
    Format : MPEG-4
    Format profile : Base Media
    Codec ID : isom
    File size : 23.6 MiB
    Duration : 22mn 31s
    Overall bit rate mode : Variable
    Overall bit rate : 146 Kbps
    Writing application : Lavf53.29.100

    Video
    ID : 1
    Format : AVC
    Format/Info : Advanced Video Codec
    Format profile : High@L3.1
    Format settings, CABAC : Yes
    Format settings, ReFrames : 4 frames
    Codec ID : avc1
    Codec ID/Info : Advanced Video Coding
    Duration : 22mn 31s
    Bit rate : 22.2 Kbps
    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.58 MiB (15%)
    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

    Audio
    ID : 2
    Format : AAC
    Format/Info : Advanced Audio Codec
    Format profile : LC
    Codec ID : 40
    Duration : 22mn 31s
    Bit rate mode : Variable
    Bit rate : 120 Kbps
    Maximum bit rate : 128 Kbps
    Channel(s) : 2 channels
    Channel positions : Front: L R
    Sampling rate : 44.1 KHz
    Compression mode : Lossy
    Stream size : 19.3 MiB (82%)
    Screenshots

    Coursera - Algorithms: Design and Analysis, Part 1 (2013) [repost]

    Coursera - Algorithms: Design and Analysis, Part 1 (2013) [repost]

    Coursera - Algorithms: Design and Analysis, Part 1 (2013) [repost]

    Coursera - Algorithms: Design and Analysis, Part 1 (2013) [repost]

    You can find my other Coursera-posts: here
    For more, Visit my AH-blog

    no mirrors please, Follow The Rules