Mô tả

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.

Bạn sẽ học được gì

Algorithms and Programming Techniques

Yêu cầu

  • C++, CodeBlocks, elementary level
  • The students should be able to read and understand C++ programs

Nội dung khoá học

12 sections

Recursion

4 lectures
Recursion
03:18
The Greatest Common Divisor
09:58
The Greatest Common Divisor
5 questions
Josephus' problem
06:12

Greedy algorithms

2 lectures
Greedy algorithms
10:31
Greedy algorithms quiz
3 questions

Backtracking

3 lectures
Backtracking
06:59
Chess and Backtracking
06:01
Backtracking
3 questions

Divide and Conquer

3 lectures
Divide and Conquer
10:43
Divide and Conquer
3 questions
Normalised Squares
06:14

Sorting algorithms

2 lectures
Sorting algorithms
11:21
Sorting algorithms
3 questions

Dynamic Programming

9 lectures
Basic examples
11:25
Memoization
04:24
Dynamic Programming
3 questions
Chess and Dynamic Programming
07:39
Words, Dynamic Programming and Backtracking
05:46
Catalan numbers
09:40
Dynamic Programming and Probabilities
08:35
Dynamic Programming, Games, Paths and other Applications
13:43
Application: The Bridge and Torch Problem
07:18

Binary Search

4 lectures
Binary Search
15:34
The Longest Increasing Subsequence and Related Problems
12:36
Ternary Search
08:44
Application: Square Fencing
07:25

Matrix Exponentiation

1 lectures
Matrix Exponentiation
15:06

Sliding Window Technique

1 lectures
Sliding Window Technique
19:44

Advanced Dynamic Programming

3 lectures
Advanced Dynamic Programming
11:19
Dynamic Programming and Computational Geometry
09:25
The Travelling Salesman Problem
10:33

Branch and Bound

1 lectures
Branch and Bound
10:51

Meet in the middle technique

1 lectures
Meet in the middle technique
08:05

Đánh giá của học viên

Chưa có đánh giá
Course Rating
5
0%
4
0%
3
0%
2
0%
1
0%

Bình luận khách hàng

Viết Bình Luận

Bạn đánh giá khoá học này thế nào?

image

Đăng ký get khoá học Udemy - Unica - Gitiho giá chỉ 50k!

Get khoá học giá rẻ ngay trước khi bị fix.