Class at Faculty of Mathematics and Physics |
NMUG103
Syllabus
- Brief history of computers
- Fundamental hardware and its functionality
- Operating systems
- Programming languages
- Using IDE
- Basic commands
- Variables and constants
- Basic data structures
- Input and output
- Procedures and functions
- Algorithms and their efficiency
- Elementary algorithms - divisibility, Euclid's algorithm, sieve of Eratosthenes, Horner's scheme, long numbers, searching in arrays, etc.
Annotation
The aim of this course is to provide a brief introduction to the principles of computers, to practice algorithmic thinking, learn simple algorithms and basic principles of procedural programming.