Logic lessons in Netherlands

Find your perfect private logic tutor in Netherlands.
Learn logic with our teachers at home or in their studio.

7 logic teachers in Netherlands

0 teachers in my wish list
+

7 logic teachers in Netherlands

Trusted teacher: The lessons will start with an introduction to a C++ program, then they will advance to simple data structures, operations, and basic algorithms. Moreover, the lessons will move to more advanced data structures such as 1D arrays, 2D arrays, lists, stacks, maps, and later on, to classes and objects. There will also be tasks included in each lesson so that the newly introduced terms will be put into practice. INTRODUCTION 1) Compilers LEVEL 1 - NOVICE PROGRAMMER 1) Structure of a program / Input and output 2) Variables, Constants, Types 3) Operators 4) Basic algorithms I: a) What's an algorithm? b) Calculations (+, -, /, %, *, pow, sqrt) c) Swap algorithm 5) Instructions: a) Conditional instructions: if b) Repetitive instructions: for, while, do-while 6) Basic algorithms II: a) Maximum and minimum values from a list of variables b) Digits of an integer c) Divisors of an integer d) Greatest Common Divisor e) Prime Number Testing f) Base switch (binary, decimal, etc) g) Greatest Common Divisor of two integers 7) Documentation and debugging LEVEL 2 - BEGINNER PROGRAMMER 1) One-dimensional arrays: a) Definition and implementation b) Reading and displaying of arrays c) Inserting an element in an array d) Deleting an element in an array e) Sorting arrays f) Searching in an array: sequential search, binary search g) Merging of two arrays 2) Functions: a) Definition and implementation b) Functions with type and void functions c) Recursive functions d) Algorithms III (A combination of Algorithms I and Algorithms II, but using functions this time) e) Applications LEVEL 3 - INTERMEDIATE PROGRAMMER 1) Matrices (Two-dimensional arrays): a) Definition and implementation b) Reading and displaying of matrices c) Square matrices and operations on matrices 2) Character sequences: a) Definition and implementation b) Predefined functions on character sequences c) Applications 3) Struct data types: a) Definition and implementation b) Applications LEVEL 4 - UPPER-INTERMEDIATE PROGRAMMER 1) Lists: a) Definition and implementation b) Applications 2) Stacks: a) Definition and implementation b) Applications 3) Queues: a) Definition and implementation b) Applications LEVEL 5 - ADVANCED PROGRAMMER 1) Introduction to STL (Standard Template Library) and applications 2) Undirected graphs: a) Definition and implementation b) Traversing graphs c) Partial graphs / Spanning subgraphs d) Depth-First Search Algorithm e) Paths f) Cycles g) Hamilton cycle h) Hamilton graphs i) Eulerian cycle j) Eulerian graphs k) Applications 3) Directed graphs: a) Definition and implementation b) Traversing graphs c) Partial graphs / Spanning subgraphs d) Depth-First Search Algorithm e) Paths f) Cycles g) Hamilton cycle h) Hamilton graphs i) Eulerian cycle j) Eulerian graphs k) Applications 4) Graphs with costs: a) Definition and implementation b) Traversing graphs c) Prim's Algorithm d) Applications LEVEL 6 - EXPERT PROGRAMMER 1) Introduction to Object-Oriented Programming (OOP) a) Classes and properties of classes b) Fields c) Methods d) Protection levels of classes e) Applications
Computer programming · Logic · Computer science
Showing results 26 - 40 of 4026 - 40 of 40