1. komponenta

Lecture type	Total
Lectures	30
Exercises	30
Seminar	15

* Load is given in academic hour (1 academic hour = 45 minutes)

COURSE AIMS AND OBJECTIVES: Introduction to programming and algorithmic thinking. Simple problems such as sorting and searching are used to focus on designing correct and efficient algorithms. The course prepares students for advanced programming and computer science courses.

COURSE DESCRIPTION AND SYLLABUS:
1. Introduction to computer science. Concept and examples of algorithms. Examples of basic programs. Examples from mathematical and programming practice. Logical and mathematical prerequisites. (2 weeks)
2. Fundamentals of programming. Data types in the given programming language. Operations on types. Expressions and statements. Functions. (2 weeks)
3. Algorithmic problem solving. Algorithms on integers. Algorithms on arrays. Basic sorting and searching algorithms. Efficiency of solutions. (4 weeks)
4. Advanced algorithms and programming techniques. Recursion. Advanced sorting and searching algorithms. Applications of programming in mathematics. Team programming (version control). (5 weeks)

In addition to lectures and exercises, seminars are planned in which students will be introduced to various other programming languages and/or additional programming topics will be presented.

1. The C Programming Language, 2nd edition, B. W. Kernighan, D. M. Ritchie, Prentice Hall, 1988.
2. Pro Git Book, Chacon & Straub.
3. C programming: A Modern Approach, 2nd edition, K.N King, Norton & Company, 2008.

Izborni predmet 1 - Regular study - Mathematics Education