René's URL Explorer Experiment

{
  "@context": "https://schema.org/",
  "@type": "Course",
  "publisher": {
    "@type": "Organization",
    "name": "Coursera",
    "url": "https://www.coursera.org"
  },
  "financialAidEligible": "Financial Aid available for eligible students.",
  "educationalCredentialAwarded": {
    "@type": "EducationalOccupationalCredential",
    "name": "Coursera Certificate"
  },
  "@id": "https://www.coursera.org/learn/algorithms-greedy",
  "name": "Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming",
  "description": "The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).",
  "image": [
    "https://d3njjcbhbojbot.cloudfront.net/api/utilities/v1/imageproxy/https://coursera.s3.amazonaws.com/topics/algo2/large-icon.png"
  ],
  "about": [
    "Algorithms",
    "Graph Theory",
    "Bioinformatics",
    "Theoretical Computer Science",
    "Computational Thinking",
    "Data Structures"
  ],
  "teaches": [],
  "offers": {
    "@type": "Offer",
    "category": "Partially Free"
  },
  "aggregateRating": {
    "@type": "AggregateRating",
    "ratingValue": 4.842352941176471,
    "bestRating": 5,
    "ratingCount": 1275
  },
  "provider": {
    "@type": "Organization",
    "name": "Stanford University",
    "url": "http://online.stanford.edu/"
  },
  "educationalLevel": "Intermediate",
  "totalHistoricalEnrollment": 81698,
  "inLanguage": "en",
  "availableLanguage": [
    "ar",
    "az",
    "bn",
    "de",
    "el",
    "es",
    "fa",
    "fr",
    "hi",
    "hu",
    "id",
    "it",
    "ja",
    "kk",
    "ko",
    "nl",
    "pl",
    "ps",
    "pt",
    "ru",
    "sv",
    "th",
    "tr",
    "uk",
    "ur",
    "vi",
    "zh"
  ],
  "syllabusSections": [
    {
      "@type": "Syllabus",
      "name": "Week 1",
      "description": "Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.",
      "timeRequired": "PT3H55M38S"
    },
    {
      "@type": "Syllabus",
      "name": "Week 2",
      "description": "Kruskal's MST algorithm and applications to clustering; advanced union-find (optional). ",
      "timeRequired": "PT4H27M36S"
    },
    {
      "@type": "Syllabus",
      "name": "Week 3",
      "description": "Huffman codes; introduction to dynamic programming.",
      "timeRequired": "PT2H31M20S"
    },
    {
      "@type": "Syllabus",
      "name": "Week 4",
      "description": "Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.",
      "timeRequired": "PT3H46M40S"
    }
  ],
  "coursePrerequisites": [],
  "review": [
    {
      "@type": "Review",
      "author": {
        "@type": "Person",
        "name": "SC"
      },
      "datePublished": "2020-12-31T00:00:00.000Z",
      "reviewBody": "Best (not one of the best) course available on web to learn theoretical algorithms. You will love it. Enjoy new journey and perspect to view and analyze algorithms. Loved it damn!",
      "reviewRating": {
        "@type": "Rating",
        "bestRating": "5",
        "ratingValue": 5
      }
    },
    {
      "@type": "Review",
      "author": {
        "@type": "Person",
        "name": "YA"
      },
      "datePublished": "2021-02-04T00:00:00.000Z",
      "reviewBody": "This course has wonderful lectures coupled with challenging but rewarding homework problems. It was a wonderful learning experience.",
      "reviewRating": {
        "@type": "Rating",
        "bestRating": "5",
        "ratingValue": 5
      }
    },
    {
      "@type": "Review",
      "author": {
        "@type": "Person",
        "name": "QA"
      },
      "datePublished": "2017-05-06T00:00:00.000Z",
      "reviewBody": "Outstanding course.  Prof. Roughgarden is enthusiastic.  The lectures, programming problems, and readings build a solid understanding.",
      "reviewRating": {
        "@type": "Rating",
        "bestRating": "5",
        "ratingValue": 5
      }
    },
    {
      "@type": "Review",
      "author": {
        "@type": "Person",
        "name": "NS"
      },
      "datePublished": "2020-03-15T00:00:00.000Z",
      "reviewBody": "Very well explained and I learned a lot from the course. Recommended to anyone for learning Algorithms. Some of the problem sets make you think outside the box.",
      "reviewRating": {
        "@type": "Rating",
        "bestRating": "5",
        "ratingValue": 5
      }
    },
    {
      "@type": "Review",
      "author": {
        "@type": "Person",
        "name": "JF"
      },
      "datePublished": "2018-01-14T00:00:00.000Z",
      "reviewBody": "I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.  ",
      "reviewRating": {
        "@type": "Rating",
        "bestRating": "5",
        "ratingValue": 5
      }
    }
  ],
  "hasCourseInstance": [
    {
      "@type": "CourseInstance",
      "courseMode": "Online",
      "courseWorkload": "PT14H41M14S",
      "instructor": {
        "@type": "Person",
        "name": "Tim Roughgarden",
        "description": "Computer Science",
        "image": "https://d3njjcbhbojbot.cloudfront.net/api/utilities/v1/imageproxy/https://coursera-instructor-photos.s3.amazonaws.com/39/5f06ad710dbaa7be59c8272d8902bd/landing_roughgarden.png"
      }
    }
  ]
}

          {"@context":"http://schema.org","@type":"FAQPage","mainEntity":[{"@type":"Question","name":"When will I have access to the lectures and assignments?","acceptedAnswer":{"@type":"Answer","text":"To access the course materials, assignments and to earn a Certificate, you will need to purchase the Certificate experience when you enroll in a course.  You can try a Free Trial instead, or apply for Financial Aid. The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience."}},{"@type":"Question","name":"What will I get if I subscribe to this Specialization?","acceptedAnswer":{"@type":"Answer","text":"When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile."}},{"@type":"Question","name":"Is financial aid available?","acceptedAnswer":{"@type":"Answer","text":"Yes. In select learning programs, you can apply for financial aid or a scholarship if you can’t afford the enrollment fee. If fin aid or scholarship is available for your learning program selection, you’ll find a link to apply on the description page."}}]}
        

        {"@context":"http://schema.org","@graph":[{"@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"item":{"name":"Browse","@id":"https://www.coursera.org/browse"}},{"@type":"ListItem","position":2,"item":{"name":"Computer Science","@id":"https://www.coursera.org/browse/computer-science"}},{"@type":"ListItem","position":3,"item":{"name":"Algorithms","@id":"https://www.coursera.org/browse/computer-science/algorithms#mooc"}}]}]}