HOME > Development > Advanced Algorithms and Programming Techniques

Advanced Algorithms and Programming Techniques

  • Development
  • Apr 29, 2025
SynopsisAdvanced Algorithms and Programming Techniques, available at...
Advanced Algorithms and Programming Techniques  No.1

Advanced Algorithms and Programming Techniques, available at $64.99, has an average rating of 4.65, with 28 lectures, 6 quizzes, based on 101 reviews, and has 406 subscribers.

You will learn about Algorithms and Programming Techniques This course is ideal for individuals who are Students who want to prepare for contests and exams It is particularly useful for Students who want to prepare for contests and exams.

Enroll now: Advanced Algorithms and Programming Techniques

Summary

Title: Advanced Algorithms and Programming Techniques

Price: $64.99

Average Rating: 4.65

Number of Lectures: 28

Number of Quizzes: 6

Number of Published Lectures: 28

Number of Published Quizzes: 6

Number of Curriculum Items: 34

Number of Published Curriculum Objects: 34

Original Price: $89.99

Quality Status: approved

Status: Live

What You Will Learn

  • Algorithms and Programming Techniques
  • Who Should Attend

  • Students who want to prepare for contests and exams
  • Target Audiences

  • Students who want to prepare for contests and exams
  • This course presents a group of elementary and advanced Algorithms and Programming Techniques. It is the result of my own experience as a trainer in the field of Competitive Programming, teacher, author and (many times) competitor. It is based on the most important theoretical issues and knowledge a student should master. The topics that are discussed stretch from Recursion and its different peculiar applications (Backtracking, Divide and Conquer) to the Branch and Bound method. The course has two different lessons dedicated to the Dynamic Programming Technique, due to the importance this method has.

    The course contains many well known problems, presents their solutions in a comprehensible way and offers C++ solutions. A clear purpose and objective that the author had in mind was to have neat statements, proper examples, efficient solutions, easy to understand C++ programs. I suppose that the students already have some elementary background in the C++ language, some experience with STL data structures and implemented methods, CodeBlocks Integrated Development Environment, Online Judges .

    Each lesson is followed by some quizzes.

    The students are advised to try to implement on their own the C++ programs for the problems they encounter in the lessons.

    Every time when it was possible, I used some pictures, animations, free templates offered by different sites.

    I hope you will enjoy and appreciate this course.

    Course Curriculum

    Chapter 1: Recursion

    Lecture 1: Recursion

    Lecture 2: The Greatest Common Divisor

    Lecture 3: Josephus problem

    Chapter 2: Greedy algorithms

    Lecture 1: Greedy algorithms

    Chapter 3: Backtracking

    Lecture 1: Backtracking

    Lecture 2: Chess and Backtracking

    Chapter 4: Divide and Conquer

    Lecture 1: Divide and Conquer

    Lecture 2: Normalised Squares

    Chapter 5: Sorting algorithms

    Lecture 1: Sorting algorithms

    Chapter 6: Dynamic Programming

    Lecture 1: Basic examples

    Lecture 2: Memoization

    Lecture 3: Chess and Dynamic Programming

    Lecture 4: Words, Dynamic Programming and Backtracking

    Lecture 5: Catalan numbers

    Lecture 6: Dynamic Programming and Probabilities

    Lecture 7: Dynamic Programming, Games, Paths and other Applications

    Lecture 8: Application: The Bridge and Torch Problem

    Chapter 7: Binary Search

    Lecture 1: Binary Search

    Lecture 2: The Longest Increasing Subsequence and Related Problems

    Lecture 3: Ternary Search

    Lecture 4: Application: Square Fencing

    Chapter 8: Matrix Exponentiation

    Lecture 1: Matrix Exponentiation

    Chapter 9: Sliding Window Technique

    Lecture 1: Sliding Window Technique

    Chapter 10: Advanced Dynamic Programming

    Lecture 1: Advanced Dynamic Programming

    Lecture 2: Dynamic Programming and Computational Geometry

    Lecture 3: The Travelling Salesman Problem

    Chapter 11: Branch and Bound

    Lecture 1: Branch and Bound

    Chapter 12: Meet in the middle technique

    Lecture 1: Meet in the middle technique

    Instructors

  • Advanced Algorithms and Programming Techniques  No.2
    Lucian Ilea
    Teacher of CS at Emil Racovita National College
  • Rating Distribution

  • 1 stars: 3 votes
  • 2 stars: 1 votes
  • 3 stars: 1 votes
  • 4 stars: 2 votes
  • 5 stars: 94 votes
  • Frequently Asked Questions

    How long do I have access to the course materials?

    You can view and review the lecture materials indefinitely, like an on-demand channel.

    Can I take my courses with me wherever I go?

    Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!