Operating Systems and Basics of Programming 2800-SOPP-GI-1-S2

1 The computer system . Operating System . The development of operating systems. Examples of operating systems. A brief discussion of the different operating systems. Advantages and disadvantages of operating systems.
2 File Systems. File Organization . Access Methods . Directory structure . Managing files in Unix and Windows .
3 Working in Windows : install the software , customize the system to the user's requirements , the use of the Internet.
4 Work on Unix / Linux .
5 Algorithms - Introduction . The concept of the algorithm , the definition of the algorithm. Examples of algorithms that solve simple tasks . Languages write algorithms : flowcharts, programming languages .
6 Programming language. Review of the simple types. Variables. Basic control structures (instructions : conditional , limited and conditional iteration ) . The syntax and semantics of instructions. The structure of the program. Compiling programs. Input and output . Development environments .
7 The data and its structure. Review of basic data structures. Declarations of structural types. Examples of the use of particular types.
8 Functions .

Total student workload

15h - laboratories, 15h - individual work - current preparation for classes, studying of literature, 15h - individual work - preparing homeworks, 10h - individual work - preparation for the test

Learning outcomes - knowledge

After completing the course the student: - knows the principles of operation and construction of modern operating systems (Windows, UNIX, Linux); - knows the theoretical and practical issues relating to programming, in particular, algorithms and the basic elements of a programming language; - has an extended knowledge in science (computer science) - has knowledge of modern specialized tools of geoinformatics allowing analysing a visualizationg of geographic data - is aware of the importance of new technologies and techniques in the field of geographic information systems in the development of civilization, including in the area of natural sciences and technology.

Learning outcomes - skills

After completing the course the student: - is able to safely and efficiently work with the operating system; - is able to design algorithms and to write simple programs that implement them.

Learning outcomes - social competencies

After completing the course the student: - effectively communicates his thoughts to other in a meaningful way; actually uses the terminology of expertise, - is focused on the best execution of tasks; cares about detail and is systematically - correctly draws conclusions using the principles of logic, - possesses an expanded knowledge of science (K_W03) - shows the need for continuous updating of knowledge of computer science and specialized software (K_K01, K_K02)

Teaching methods

Issues discussed on this subject are given to students in the form of short lectures interspersed with information and problem-shows. Laboratory classes allow students to deepen their knowledge assimilated during lectures.

Observation/demonstration teaching methods

- display

Expository teaching methods

- description
- narration
- discussion

Exploratory teaching methods

- practical

Type of course

compulsory course

Prerequisites

Knowledge of school mathematics at the primary level. Basic computer skills (launching applications, using web services, the use of a simple text editor).

Course coordinators

Term 2022/23Z:

Krzysztof Leśniak

Term 2024/25Z:

Dominika Daab

Term 2023/24Z:

Dominika Daab

Assessment criteria

Examination of laboratory exercises is based on performed tasks, a short paper and active participation in classes.

Bibliography

Basic literature:
1. A. Silberschatz, J.L. Peterson, G. Gagne, Podstawy systemów operacyjnych. WNT, Warszawa 2005.
2. A.S. Tanenbaum, Systemy Operacyjne, Wydanie III, Wydawnictwo Helion, 2010.
3. N. Wirth, Algorytmy + struktury danych = programy, WNT, Warszawa.
4. Any Python course book.
Further reading:
1. W. Stallings, Systemy operacyjne. Struktura i zasady budowy, PWN, 2006.
2. D. Harel, Rzecz o istocie informatyki: Algorytmika, WNT, Warszawa.
3. L. Banachowski, K. Diks, W. Ryttter, Algorytmy i struktury danych, WNT, Warszawa.
4. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Wprowadzenie do algorytmów, WNT, Warszawa.

Additional information

Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system:

Description of 2800-SOPP-GI-1-S2 in USOSweb