TopPodcast.com
Menu
  • Home
  • Top Charts
  • Top Networks
  • Top Apps
  • Top Independents
  • Top Podfluencers
  • Top Picks
    • Top Business Podcasts
    • Top True Crime Podcasts
    • Top Finance Podcasts
    • Top Comedy Podcasts
    • Top Music Podcasts
    • Top Womens Podcasts
    • Top Kids Podcasts
    • Top Sports Podcasts
    • Top News Podcasts
    • Top Tech Podcasts
    • Top Crypto Podcasts
    • Top Entrepreneurial Podcasts
    • Top Fantasy Sports Podcasts
    • Top Political Podcasts
    • Top Science Podcasts
    • Top Self Help Podcasts
    • Top Sports Betting Podcasts
    • Top Stocks Podcasts
  • Podcast News
  • About Us
  • Podcast Advertising
  • Contact
Not in our directory?
Add Show Here
Podcast Equipment
Center

toppodcastlogoOur TOPPODCAST Picks

  • Comedy
  • Crypto
  • Sports
  • News
  • Politics
  • True Crime
  • Business
  • Finance

Follow Us

toppodcastlogoStay Connected

    View Top 200 Chart
    Back to Rankings Page
    Technology

    Algorithm Design and Analysis

    The purpose of this undergraduate course is to introduce fundamental techniques and viewpoints for the design and the analysis of efficient computer algorithms, and to study important specific algorithms. The course relies heavily on mathematics and mathematical thinking in two ways: first as a way of proving properties about particular algorithms such as termination, and correctness; and second, as a way of establishing bounds on the worst case (or average case) use of some resource, usually time, by a specific algorithm. The course covers some randomized algorithms as well as deterministic algorithms.

    Advertise

    Copyright: © Copyright The Regents of the University of California, Davis campus, 2012. All Rights Reserved.

    • Apple Podcasts
    • Google Play
    • Spotify

    Latest Episodes:
    Coping with NP-completeness Dec 03, 2010
    Show notes

    Lecture 28: Gusfield recaps NP-completeness. The professor discusses coping with NP-complete problems: approximation algorithms and lowering the exponent of exponential-time algorithms.


    Major theorems of NP-completeness Dec 01, 2010
    Show notes

    Lecture 27 covers the major theorems of NP-completeness, P = NP question, and how to prove a new problem in NP-complete.


    Formal definition of P and NP Nov 29, 2010
    Show notes

    In Lecture 26, Gusfield gives correct, formal definitions of P and NP, ending with a brief definition of NP-complete problems (languages).


    An intuitive view of NP Nov 24, 2010
    Show notes

    Lecture 25 deals with an intuitive view of NP - not the correct formal definition.


    Introduction to P and NP Nov 22, 2010
    Show notes

    Lecture 24 gives an introduction to P and NP and polynomial-time reductions.


    Introduction to approximation algorithms Nov 17, 2010
    Show notes

    Lecture 23 covers approximation algorithms - definition, factor of two approximation for the center cover problem.


    Finish of linear-time pattern matching Nov 15, 2010
    Show notes

    Lecture 22 completes linear-time pattern matching using the Z-algorithm


    Linear-time pattern matching. Z-values and Z-algorithm Nov 12, 2010
    Show notes

    In Lecture 21, Gusfield covers linear-time pattern matching. He also discusses Z-values and Z-algorithms.


    Unique-Decipherability. Graph algorithm and proof of correctness Nov 10, 2010
    Show notes

    Lecture 20 deals with unique-decipherability: efficient graph-based algorithm and proof of correctness.


    The unique-decipherability problem Nov 08, 2010
    Show notes

    Lecture 19 covers the unique-decipherability problem and gives definitions and the start of a graph-based solution.


    Previous 1 2 3

    Related Podcasts

    Reply All

    1

    Reply All Games & Hobbies
    Inside VR & AR

    2

    Inside VR & AR Gadgets
    Note to Self

    3

    Note to Self News
    BrainStuff

    4

    BrainStuff Natural Sciences
    This Week in Tech (Audio)

    5

    This Week in Tech (Audio) News
    Hands-On Tech (Audio)

    6

    Hands-On Tech (Audio) Technology
    footer-logo

    Contact Us

    Toll Free: 844-670-7747

    Links

    • Home
    • Top Charts
    • Networks
    • Apps
    • Independents Podcasts
    • Podcast Advertising
    • Podcast News
    • Contact Us
    • About Us
    • Analytics & Insights

    Stay Connected

      Privacy, Terms of Use & Our Code of Ethics Protecting Content Creators Copyrights