This course aims to prepare students in competitive problem solving.
It will benefit students who want to compete in ICPC, invited high school students who want to compete in IOI, and students in general who aspire to excel in technical interviews of top IT companies.
This course introduces students to the design and implementation of fundamental data structures and algorithms. It covers basic data structures (linked lists, stacks, queues, binary heaps, hash tables, binary search trees, and graphs), searching and sorting algorithms, basic analysis of algorithms.
It covers techniques for attacking and solving challenging computational problems. Fundamental algorithmic solving techniques covered include complete search, divide/reduce/transform and conquer, greedy and mathematics.
Programming language libraries that are commonly used in problem solving will also be taught.
You will be tested at the end of the training. If you do not pass the test, you will repeat the same training for free.
Feel free to contact us when you have any important questions regarding this module.
Relevant answers will be posted here to reach wider audiences.
Q: What will i learn from this course?
A: You will learn techniques for attacking and solving challenging computational problems. Fundamental algorithmic solving techniques covered include complete search, divide/reduce/transform and conquer, greedy, dynamic programming. Domain specific techniques like graph, mathematics-related and string processing will also be covered.
Q: Why will we use C++ programming language in the course?
A:
Q: What is the next step after finishing the course?
A: After finishing the course you will be qualified to other programming courses such as :
Q: Why should i choose PST courses to learn programming and problem solving?
A:
This website uses cookies. By continuing to use this site, you accept our use of cookies.