C++ Programming, Algorithms and Data Structures
80-Hour Live Course | 5 ECTS Credits | Official University Certificate
12–14 Weeks - English - Small Groups
12–14 Weeks - English - Small Groups
About the Course
This course is devoted to the study of the C++ programming language and the fundamental algorithms and data structures that form the basis of computer science education.
The program combines procedural and object-oriented programming with the theoretical foundations of algorithm design, complexity analysis, and the practical implementation of classical algorithms.
The course is delivered in a live interactive format and is designed for students who wish to build a strong academic and practical foundation in programming.
The program combines procedural and object-oriented programming with the theoretical foundations of algorithm design, complexity analysis, and the practical implementation of classical algorithms.
The course is delivered in a live interactive format and is designed for students who wish to build a strong academic and practical foundation in programming.
The objectives of the course are:
- To develop systematic knowledge of programming in C++
- To train students to design correct and efficient algorithms
- To introduce fundamental data structures and their implementation
- To develop skills in analyzing time and space complexity
Upon successful completion of the course, students will be able to:
- Develop programs in C++ using standard libraries
- Apply basic and advanced data processing algorithms
- Implement linear and non-linear data structures
- Evaluate algorithm efficiency using asymptotic complexity (Big O notation)
- Apply algorithmic thinking to solve applied computational problems
The course is organized according to a modular approach and consists of two logically complete modules.
Module I
C++ Programming
(Weeks 1–7)
C++ Programming
(Weeks 1–7)
- Introduction to C++ Programming
- Program Structure and Data Types
- Control Structures (Conditionals and Loops)
- Functions and Recursion
- Arrays and Strings
- Pointers and Dynamic Memory Allocation
- Structures and File Handling
- Midterm Assessment
Module II
Algorithms and Data Structures in C++
(Weeks 8–12)
Algorithms and Data Structures in C++
(Weeks 8–12)
- Algorithm Analysis and Big O Notation
- Searching and Sorting Algorithms
- Linear Data Structures (Stacks, Queues, Linked Lists)
- Trees (Binary Trees, Binary Search Trees, Heaps)
- Graphs (DFS and BFS Algorithms)
- Final Project or Examination
24 hours
Lectures
38 hours
Laboratory or Practical Classes
16 hours
Individual work (checking assignments)
2 hours
Final project
- Teaching MethodsTeaching methods include:
- Live lectures with multimedia support
- Practical and laboratory classes
- Independent student work
- Project-based learning
- Assessment MethodsStudent performance is evaluated through:
- Laboratory assignments
- Midterm assessment
- Final project or examination
| Oksana Koshova Associate Professor, PhD in Pedagogical Sciences Has been working at Poltava University of Economics and Trade since 2001. Author of more than 50 academic publications. |
Who Should Apply
- Students of computer science
- Beginners in programming
- Professionals wishing to strengthen algorithmic knowledge
- International students seeking European academic certification
Course Prices
Small Group Format:
Maximum 15 students
Maximum 15 students
Please complete the form below to apply for the C++ Programming course
Our admissions team will contact you with further details and payment instructions
You agree to our Terms and Conditions
