Lectures
Introductory lecture, organizational matters, a summary of the necessary knowledge of subject Algorithms I
Object-oriented paradigm (OOP), object, class, attribute, method
OOP in C + +, dynamic memory allocation
Inheritance
Polymorphism, virtual methods
Abstract data types, use of OOP
Graph data structure, depth and breadth first traversal
Binary trees, definition, searching
Binary trees, insertion, deletion, tree travesal
Overview of balanced binary trees, B-trees
Hashing
Search in text
The content of computer excercise
Repetition of subject Algorithms I
Class implementation in C + +
Constructors and destructors
Dynamic memory allocation
Inheritance, class hierarchies sample
Polymorphism, pure virtual methods
Graph, graphs implementation
Graph traversal
Binary Trees
Using hash tables
Search in text
Project content
Entering the project will aim to deal with the OOP.
Introductory lecture, organizational matters, a summary of the necessary knowledge of subject Algorithms I
Object-oriented paradigm (OOP), object, class, attribute, method
OOP in C + +, dynamic memory allocation
Inheritance
Polymorphism, virtual methods
Abstract data types, use of OOP
Graph data structure, depth and breadth first traversal
Binary trees, definition, searching
Binary trees, insertion, deletion, tree travesal
Overview of balanced binary trees, B-trees
Hashing
Search in text
The content of computer excercise
Repetition of subject Algorithms I
Class implementation in C + +
Constructors and destructors
Dynamic memory allocation
Inheritance, class hierarchies sample
Polymorphism, pure virtual methods
Graph, graphs implementation
Graph traversal
Binary Trees
Using hash tables
Search in text
Project content
Entering the project will aim to deal with the OOP.